Abstract
The authors provide an efficient fast Fourier transform implementation, a set of optimal windows, and a new proof of the perfect reconstruction property for a critically sampled filter bank introduced by Princen and Bradley. Based on the new proof, necessary conditions for perfect reconstruction are also derived for the oversampled case. This filter bank is well suited to compression of speech and images due to its good frequency resolution, overlapped output, computational efficiency, and low delay. The authors evaluated its performance in a 32 band, 16-kb/s adaptive speech compression system, and found both its objective and subjective performance to be comparable to a more complex quadrature mirror filter bank. In image coding experiments, the Princen-Bradley filter bank demonstrated quality similar to DCT-based systems at high rates and reduced blocking artifacts at rates of 0.25-0.5 bpp. A psychophysically based bit allocation algorithm that provides a significant perceptual improvement over a related algorithm that seeks to minimize the mean-square error is introduced.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
