• Publications
  • Influence
Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations
Preface Acknowledgements List of Acronyms 1. Discrete Cosine and Sine Transforms 2. Definitions and General Properties 3. The Karhunen-Loeve Transform and Optimal Decorrelation 4. Fast DCT/DSTExpand
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 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
An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa
  • V. Britanak
  • Mathematics, Computer Science
  • Signal Process.
  • 1 July 2005
TLDR
It is shown that the transposed evenly and oddly stacked MDCT and MDST matrices are actually the pseudoinverses of their corresponding forward transform matrices. Expand
On the discrete cosine transform computation
  • V. Britanak
  • Mathematics, Computer Science
  • Signal Process.
  • 1 November 1994
TLDR
The regular structure of the generalized signal flow graph enables to realize the DCT and inverse DCT computation for any given N = 2m, m > 0, and is effectively implementable on a VLSI chip. Expand
CHAPTER 1 – Discrete Cosine and Sine Transforms
TLDR
The book presents the complete set of discrete cosine transforms and discrete sine transforms constituting the entire class of discrete sinusoidal unitary transforms, including their definitions, general mathematical properties, relations to the Karhunen-Loeve transform, with the emphasis on fast algorithms and integer approximations for their efficient implementations in the integer domain. Expand
The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
TLDR
The resulting generalized signal flow graphs for the computation of different versions of the GDFT represent simple and compact unified approach to the fast discrete sinusoidal transforms computation. Expand
The fast DCT-IV/DST-IV computation via the MDCT
  • V. Britanak
  • Mathematics, Computer Science
  • Signal Process.
  • 1 August 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
Two-dimensional DCT/DST universal computational structure for 2m×2n block sizes
  • V. Britanak, K. Rao
  • Mathematics, Computer Science
  • IEEE Trans. Signal Process.
  • 1 November 2000
TLDR
A refined generalized signal flow graph for the direct two-dimensional discrete cosine transform and discrete sine transform computation (the so-called 2-D DCT/DST universal computational structure) is described, which represents a generalized unified approach to the fast 2/sup m//spl times/2/sup n/ block sizes. 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
...
1
2
3
4
5
...