2008 IEEE Instrumentation and Measurement Technology Conference 2008
DOI: 10.1109/imtc.2008.4547253
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Kernel Function Fast Fourier Transform with Variable Truncation Scheme for Wideband Signal Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 4 publications
0
7
0
Order By: Relevance
“…Hamming window is applied to the input data to improve the frequency selective characteristics of the FFT. Utilizing the variable truncation scheme proposed in [6], depending on whether any of the 128-point 10-bit input data exceed the full scale value of 8-bits, the most significant 8-bits (MSB) or the least significant 8-bits (LSB) are selected and sent to the 8-bit inputs of the first stage butterflies. Variable truncation scheme is also applied after stage one of the FFT to further improve on the dynamic range of the receiver.…”
Section: Digital Channelized Receivermentioning
confidence: 99%
See 2 more Smart Citations
“…Hamming window is applied to the input data to improve the frequency selective characteristics of the FFT. Utilizing the variable truncation scheme proposed in [6], depending on whether any of the 128-point 10-bit input data exceed the full scale value of 8-bits, the most significant 8-bits (MSB) or the least significant 8-bits (LSB) are selected and sent to the 8-bit inputs of the first stage butterflies. Variable truncation scheme is also applied after stage one of the FFT to further improve on the dynamic range of the receiver.…”
Section: Digital Channelized Receivermentioning
confidence: 99%
“…The 8-bit 128-point fixed-point fixed-precision FFT design methodology in [6] is followed with three levels of folding. Dynamic kernel function is used to represent the twiddle factors needed for FFT computation.…”
Section: A Dynamic Kernel Function Fftmentioning
confidence: 99%
See 1 more Smart Citation
“…Substantial improvement on the dualtone signal IDR using the super resolution and the compensation techniques to remove side lobes and spurs in frequency domain after the FFT was first proposed in [2][3]. Techniques to minimize the FFT hardware while maintaining a good IDR were proposed in [4] using the dynamic kernel function and in [5] using a smaller FFT point size with a set number of digital channel filter banks. The effects of a fixed resolution between FFT stages on the detection of signals at various thresholds were studied in [5].…”
Section: Introductionmentioning
confidence: 99%
“…The effects of a fixed resolution between FFT stages on the detection of signals at various thresholds were studied in [5]. The common approach of employing a single fixed threshold is applied to the above design with approximately 80-90 % detection rates of weak signals [2][3][4][5]. A single threshold may be sufficient if signals processed in the FFT stages are limited to one operational dynamic range.…”
Section: Introductionmentioning
confidence: 99%