Loading...
Please wait, while we are loading the content...
Similar Documents
Bilinear Algorithms for Discrete Cosine Transforms of Prime Lengths
| Content Provider | CiteSeerX |
|---|---|
| Author | Muddhasani, Venkatram Wagh, Meghanad D. |
| Abstract | Abstract: This paper presents a strategy to design bilinear discrete cosine transform (DCT) algorithms of prime lengths. We show that by using multiplicative groups of integers, one can identify and arrange the computation as a pair of convolutions. When the DCT length p is such that (p − 1)/2 is odd, the computation uses two (p − 1)/2 point cyclic convolutions. When (p − 1)/2 = 2 m q with m> 0 and q odd, the computation requires one (p − 1)/2 point cyclic convolution and a combination of a q point cyclic convolution and a 2 m point Hankel product. Using bilinear algorithms for convolutions and Hankel products, one gets a bilinear DCT algorithm. We also show that the additions required beyond the convolutions can be minimized by a small modification to the convolution algorithms. This minimization exploits the fact that efficient bilinear convolution algorithms are almost always based on |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Prime Length Bilinear Algorithm Point Cyclic Convolution Discrete Cosine Transforms Bilinear Discrete Cosine Transform Multiplicative Group Bilinear Dct Algorithm Hankel Product Point Hankel Product Dct Length Efficient Bilinear Convolution Algorithm Convolution Algorithm Small Modification |
| Content Type | Text |
| Resource Type | Article |
