Regular implementation algorithms of time domain aliasing cancellation

Chan, Din-Yuen; Yang, Jar‐Ferr; Chen, S.-Y.

doi:10.1049/ip-vis:19960818

Cited by 22 publications

(10 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MDCT/IMDCT is converted to shorter DCTlIs or DCT-II/DST-II to reduce computational complexity in [7]- [9]. Due to low implementation cost, the recursive algorithms and structures suitable for parallel VLSI implementation were explored in depth [11]- [20]. The algorithms presented in [17], [18] have the identical computational efficiency whereas the structure in [18] requires 1 latch less.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A compact hardware accelerator structure for realizing fast IMDCT computation

Wang

2009

2009 Asia Pacific Conference on Postgraduate Research in Microelectronics &Amp; Electronics (PrimeAsia)

View full text Add to dashboard Cite

In this paper, a compact hardware accelerator structure for realizing fast inverse modified discrete cosine transform (IMDCT) computation is proposed. The proposed structure stemmed from our previously presented type-IV discrete cosine transform/type-IV discrete sine transform (DCT-IV/DST-IV) decomposition algorithm. After transformation of DST-IV to DCT-IV, the DCT-IV/DCT-IV implementation structure is elaborately manipulated to obtain the compact structure. Compared with the previously reported architecture, the derived structure reduces 2 multipliers (50 % ) , 2 latches (330/0) and N/4 memory cells (66 % ) . Meanwhile, the compact structure possesses the same computational efficiency as the previously reported one.

show abstract

Section: Introductionmentioning

confidence: 99%

“…(14) where Both of y [4nf )and y [4n +3t> have been indicated in Fig.2. Similar to the even antisymmetry property of y [n]defined in(11), the sequence y [nf)…”

mentioning

confidence: 99%

A compact hardware accelerator structure for realizing fast IMDCT computation

Wang

2009

2009 Asia Pacific Conference on Postgraduate Research in Microelectronics &Amp; Electronics (PrimeAsia)

View full text Add to dashboard Cite

show abstract

“…This problem is well known, well studied, and numerous efficient algorithms have been proposed for solving it [2][3][4][5][6][7][8]. Many of these proposed algorithms are derived for transforms of lengths N = 2 m .…”

Section: Introductionmentioning

confidence: 99%

“…For this purpose we adopt the algorithm of C.W. Kok [16], which essentially is decimation-in-frequency x (1) x (2) x (3) x (4) x (5) x (6) x (7) x (8) x (9) C II (0) C II (2) C II (4) C II (6) C II (8) C II (1) C II (3) C II (5) C II (7) C II (9)…”

mentioning

confidence: 99%

Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications

Chivukula

Reznik

2008

2008 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

In this paper, an efficient algorithm for implementing MDCT/IMDCT of lengths 5 2Transforms for such lengths are of interest for speech and audio coding applications, such as recently issued and/or emerging standards G.729.1, G.EV-VBR, and EVRC-WB. In our design we utilize a mapping of MDCT of size N into N/2-point DCT-IV and DCT-II with isolated premultiplications, which are subsequently moved in the windowing stage. We show that such a modified window is piece-wise symmetric, and can be stored using N/2 words. In our algorithm we also use an efficient factorization of 5-point DCT-II which requires only 4 multiplications by irrational factors. We compare our proposed algorithm with several alternative implementations and show that our design offers practically appreciable reduction in complexity and memory usage.

show abstract

“…Undoubtedly, the search for recursive algorithms with regular structure and less computation time remains an active research area. In the past decades, one-dimensional (1-D) recursive transform algorithms were developed for simple very large-scale integration (VLSI) implementation [20]- [35]. Goertzel initially used the periodicity of the finite trigonometric sequence to reduce the computation of the discrete Fourier transform [20], [21].…”

Section: Introductionmentioning

confidence: 99%

Direct Recursive Structures for Computing Radix-<tex>$r$</tex>Two-Dimensional DCT/IDCT/DST/IDST

Chen

Liu

Yang

2004

IEEE Trans. Circuits Syst. I

Self Cite

View full text Add to dashboard Cite

In this paper, new recursive structures for computing radix-two-dimensional (2-D) discrete cosine transform (DCT) and 2-D inverse DCT (IDCT) are proposed. The 2-D DCT/IDCT are first decomposed into cosine-cosine and sine-sine transforms. Based on indexes of transform bases, the regular pre-addition preprocess is established and the recursive structures for 2-D DCT/IDCT, which can be realized in a second-order infinite-impulse response (IIR) filter, are derived without involving any transposition procedure. For computation of 2-D DCT/IDCT, the recursive loops of the proposed structures are less than that of one-dimensional DCT/IDCT recursive structures, which require data transposition to achieve the so-called row-column approach. With advantages of fewer recursive loops and no transposition, the proposed recursive structures achieve more accurate results and less power consumption than the existed methods. The regular and modular properties are suitable for very large-scale integration (VLSI) implementation. By using similar procedures, the recursive structures for 2-D DST and 2-D IDST are also proposed. Index Terms-Discrete cosine transform (DCT), fast algorithm, inverse DCT (IDCT), multidimensional signal processing, recursive structure.

show abstract

Regular implementation algorithms of time domain aliasing cancellation

Cited by 22 publications

References 2 publications

A compact hardware accelerator structure for realizing fast IMDCT computation

A compact hardware accelerator structure for realizing fast IMDCT computation

Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications

Direct Recursive Structures for Computing Radix-<tex>$r$</tex>Two-Dimensional DCT/IDCT/DST/IDST

Contact Info

Product

Resources

About

Regular implementation algorithms of time domain aliasing cancellation

Cited by 22 publications

References 2 publications

A compact hardware accelerator structure for realizing fast IMDCT computation

A compact hardware accelerator structure for realizing fast IMDCT computation

Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications

Direct Recursive Structures for Computing Radix-&lt;tex&gt;$r$&lt;/tex&gt;Two-Dimensional DCT/IDCT/DST/IDST

Contact Info

Product

Resources

About

Direct Recursive Structures for Computing Radix-<tex>$r$</tex>Two-Dimensional DCT/IDCT/DST/IDST