This letter presents a novel memory-based architecture for radix-2 fast Walsh-Hadamard-Fourier transform (FWFT) based on the constant geometry FWFT algorithm. It is composed of a multi-function Processing Engine, a conflict-free memory addressing scheme and an efficient twiddle factor generator. The address for memory access and the control signals for stride permutation are formulated in detail and the methods can be applied to other memory-based FFT-like architectures.
Qianjian XING
Zhejiang University
Zhenguo MA
Zhejiang University
Feng YU
Zhejiang University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Qianjian XING, Zhenguo MA, Feng YU, "A Novel Memory-Based Radix-2 Fast Walsh-Hadamard-Fourier Transform Architecture" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 6, pp. 1333-1337, June 2017, doi: 10.1587/transfun.E100.A.1333.
Abstract: This letter presents a novel memory-based architecture for radix-2 fast Walsh-Hadamard-Fourier transform (FWFT) based on the constant geometry FWFT algorithm. It is composed of a multi-function Processing Engine, a conflict-free memory addressing scheme and an efficient twiddle factor generator. The address for memory access and the control signals for stride permutation are formulated in detail and the methods can be applied to other memory-based FFT-like architectures.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1333/_p
Copy
@ARTICLE{e100-a_6_1333,
author={Qianjian XING, Zhenguo MA, Feng YU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Novel Memory-Based Radix-2 Fast Walsh-Hadamard-Fourier Transform Architecture},
year={2017},
volume={E100-A},
number={6},
pages={1333-1337},
abstract={This letter presents a novel memory-based architecture for radix-2 fast Walsh-Hadamard-Fourier transform (FWFT) based on the constant geometry FWFT algorithm. It is composed of a multi-function Processing Engine, a conflict-free memory addressing scheme and an efficient twiddle factor generator. The address for memory access and the control signals for stride permutation are formulated in detail and the methods can be applied to other memory-based FFT-like architectures.},
keywords={},
doi={10.1587/transfun.E100.A.1333},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - A Novel Memory-Based Radix-2 Fast Walsh-Hadamard-Fourier Transform Architecture
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1333
EP - 1337
AU - Qianjian XING
AU - Zhenguo MA
AU - Feng YU
PY - 2017
DO - 10.1587/transfun.E100.A.1333
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2017
AB - This letter presents a novel memory-based architecture for radix-2 fast Walsh-Hadamard-Fourier transform (FWFT) based on the constant geometry FWFT algorithm. It is composed of a multi-function Processing Engine, a conflict-free memory addressing scheme and an efficient twiddle factor generator. The address for memory access and the control signals for stride permutation are formulated in detail and the methods can be applied to other memory-based FFT-like architectures.
ER -