Scalable and modular memory-based systolic architectures for discrete Hartley transform
In this paper, we present a design framework for scalable memory-based implementation of the discrete Hartley transform (DHT) using simple and efficient systolic and systolic-like structures for short and prime transform lengths, as well as, for lengths 4 and 8. We have used the proposed short-lengt...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/94247 http://hdl.handle.net/10220/7091 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-94247 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-942472020-05-28T07:18:57Z Scalable and modular memory-based systolic architectures for discrete Hartley transform Meher, Pramod Kumar Srikanthan, Thambipillai Patra, Jagdish Chandra School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Computer systems organization::Processor architectures In this paper, we present a design framework for scalable memory-based implementation of the discrete Hartley transform (DHT) using simple and efficient systolic and systolic-like structures for short and prime transform lengths, as well as, for lengths 4 and 8. We have used the proposed short-length structures to construct highly modular architectures for higher transform lengths by a new prime-factor implementation approach. The structures proposed for the prime-factor DHT, interestingly, do not involve any transposition hardware/time. Besides, it is shown here that an N-point DHT can be computed efficiently from two (N/2)-point DHTs of its even- and odd-indexed input subsequences in a recursive manner using a ROM-based multiplication stage. Apart from flexibility of implementation, the proposed structures offer significantly lower area-time complexity compared with the existing structures. The proposed schemes of computation of the DHT can conveniently be scaled not only for higher transform lengths but also according to the hardware constraint or the throughput requirement of the application. Accepted version 2011-09-21T06:41:59Z 2019-12-06T18:53:12Z 2011-09-21T06:41:59Z 2019-12-06T18:53:12Z 2006 2006 Journal Article Meher, P. K., Srikanthan, T., & Patra, J. C. (2006). Scalable and modular memory-based systolic architectures for discrete Hartley transform. IEEE Transactions on Circuits and Systems I: Regular Papers, 53(5), 1065-1077. 1549-8328 https://hdl.handle.net/10356/94247 http://hdl.handle.net/10220/7091 10.1109/TCSI.2006.870225 125993 en IEEE transactions on circuits and systems I: regular papers © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/TCSI.2006.870225]. 13 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Processor architectures |
spellingShingle |
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Processor architectures Meher, Pramod Kumar Srikanthan, Thambipillai Patra, Jagdish Chandra Scalable and modular memory-based systolic architectures for discrete Hartley transform |
description |
In this paper, we present a design framework for scalable memory-based implementation of the discrete Hartley transform (DHT) using simple and efficient systolic and systolic-like structures for short and prime transform lengths, as well as, for lengths 4 and 8. We have used the proposed short-length structures to construct highly modular architectures for higher transform lengths by a new prime-factor implementation approach. The structures proposed for the prime-factor DHT, interestingly, do not involve any transposition hardware/time. Besides, it is shown here that an N-point DHT can be computed efficiently from two (N/2)-point DHTs of its even- and odd-indexed input subsequences in a recursive manner using a ROM-based multiplication stage. Apart from flexibility of implementation, the proposed structures offer significantly lower area-time complexity compared with the existing structures. The proposed schemes of computation of the DHT can conveniently be scaled not only for higher transform lengths but also according to the hardware constraint or the throughput requirement of the application. |
author2 |
School of Computer Engineering |
author_facet |
School of Computer Engineering Meher, Pramod Kumar Srikanthan, Thambipillai Patra, Jagdish Chandra |
format |
Article |
author |
Meher, Pramod Kumar Srikanthan, Thambipillai Patra, Jagdish Chandra |
author_sort |
Meher, Pramod Kumar |
title |
Scalable and modular memory-based systolic architectures for discrete Hartley transform |
title_short |
Scalable and modular memory-based systolic architectures for discrete Hartley transform |
title_full |
Scalable and modular memory-based systolic architectures for discrete Hartley transform |
title_fullStr |
Scalable and modular memory-based systolic architectures for discrete Hartley transform |
title_full_unstemmed |
Scalable and modular memory-based systolic architectures for discrete Hartley transform |
title_sort |
scalable and modular memory-based systolic architectures for discrete hartley transform |
publishDate |
2011 |
url |
https://hdl.handle.net/10356/94247 http://hdl.handle.net/10220/7091 |
_version_ |
1681059075759013888 |