NDLI: Simplified DFT with sorted accumulation of input samples

Content Provider	IEEE Xplore Digital Library
Author	Martens, O. Martens, O.
Copyright Year	2008
Description	Author affiliation: Dept. of Electron., TTU, Tallinn (Martens, O.; Martens, O.)
Abstract	In practical embedded implementations of the discrete Fourier transform (DFT), used for example in bio-impedance and electrical network analysers, simplification of the solution (to have a low-cost and power-efficient devices) is a vital task. It is shown, that for calculating of few output points of DFT (up to 10-20 points), a modified ldquobasic DFTrdquo can be more efficient than fast and so-called quick Fourier transforms. Such modification can be realised using properties of symmetry and periodicity of sine and cosine waves, and sorting of input samples for every DFT output point.Applying this approach all the input samples are transferred and accumulated at one quarter of the first harmonic (sine or cosine wave). On the other hand, coefficients of sine and cosine waves of integer harmonics, which are used in calculations as base functions, can be approximated using N discrete levels (N>=2). If these levels are chosen symmetrically, only N/2 multiplications are needed to calculate every DFT component in case of proper pre-sorting and accumulating corresponding input samples. Thus remarkable complexity reduction is obtained for small N. Most principal disadvantage of approximated base-functions is that the noise sensitivity from extra harmonics of approximated sine-and cosine waves is increased (other systematic errors can be compensated in one or another way). The influence of this increase has been estimated.
Starting Page	329
Ending Page	332
File Size	157754
Page Count	4
File Format	PDF
ISBN	9781424420599
ISSN	17363705
DOI	10.1109/BEC.2008.4657547
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-10-06
Publisher Place	Estonia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Discrete Fourier transforms Noise Signal processing algorithms Harmonic analysis Approximation methods Sorting
Content Type	Text
Resource Type	Article

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

Efficient moving-window DFT algorithms

A Simplified Design Approach for Efficient Computation of DCT

Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions

HDL Implementation of DFT Architectures Using Winograd Fast Fourier Transform Algorithm

Improved Papoulis-Gerchberg algorithm for restoring lost samples

DFT computation using shift and addition operations

Fast transforms: Algorithms, analyses, applications

Sine-fit versus DFT-based algorithms in SNR testing of waveform digitizers

An improved warped DFT algorithm based on signal sparse representation

Simplified DFT with sorted accumulation of input samples

Similar Documents

Efficient moving-window DFT algorithms

A Simplified Design Approach for Efficient Computation of DCT

Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions

HDL Implementation of DFT Architectures Using Winograd Fast Fourier Transform Algorithm

Improved Papoulis-Gerchberg algorithm for restoring lost samples

DFT computation using shift and addition operations

Fast transforms: Algorithms, analyses, applications

Sine-fit versus DFT-based algorithms in SNR testing of waveform digitizers

An improved warped DFT algorithm based on signal sparse representation

Simplified DFT with sorted accumulation of input samples