New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks

@article{Britanak2009NewUR,
  title={New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks},
  author={V. Britanak},
  journal={Signal Process.},
  year={2009},
  volume={89},
  pages={2213-2232}
}
  • V. Britanak
  • Published 2009
  • Mathematics, Computer Science
  • Signal Process.
New universal rotation-based fast computational structures identical both for the discrete cosine/sine transform of type IV (DCT-IV/DST-IV) and the forward/backward modified discrete cosine/sine transform (MDCT/MDST) computation are described. They are the result of a systematic construction of a fast algorithm for an efficient implementation of the time domain aliasing cancellation (TDAC) analysis/synthesis MDCT/MDST filter banks employed in various audio compression schemes. New fast… Expand
New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard
New fast computational structures identical for an efficient implementation of both the forward and backward modified discrete cosine transform (MDCT) in MPEG-1/2 Layer III (MP3) audio codingExpand
A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art
This tutorial paper describes various efficient implementations (published and new unpublished) of the forward and backward modified discrete cosine transform (MDCT) in the MPEG layer III (MP3) audioExpand
Generalized fast mixed-radix algorithm for the computation of forward and inverse MDCTs
This paper presents a generalized mixed-radix decimation-in-time (DIT) fast algorithm for computing the modified discrete cosine transform (MDCT) of the composite lengths N=2xq^m, m>=2, where q is anExpand
Fast Conversion Algorithm for the Dolby Digital (Plus) AC-3 Audio Coding Standards
  • V. Britanak
  • Computer Science
  • IEEE Signal Processing Letters
  • 2012
TLDR
A fast conversion algorithm is presented to convert the frequency coefficients of the long (MDCT) transform to those of two short transforms and vice versa, directly in the frequency domain, thus minimizing the amount of partial decoding/encoding and memory requirements during the conversion and transcoding processes. Expand
Low-Cost and High-Accuracy Design of Fast Recursive MDCT/MDST/IMDCT/IMDST Algorithms and Their Realization
TLDR
The proposed algorithm not only can simultaneously compute MDCT and MDST (or IMDCT and IMDST) coefficients by adopting a compact recursive structure but also can increase the peak signal-to-noise ratio (PSNR) value by selecting the optimal q factor. Expand
Short-critical-path and structurally orthogonal scaled CORDIC-based approximations of the eight-point discrete cosine transform
A family of multiplierless transforms is presented that approximate the eight-point type-II discrete cosine transform (DCT) as accurately as the state-of-the-art scaled DCT schemes, but having 14-17%Expand
Design and Digital Implementation of Fast and Recursive DCT II–IV Algorithms
TLDR
In this paper, signal flow graphs for the n-point DCT II and DCT IV algorithms are introduced and the arithmetic complexity and stability of the algorithms are explored, and improvements of these algorithms are compared with previously existing fast and stable DCT algorithms. Expand
On Properties, Relations, and Simplified Implementation of Filter Banks in the Dolby Digital (Plus) AC-3 Audio Coding Standards
  • V. Britanak
  • Mathematics, Computer Science
  • IEEE Transactions on Audio, Speech, and Language Processing
  • 2011
TLDR
It is shown that there exists a simple relation between the time domain aliased data sequence recovered by the backward long (MDCT) and those of two short transforms, which means that the current implementation of AC-3 filter banks for the time/frequency transformation of an audio data block can be simplified in the encoder and the forward long ( MDCT) transform computation is required only. Expand
New fast algorithms for the low delay MDCT computation in the MPEG-4 AAC enhanced low delay audio coding standard
TLDR
The new proposed and improved TDAC-MD CT-based fast LD-MDCT algorithms provide the unified efficient implementation of LD- MDCT and TDAC -MDCT filter banks in all four codecs: AAC-ELD, AAC-LD, HE-AAC and AAC-LC. Expand
Spectral Band Replication (SBR) compression technology: Survey of the unified efficient low-cost implementations of complex exponential- and cosine-modulated QMF banks
TLDR
This tutorial paper presents the complete unified efficient implementations of complex exponential- modulated and real-valued cosine-modulated quadrature mirror filter (QMF) banks used both in the standard SBR and LD-SBR encoder and decoder. Expand
...
1
2
...

References

SHOWING 1-10 OF 87 REFERENCES
The fast DCT-IV/DST-IV computation via the MDCT
  • V. Britanak
  • Mathematics, Computer Science
  • Signal Process.
  • 2003
TLDR
The careful analysis of regular structure of the new fast MDCT algorithm allows to extract a new DCT-IV/DST-IV computational structure and to suggest a new sparse matrix factorization of the D CT-IV matrix. Expand
A new fast algorithm for the unified forward and inverse MDCT/MDST computation
TLDR
The new fast algorithm can be adopted for the MDCT computation in the current audio coding standards such as MPEG family, and in commercial products such as Sony MiniDisc/ATRAC/ ATRAC2/SDDS digital audio coding systems, the AT & T Perceptual Audio Coder or Lucent Technologies PAC/Enhanced PAC/Multichannel PAC, and Dolby Labs AC-3 digital audio compression algorithm. Expand
Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
TLDR
It is shown that the same computational structure can be used both for the encoder and the decoder, thus significantly reducing design time and resources. Expand
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
TLDR
These results are derived by considering the DCT to be a special case of a DFT of length 8N, with certain symmetries, and then pruning redundant operations from a recent improved fast Fourier transform algorithm (based on a recursive rescaling of the conjugate-pair split-radix algorithm). Expand
Fast and lossless implementation of the forward and inverse MDCT computation in MPEG audio coding
  • T. Krishnan, S. Oraintara
  • Mathematics, Computer Science
  • 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)
  • 2002
TLDR
The orthonormal factorization of the rotations and the DCT/DST blocks of the MDCT is obtained and rendered impervious to quantization errors making it a lossless scheme, in the sense that any quantization error introduced by the forward transform is removed by the inverse transform. Expand
Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications
  • R. Chivukula, Y. Reznik
  • Computer Science
  • 2008 IEEE International Conference on Acoustics, Speech and Signal Processing
  • 2008
TLDR
An efficient algorithm for implementing MDCT/IMDCT of lengths N = 5 ldr 2m (m ges 2) is presented and it is shown that such a modified window is piece-wise symmetric, and can be stored using N/2 words. Expand
Worst-case error analysis of lifting-based fast DCT-algorithms
  • M. Primbs
  • Mathematics, Computer Science
  • IEEE Transactions on Signal Processing
  • 2005
TLDR
This paper considers an integer-to-integer transform for (2/spl times/2) rotation matrices and gives estimates of the truncation errors for arbitrary approximating dyadic rationals, and shows examplarily how to estimate the worst-case truncation error of lifting based integer- to-integer algorithms in fixed-point arithmetic. Expand
An efficient implementation of the forward and inverse MDCT in MPEG audio coding
TLDR
The most efficient implementation of theforward and inverse MDCT computation for layer III in MPEG-1 and MPEG-2 international audio coding standards is proposed, based on a new fast algorithm for the forward and inverseMDCT computation in the oddly stacked system. Expand
A fast algorithm for the computation of 2-D forward and inverse MDCT
TLDR
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform and its inverse transform (MDCT and IMDCT) is proposed. Expand
Improved algorithm for efficient computation of the forward and backward MDCT in MPEG audio coder
TLDR
The author presents an improved algorithm to implement the forward and backward NEXT in MPEG layer III that requires less calculation than Britanak and Rao's algorithm and employs the same module to compute both theforward and backward MDCT. Expand
...
1
2
3
4
5
...