Loading...
Please wait, while we are loading the content...
Efficient systolic solution for a new prime factor discrete Hartley transform algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Meher, Pramod Kumar Satapathy, J. K. Panda, G. |
| Copyright Year | 1993 |
| Abstract | Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N=4M, M being prime to 4. This paper proposes a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearly the same hardware requirement as that of the corresponding DFT structure for real-valued data; but it yields significantly higher throughput. |
| Starting Page | 135 |
| Ending Page | 139 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| DOI | 10.1049/ip-g-2.1993.0021 |
| Volume Number | 140 |
| Alternate Webpage(s) | http://dspace.nitrkl.ac.in/dspace/bitstream/2080/54/1/meher3.pdf |
| Alternate Webpage(s) | https://doi.org/10.1049/ip-g-2.1993.0021 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
