Get all the updates for this publication

Conferences

Processor-efficient FFT implementation scheme for active noise control applicationsPublished in

2010

Pages: 134 - 140

Most of the frequency-domain (FD)-based active noise control (ANC) applications involve the computation of several discrete Fourier transforms (DFTs). Conventionally, an N-point DFT of a sequentially arriving data is computed only after the arrival of the N th sample. For applications involving ANC, such an approach will overload the processor. In this paper, an alternative method to compute the DFT is proposed, which distributes the computations over a span of several sampling instants. As an example to prove the efficiency of the proposed algorithm, it is applied to the reduced delay-less frequency-domain block filtered-x least-mean-square (RDFBFXLMS) algorithm, wherein about 24% (for a block length of 1024 samples) of the multiplications and about 29% of additions (which were supposed to have been done at the last sampling instant of each block) are shifted to earlier sampling instants during which the processor is idle. The percentage of computational redistribution will be higher for multichannel non-linear systems. © 2010 IEEE.

Topics: Fast Fourier transform (57)%57% related to the paper, Block (data storage) (52)%52% related to the paper, Active noise control (51)%51% related to the paper and Sampling (statistics) (51)%51% related to the paper

View more info for "Processor-efficient FFT Implementation Scheme for Active Noise Control Applications"

Content may be subject to copyright.

About the journal

Journal | Proceedings of the 6th International Conference on Signal Image Technology and Internet Based Systems, SITIS 2010 |
---|---|

Open Access | No |

Concepts (18)

- Alternative methods
- BLOCK LENGTHS
- FILTERED X LEAST MEAN SQUARES
- Frequency domains
- FREQUENCY-DOMAIN ANC
- Implementation scheme
- Multi-channel
- NOISE CONTROL APPLICATIONS
- RDL-FBFXLMS ALGORITHM
- Acoustic variables control
- Active noise control
- Algorithms
- Computational complexity
- Discrete fourier transforms
- Frequency domain analysis
- Internet
- Linear systems
- Computational efficiency