NDLI: Low-complexity hopping DFT design based on a compact recursive structure

Content Provider	IET Digital Library
Author	Juang, W. H. Lai, S. C. Chen, K. H. Tsai, W. K. Luo, C. H.
Abstract	A novel hopping discrete Fourier transform (DFT) algorithm and its architecture design for efficiently computing time–frequency spectra are presented. Since the sliding process is adopted sample by sample, the spectral bin output data rate is the same as the input data rate. Under the conditions of an M-sample complex input sequence (M = 256), and N-point recursive DFT computation (N = 64) for time hop L (L = 4), the proposed method has the following advantages: (i) the computational complexity of Proposed-I requires only four complex additions and four complex multiplications for each frequency bin, after the first spectral component has been finally calculated; (ii) Proposed-II utilises a re-timing scheme to greatly shorten and balance the critical path; (iii) Proposed-II is less computationally complex than Wang et al.’s method, as the numbers of multiplication and addition operations in the proposed algorithm are 768 and 1024, representing reductions of 50 and 20%, respectively. In addition, the number of coefficients can be reduced by 50% compared with Park et al.’s method. In the FPGA implementation, the proposed design can be operated at 47.26 MHz. It is thus more suitable for use with real-time analytic applications of time–frequency spectra.
Starting Page	25
Ending Page	27
Page Count	3
ISSN	00135194
Volume Number	53
e-ISSN	1350911X
Issue Number	Issue 1, Jan (2017)
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/el/53/1
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/10.1049/el.2016.3106
Journal	Electronics Letters
Publisher Date	2016-11-25
Access Restriction	Open
Rights Holder	© The Institution of Engineering and Technology
Subject Keyword	Compact Recursive Structure Computational Complexity Discrete Fourier Transform FPGA Frequency Hop Communication Hopping Discrete Fourier Transform Algorithm Integral Transforms Low-complexity Hopping DFT Design Multiple Access Communication Radio Link And Equipment Sliding Process Time-frequency Analysis
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Low Computational Complexity, Low Power, and Low Area Design for the Implementation of Recursive DFT and IDFT Algorithms

DFT processor implementation scheme based on Rader algorithm

New single-carrier transceiver scheme based on the discrete sine transform

Cooperative relaying with block DFT processing and full-duplex relays

Low-Power and Optimized VLSI Implementation of Compact Recursive Discrete Fourier Transform (RDFT) Processor for the Computations of DFT and Inverse Modified Cosine Transform (IMDCT) in a Digital Radio Mondiale (DRM) and DRM+ Receiver

A Low-Cost, Low-Complexity, and Memory-Free Architecture of Novel Recursive DFT and IDFT Algorithms for DTMF Application

Fast Parallel Approach for 2-D DHT-Based Real-Valued Discrete Gabor Transform

High-Precision, Permanently Stable, Modulated Hopping Discrete Fourier Transform

2D Discrete Fourier Transform on Sliding Windows

Low-complexity hopping DFT design based on a compact recursive structure

Similar Documents

Low Computational Complexity, Low Power, and Low Area Design for the Implementation of Recursive DFT and IDFT Algorithms

DFT processor implementation scheme based on Rader algorithm

New single-carrier transceiver scheme based on the discrete sine transform

Cooperative relaying with block DFT processing and full-duplex relays

Low-Power and Optimized VLSI Implementation of Compact Recursive Discrete Fourier Transform (RDFT) Processor for the Computations of DFT and Inverse Modified Cosine Transform (IMDCT) in a Digital Radio Mondiale (DRM) and DRM+ Receiver

A Low-Cost, Low-Complexity, and Memory-Free Architecture of Novel Recursive DFT and IDFT Algorithms for DTMF Application

Fast Parallel Approach for 2-D DHT-Based Real-Valued Discrete Gabor Transform

High-Precision, Permanently Stable, Modulated Hopping Discrete Fourier Transform

2D Discrete Fourier Transform on Sliding Windows

Low-complexity hopping DFT design based on a compact recursive structure