One-Bit Spectral-Correlation Algorithms

One-Bit Spectral-Correlation Algorithms

A technique that greatly simplifies the computational complexity of digital cyclic spectral analysis algorithms is presented. The technique, which is based on Bussgang's theorem, replaces complex multiplications in spectral correlation operations, with simple sign-change and data-multiplexing o...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 41; no. 1; pp. 423 - 427
Main Authors: Gardner, W.A., Roberts, R.S.
Format: Journal Article
Language:English
Published: IEEE 01-01-1993
Subjects:
Aging
Bandwidth
Frequency estimation
Instruments
Laboratories
Phase measurement
Signal analysis
Signal processing
Signal processing algorithms
Spectral analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A technique that greatly simplifies the computational complexity of digital cyclic spectral analysis algorithms is presented. The technique, which is based on Bussgang's theorem, replaces complex multiplications in spectral correlation operations, with simple sign-change and data-multiplexing operations. Moreover, the technique is applicable to both time- and frequency-averaging algorithms. A simulation study that compares the computed results obtained using the new technique with results from standard time- and frequency-averaging algorithms shows that the new techniques is very promising, particularly for frequency-averaging algorithms.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.1993.193170