Optimal Architectures for Multidimensional Transforms.
| dc.contributor.author | Chakrabarti, Chaitali | en_US |
| dc.contributor.author | JaJa, Joseph F. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:41:18Z | |
| dc.date.available | 2007-05-23T09:41:18Z | |
| dc.date.issued | 1988 | en_US |
| dc.description.abstract | Multidimensional transforms have widespread applications in computer vision, pattern analysis and image processing. The only existing optimal architecture for computing multidimensional DFT on data of size n = Nd requires very large rotator units of area O(n^2) and pipeline-time O(log n). In this paper we propose a family of optimal architectures with areatime trade-offs for computing multidimensional transforms. The large rotator unit is replaced by a combination of a small rotator unit, a transpose unit and a block rotator unit. The combination has an area of O(N^(d+2a)) and a pipeline time of O(N^(d/2-a)log n), for 0 < a < d/2. We apply this scheme to design optimal architectures for two-dimensional DFT, DHT and DCT. The computation is made efficient by mapping each of the one-dimensional transforms involved into two dimensions. | en_US |
| dc.format.extent | 597273 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4770 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1988-39 | en_US |
| dc.title | Optimal Architectures for Multidimensional Transforms. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1