DocumentCode :
750448
Title :
Fast computational algorithm in parallel random sampling
Author :
Lo, K.C. ; Purvis, A.
Author_Institution :
Durham Univ., UK
Volume :
28
Issue :
12
fYear :
1992
fDate :
6/4/1992 12:00:00 AM
Firstpage :
1115
Lastpage :
1117
Abstract :
A scheme of interlacing several additive random sampling sequences to form a single sequence is introduced for spectral estimation. This scheme, while being antialiasing and concurrent, exploits trigonometrical symmetries to reduce up to 87% of the multiplications required in computing the first band of frequency components. For subsequent bands, the saving increases with the number of sampling blocks used.
Keywords :
matrix algebra; parallel algorithms; random processes; signal processing; additive random sampling sequences; interlacing; parallel random sampling; spectral estimation; trigonometrical symmetries;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19920704
Filename :
141150
Link To Document :
بازگشت