diff --git a/pom.xml b/pom.xml index 580dcf2c..c03a5dd9 100644 --- a/pom.xml +++ b/pom.xml @@ -6,7 +6,7 @@ sh.ball osci-render - 1.4.1 + 1.5.0 osci-render diff --git a/src/main/java/sh/ball/audio/AudioPlayer.java b/src/main/java/sh/ball/audio/AudioPlayer.java index c83af1bd..6b51be61 100644 --- a/src/main/java/sh/ball/audio/AudioPlayer.java +++ b/src/main/java/sh/ball/audio/AudioPlayer.java @@ -14,6 +14,7 @@ import xt.audio.Structs.XtMix; import xt.audio.Structs.XtStreamParams; import java.io.*; +import java.util.ArrayList; import java.util.HashMap; import java.util.Map; import java.util.concurrent.ArrayBlockingQueue; @@ -25,6 +26,8 @@ import sh.ball.shapes.Vector2; import javax.sound.sampled.AudioFormat; import javax.sound.sampled.AudioInputStream; import java.util.List; +import java.util.concurrent.Semaphore; +import java.util.concurrent.locks.ReentrantLock; public class AudioPlayer implements Renderer, AudioInputStream> { @@ -37,6 +40,8 @@ public class AudioPlayer implements Renderer, AudioInputStream> { private final XtFormat format; private final BlockingQueue> frameQueue = new ArrayBlockingQueue<>(BUFFER_SIZE); private final Map effects = new HashMap<>(); + private final ReentrantLock lock = new ReentrantLock(); + private final List listeners = new ArrayList<>(); private ByteArrayOutputStream outputStream; private boolean recording = false; @@ -58,6 +63,7 @@ public class AudioPlayer implements Renderer, AudioInputStream> { private int render(XtStream stream, XtBuffer buffer, Object user) throws InterruptedException { XtSafeBuffer safe = XtSafeBuffer.get(stream); safe.lock(buffer); + lock.lock(); float[] output = (float[]) safe.getOutput(); for (int f = 0; f < buffer.frames; f++) { @@ -73,9 +79,7 @@ public class AudioPlayer implements Renderer, AudioInputStream> { output[f * format.channels.outputs] = leftChannel; output[f * format.channels.outputs + 1] = rightChannel; - if (recording) { - writeVector(leftChannel, rightChannel); - } + writeChannels(leftChannel, rightChannel); audioFramesDrawn++; @@ -90,17 +94,33 @@ public class AudioPlayer implements Renderer, AudioInputStream> { } } safe.unlock(buffer); + lock.unlock(); return 0; } - private void writeVector(float leftChannel, float rightChannel) { + private void writeChannels(float leftChannel, float rightChannel) { int left = (int)(leftChannel * Short.MAX_VALUE); int right = (int)(rightChannel * Short.MAX_VALUE); - outputStream.write((byte) left); - outputStream.write((byte)(left >> 8)); - outputStream.write((byte) right); - outputStream.write((byte)(right >> 8)); + byte b0 = (byte) left; + byte b1 = (byte)(left >> 8); + byte b2 = (byte) right; + byte b3 = (byte)(right >> 8); + + if (recording) { + outputStream.write(b0); + outputStream.write(b1); + outputStream.write(b2); + outputStream.write(b3); + } + + for (Listener listener : listeners) { + listener.write(b0); + listener.write(b1); + listener.write(b2); + listener.write(b3); + listener.notifyIfFull(); + } framesRecorded++; } @@ -194,6 +214,24 @@ public class AudioPlayer implements Renderer, AudioInputStream> { effects.remove(identifier); } + @Override + public void read(byte[] buffer) throws InterruptedException { + Listener listener = new Listener(buffer); + try { + lock.lock(); + listeners.add(listener); + } finally { + lock.unlock(); + } + listener.waitUntilFull(); + try { + lock.lock(); + listeners.remove(listener); + } finally { + lock.unlock(); + } + } + @Override public void startRecord() { outputStream = new ByteArrayOutputStream(); @@ -211,4 +249,32 @@ public class AudioPlayer implements Renderer, AudioInputStream> { return new AudioInputStream(new ByteArrayInputStream(input), audioFormat, framesRecorded); } + + private static class Listener { + private final byte[] buffer; + private final Semaphore sema; + + private int offset; + + private Listener(byte[] buffer) { + this.buffer = buffer; + this.sema = new Semaphore(0); + } + + private void waitUntilFull() throws InterruptedException { + sema.acquire(); + } + + private void notifyIfFull() { + if (offset >= buffer.length) { + sema.release(); + } + } + + private void write(byte b) { + if (offset < buffer.length) { + buffer[offset++] = b; + } + } + } } diff --git a/src/main/java/sh/ball/audio/FrequencyAnalyser.java b/src/main/java/sh/ball/audio/FrequencyAnalyser.java new file mode 100644 index 00000000..4e40ddb1 --- /dev/null +++ b/src/main/java/sh/ball/audio/FrequencyAnalyser.java @@ -0,0 +1,113 @@ +package sh.ball.audio; + +import sh.ball.audio.fft.FFT; + +import java.util.ArrayList; +import java.util.List; + +public class FrequencyAnalyser implements Runnable { + + private static final float NORMALIZATION_FACTOR_2_BYTES = Short.MAX_VALUE + 1.0f; + + private final Renderer renderer; + private final List listeners = new ArrayList<>(); + private final int frameSize; + private final int sampleRate; + + public FrequencyAnalyser(Renderer renderer, int frameSize, int sampleRate) { + this.renderer = renderer; + this.frameSize = frameSize; + this.sampleRate = sampleRate; + } + + public void addListener(FrequencyListener listener) { + listeners.add(listener); + } + + private void notifyListeners(double leftFrequency, double rightFrequency) { + for (FrequencyListener listener : listeners) { + listener.updateFrequency(leftFrequency, rightFrequency); + } + } + + // Adapted from https://stackoverflow.com/questions/53997426/java-how-to-get-current-frequency-of-audio-input + @Override + public void run() { + byte[] buf = new byte[2 << 18]; // <--- increase this for higher frequency resolution + + while (true) { + try { + renderer.read(buf); + } catch (InterruptedException e) { + e.printStackTrace(); + } + double[] leftSamples = decode(buf, true); + double[] rightSamples = decode(buf, false); + + FFT leftFft = new FFT(leftSamples, null, false, true); + FFT rightFft = new FFT(rightSamples, null, false, true); + + double[] leftMags = leftFft.getMagnitudeSpectrum(); + double[] rightMags = rightFft.getMagnitudeSpectrum(); + double[] bins = leftFft.getBinLabels(sampleRate); + + int maxLeftIndex = 0; + double maxLeft = Double.NEGATIVE_INFINITY; + int maxRightIndex = 0; + double maxRight = Double.NEGATIVE_INFINITY; + for (int i = 1; i < leftMags.length; i++) { + if (bins[i] < 20 || bins[i] > 20000) { + continue; + } + if (leftMags[i] > maxLeft) { + maxLeftIndex = i; + maxLeft = leftMags[i]; + } + if (rightMags[i] > maxRight) { + maxRightIndex = i; + maxRight = rightMags[i]; + } + } + + notifyListeners(bins[maxLeftIndex], bins[maxRightIndex]); + } + } + + private double[] decode(final byte[] buf, boolean decodeLeft) { + final double[] fbuf = new double[(buf.length / 2) / frameSize]; + int byteNum = 0; + int i = 0; + for (int pos = 0; pos < buf.length; pos += frameSize) { + int sample = byteToIntLittleEndian(buf, pos, frameSize); + // normalize to [0,1] (not strictly necessary, but makes things easier) + double normalSample = sample / NORMALIZATION_FACTOR_2_BYTES; + if (decodeLeft) { + if (byteNum < 2) { + fbuf[i++] = normalSample; + } + } else if (byteNum >= 2) { + fbuf[i++] = normalSample; + } + byteNum++; + byteNum %= 4; + } + return fbuf; + } + + private double[] toMagnitudes(final float[] realPart, final float[] imaginaryPart) { + final double[] powers = new double[realPart.length / 2]; + for (int i = 0; i < powers.length; i++) { + powers[i] = Math.sqrt(realPart[i] * realPart[i] + imaginaryPart[i] * imaginaryPart[i]); + } + return powers; + } + + private static int byteToIntLittleEndian(final byte[] buf, final int offset, final int bytesPerSample) { + int sample = 0; + for (int byteIndex = 0; byteIndex < bytesPerSample; byteIndex++) { + final int aByte = buf[offset + byteIndex] & 0xff; + sample += aByte << 8 * (byteIndex); + } + return sample; + } +} diff --git a/src/main/java/sh/ball/audio/FrequencyListener.java b/src/main/java/sh/ball/audio/FrequencyListener.java new file mode 100644 index 00000000..a850e134 --- /dev/null +++ b/src/main/java/sh/ball/audio/FrequencyListener.java @@ -0,0 +1,6 @@ +package sh.ball.audio; + +public interface FrequencyListener { + + void updateFrequency(double leftFrequency, double rightFrequency); +} diff --git a/src/main/java/sh/ball/audio/Renderer.java b/src/main/java/sh/ball/audio/Renderer.java index 124eb734..669b95a2 100644 --- a/src/main/java/sh/ball/audio/Renderer.java +++ b/src/main/java/sh/ball/audio/Renderer.java @@ -14,6 +14,8 @@ public interface Renderer extends Runnable { void removeEffect(Object identifier); + void read(byte[] buffer) throws InterruptedException; + void startRecord(); T stopRecord(); diff --git a/src/main/java/sh/ball/audio/fft/FFT.java b/src/main/java/sh/ball/audio/fft/FFT.java new file mode 100644 index 00000000..a780f5eb --- /dev/null +++ b/src/main/java/sh/ball/audio/fft/FFT.java @@ -0,0 +1,736 @@ +/* + * @(#)FFT.java 1.0 April 5, 2005. + * + * Cory McKay + * McGill Univarsity + * + * https://sourceforge.net/p/jaudio/svn/2/tree/jAudio%201.0/src/jAudioFeatureExtractor/jAudioTools/FFT.java + * + * GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Lesser General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License along + with this program; if not, write to the Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) year name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + , 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. + */ + +package sh.ball.audio.fft; + + +/** + * This class performs a complex to complex Fast Fourier Transform. Forward and inverse + * transforms may both be performed. The transforms may be performed with or without + * the application of a Hanning window. + * + *

The FFT is performed by this class' constructor. The real and imaginary results + * are both stored, and the magnitude spectrum, power spectrum and phase angles may + * also be accessed (along with appropriate frequency bin labels for the magnitude + * and power spectra). + * + * @author Cory McKay + */ +public class FFT +{ + /* FIELDS ******************************************************************/ + + + // The results of the FFT. + private double[] real_output; + private double[] imaginary_output; + + // The phase angles + private double[] output_angle; + + // Magnitude and power spectra + private double[] output_magnitude; + private double[] output_power; + + + /* CONSTRUCTOR *************************************************************/ + + + /** + * Performs the Fourier transform and stores the real and imaginary results. + * Input signals are zero-padded if they do not have a length equal to a + * power of 2. + * + * @param real_input The real part of the signal to be transformed. + * @param imaginary_input The imaginary part of the signal to be. + * transformed. This may be null if the signal + * is entirely real. + * @param inverse_transform A value of false implies that a forward + * transform is to be applied, and a value of + * true means that an inverse transform is tob + * be applied. + * @param use_hanning_window A value of true means that a Hanning window + * will be applied to the real_input. A value + * of valse will result in the application of + * a Hanning window. + * @throws Exception Throws an exception if the real and imaginary + * inputs are of different sizes or if less than + * three input samples are provided. + */ + public FFT( double[] real_input, + double[] imaginary_input, + boolean inverse_transform, + boolean use_hanning_window ) { + // Throw an exception if non-matching input signals are provided + if (imaginary_input != null) + if (real_input.length != imaginary_input.length) + throw new RuntimeException("Imaginary and real inputs are of different sizes."); + + // Throw an exception if less than three samples are provided + if (real_input.length < 3) + throw new RuntimeException( "Only " + real_input.length + " samples provided.\n" + + "At least three are needed." ); + + // Verify that the input size has a number of samples that is a + // power of 2. If not, then increase the size of the array using + // zero-padding. Also creates a zero filled imaginary component + // of the input if none was specified. + int valid_size = ensureIsPowerOfN(real_input.length, 2); + if (valid_size != real_input.length) + { + double[] temp = new double[valid_size]; + for (int i = 0; i < real_input.length; i++) + temp[i] = real_input[i]; + for (int i = real_input.length; i < valid_size; i++) + temp[i] = 0.0; + real_input = temp; + + if (imaginary_input == null) + { + imaginary_input = new double[valid_size]; + for (int i = 0; i < imaginary_input.length; i++) + imaginary_input[i] = 0.0; + } + else + { + temp = new double[valid_size]; + for (int i = 0; i < imaginary_input.length; i++) + temp[i] = imaginary_input[i]; + for (int i = imaginary_input.length; i < valid_size; i++) + temp[i] = 0.0; + imaginary_input = temp; + } + } + else if (imaginary_input == null) + { + imaginary_input = new double[valid_size]; + for (int i = 0; i < imaginary_input.length; i++) + imaginary_input[i] = 0.0; + } + + // Instantiate the arrays to hold the output and copy the input + // to them, since the algorithm used here is self-processing + real_output = new double[valid_size]; + System.arraycopy(real_input, 0, real_output, 0, valid_size); + imaginary_output = new double[valid_size]; + System.arraycopy(imaginary_input, 0, imaginary_output, 0, valid_size); + + // Apply a Hanning window to the real values if this option is + // selected + if (use_hanning_window) + { + for (int i = 0; i < real_output.length; i++) + { + double hanning = 0.5 - 0.5 * Math.cos(2 * Math.PI * i / valid_size); + real_output[i] *= hanning; + } + } + + // Determine whether this is a forward or inverse transform + int forward_transform = 1; + if (inverse_transform) + forward_transform = -1; + + // Reorder the input data into reverse binary order + double scale = 1.0; + int j = 0; + for (int i = 0; i < valid_size; ++i) + { + if (j >= i) + { + double tempr = real_output[j] * scale; + double tempi = imaginary_output[j] * scale; + real_output[j] = real_output[i] * scale; + imaginary_output[j] = imaginary_output[i] * scale; + real_output[i] = tempr; + imaginary_output[i] = tempi; + } + int m = valid_size / 2; + while (m >= 1 && j >= m) + { + j -= m; + m /= 2; + } + j += m; + } + + // Perform the spectral recombination stage by stage + int stage = 0; + int max_spectra_for_stage; + int step_size; + for( max_spectra_for_stage = 1, step_size = 2 * max_spectra_for_stage; + max_spectra_for_stage < valid_size; + max_spectra_for_stage = step_size, step_size = 2 * max_spectra_for_stage) + { + double delta_angle = forward_transform * Math.PI / max_spectra_for_stage; + + // Loop once for each individual spectra + for (int spectra_count = 0; spectra_count < max_spectra_for_stage; ++spectra_count) + { + double angle = spectra_count * delta_angle; + double real_correction = Math.cos(angle); + double imag_correction = Math.sin(angle); + + int right = 0; + for (int left = spectra_count; left < valid_size; left += step_size) + { + right = left + max_spectra_for_stage; + double temp_real = real_correction * real_output[right] - + imag_correction * imaginary_output[right]; + double temp_imag = real_correction * imaginary_output[right] + + imag_correction * real_output[right]; + real_output[right] = real_output[left] - temp_real; + imaginary_output[right] = imaginary_output[left] - temp_imag; + real_output[left] += temp_real; + imaginary_output[left] += temp_imag; + } + } + max_spectra_for_stage = step_size; + } + + // Set the angle and magnitude to null originally + output_angle = null; + output_power = null; + output_magnitude = null; + } + + /* PUBLIC METHODS **********************************************************/ + + /** + * Returns the magnitudes spectrum. It only makes sense to call + * this method if this object was instantiated as a forward Fourier + * transform. + * + *

Only the left side of the spectrum is returned, as the folded + * portion of the spectrum is redundant for the purpose of the magnitude + * spectrum. This means that the bins only go up to half of the + * sampling rate. + * + * @return The magnitude of each frequency bin. + */ + public double[] getMagnitudeSpectrum() + { + // Only calculate the magnitudes if they have not yet been calculated + if (output_magnitude == null) + { + int number_unfolded_bins = imaginary_output.length / 2; + output_magnitude = new double[number_unfolded_bins]; + for(int i = 0; i < output_magnitude.length; i++) + output_magnitude[i] = ( Math.sqrt(real_output[i] * real_output[i] + imaginary_output[i] * imaginary_output[i]) ) / real_output.length; + } + + // Return the magnitudes + return output_magnitude; + } + + + /** + * Returns the power spectrum. It only makes sense to call + * this method if this object was instantiated as a forward Fourier + * transform. + * + *

Only the left side of the spectrum is returned, as the folded + * portion of the spectrum is redundant for the purpose of the power + * spectrum. This means that the bins only go up to half of the + * sampling rate. + * + * @return The magnitude of each frequency bin. + */ + public double[] getPowerSpectrum() + { + // Only calculate the powers if they have not yet been calculated + if (output_power == null) + { + int number_unfolded_bins = imaginary_output.length / 2; + output_power = new double[number_unfolded_bins]; + for(int i = 0; i < output_power.length; i++) + output_power[i] = (real_output[i] * real_output[i] + imaginary_output[i] * imaginary_output[i]) / real_output.length; + } + + // Return the power + return output_power; + } + + + /** + * Returns the phase angle for each frequency bin. It only makes sense to + * call this method if this object was instantiated as a forward Fourier + * transform. + * + *

Only the left side of the spectrum is returned, as the folded + * portion of the spectrum is redundant for the purpose of the phase + * angles. This means that the bins only go up to half of the + * sampling rate. + * + * @return The phase angle for each frequency bin in degrees. + */ + public double[] getPhaseAngles() + { + // Only calculate the angles if they have not yet been calculated + if (output_angle == null) + { + int number_unfolded_bins = imaginary_output.length / 2; + output_angle = new double[number_unfolded_bins]; + for(int i = 0; i < output_angle.length; i++) + { + if(imaginary_output[i] == 0.0 && real_output[i] == 0.0) + output_angle[i] = 0.0; + else + output_angle[i] = Math.atan(imaginary_output[i] / real_output[i]) * 180.0 / Math.PI; + + if(real_output[i] < 0.0 && imaginary_output[i] == 0.0) + output_angle[i] = 180.0; + else if(real_output[i] < 0.0 && imaginary_output[i] == -0.0) + output_angle[i] = -180.0; + else if(real_output[i] < 0.0 && imaginary_output[i] > 0.0) + output_angle[i] += 180.0; + else if(real_output[i] < 0.0 && imaginary_output[i] < 0.0) + output_angle[i] += -180.0; + } + } + + // Return the phase angles + return output_angle; + } + + + /** + * Returns the frequency bin labels for each bin referred to by the + * real values, imaginary values, magnitudes and phase angles as + * determined by the given sampling rate. + * + * @param sampling_rate The sampling rate that was used to perform + * the FFT. + * @return The bin labels. + */ + public double[] getBinLabels(double sampling_rate) + { + int number_bins = real_output.length; + double bin_width = sampling_rate / (double) number_bins; + int number_unfolded_bins = imaginary_output.length / 2; + double[] labels = new double[number_unfolded_bins]; + labels[0] = 0.0; + for (int bin = 1; bin < labels.length; bin++) + labels[bin] = bin * bin_width; + return labels; + } + + + /** + * Returns the real values as calculated by the FFT. + * + * @return The real values. + */ + public double[] getRealValues() + { + return real_output; + } + + + /** + * Returns the real values as calculated by the FFT. + * + * @return The real values. + */ + public double[] getImaginaryValues() + { + return imaginary_output; + } + + /* PRIVATE METHODS *********************************************************/ + + /** + * If the given x is a power of the given n, then x is returned. + * If not, then the next value above the given x that is a power + * of n is returned. + * + *

IMPORTANT: Both x and n must be greater than zero. + * + * @param x The value to ensure is a power of n. + * @param n The power to base x's validation on. + */ + private static int ensureIsPowerOfN(int x, int n) + { + double log_value = logBaseN((double) x, (double) n); + int log_int = (int) log_value; + int valid_size = pow(n, log_int); + if (valid_size != x) + valid_size = pow(n, log_int + 1); + return valid_size; + } + + /** + * Returns the logarithm of the specified base of the given number. + * + *

IMPORTANT: Both x and n must be greater than zero. + * + * @param x The value to find the log of. + * @param n The base of the logarithm. + */ + private static double logBaseN(double x, double n) + { + return (Math.log10(x) / Math.log10(n)); + } + + /** + * Returns the given a raised to the power of the given b. + * + *

IMPORTANT: b must be greater than zero. + * + * @param a The base. + * @param b The exponent. + */ + private static int pow(int a, int b) + { + int result = a; + for (int i = 1; i < b; i++) + result *= a; + return result; + } +} \ No newline at end of file diff --git a/src/main/java/sh/ball/gui/Controller.java b/src/main/java/sh/ball/gui/Controller.java index c145d3c1..96a0eb29 100644 --- a/src/main/java/sh/ball/gui/Controller.java +++ b/src/main/java/sh/ball/gui/Controller.java @@ -1,6 +1,9 @@ package sh.ball.gui; +import javafx.application.Platform; import javafx.scene.control.*; +import sh.ball.audio.FrequencyAnalyser; +import sh.ball.audio.FrequencyListener; import sh.ball.audio.Renderer; import sh.ball.audio.effect.Effect; import sh.ball.audio.effect.EffectType; @@ -42,7 +45,7 @@ import sh.ball.parser.ParserFactory; import sh.ball.shapes.Shape; import sh.ball.shapes.Vector2; -public class Controller implements Initializable { +public class Controller implements Initializable, FrequencyListener { private static final int SAMPLE_RATE = 192000; private static final InputStream DEFAULT_OBJ = Controller.class.getResourceAsStream("/models/cube.obj"); @@ -60,6 +63,8 @@ public class Controller implements Initializable { private Stage stage; + @FXML + private Label frequencyLabel; @FXML private Button chooseFileButton; @FXML @@ -220,6 +225,9 @@ public class Controller implements Initializable { executor.submit(producer); new Thread(renderer).start(); + FrequencyAnalyser, AudioInputStream> analyser = new FrequencyAnalyser<>(renderer, 2, SAMPLE_RATE); + analyser.addListener(this); + new Thread(analyser).start(); } private void toggleRecord() { @@ -338,4 +346,11 @@ public class Controller implements Initializable { protected void setObjRotate(Vector3 vector) { producer.setFrameSettings(ObjSettingsFactory.rotation(vector)); } + + @Override + public void updateFrequency(double leftFrequency, double rightFrequency) { + Platform.runLater(() -> + frequencyLabel.setText(String.format("L Frequency: %d Hz\nR Frequency: %d Hz", Math.round(leftFrequency), Math.round(rightFrequency))) + ); + } } diff --git a/src/main/resources/fxml/osci-render.fxml b/src/main/resources/fxml/osci-render.fxml index 31ca8c08..05b78667 100644 --- a/src/main/resources/fxml/osci-render.fxml +++ b/src/main/resources/fxml/osci-render.fxml @@ -12,7 +12,7 @@ - + @@ -20,8 +20,8 @@ -