DCT algorithms for VLSI parallel implementations

Journal Article · Sun Dec 31 23:00:00 EST 1989 · IEEE Transactions on Acoustics, Speech and Signal Processing (Institute of Electrical and Electronics Engineers); (USA)

OSTI ID:6845218

Cho, N I; Lee, S U ^[1]

---

1. Seoul National Univ. (Republic of Korea)

This paper presents two different algorithms for computing the discrete cosine transform (DCT) on the existing VLSI structures. First, it is shown that the N-point DCT can be implemented on the existing systolic architecture for N-point discrete Fourier transform (DFT), by introducing some modifications. Second, a new prime factor DCT algorithm is presented for the class of DCT's of length N = N{sub 1} {times} N{sub 2}, where N{sub 1}, and N{sub 2} are relatively prime and odd numbers. It is shown that the proposed algorithm can be implemented on the already existing VLSI structures for prime factor DFT such as in (10) and (13). Moreover, the number of multipliers required for the proposed algorithm is comparable to the other fast DCT algorithms. Also in this paper, it is shown that the discrete sine transform (DST) can be computed by the same structure.

• OSTI ID: 6845218
• Journal Information: IEEE Transactions on Acoustics, Speech and Signal Processing (Institute of Electrical and Electronics Engineers); (USA), Journal Name: IEEE Transactions on Acoustics, Speech and Signal Processing (Institute of Electrical and Electronics Engineers); (USA) Vol. 38:1; ISSN 0096-3518; ISSN IETAB
• Country of Publication: United States
• Language: English

Related Subjects

42 ENGINEERING
426000 -- Engineering-- Components
Electron Devices & Circuits-- (1990-)
99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMPUTER CALCULATIONS
ELECTRONIC CIRCUITS
IMPLEMENTATION
INTEGRATED CIRCUITS
MATHEMATICAL LOGIC
MICROELECTRONIC CIRCUITS
PARALLEL PROCESSING
PROGRAMMING