PARALLELIZATION OF SUBOPTIMAL SPECTRUM SEARCH

被引:0
作者
HERSHEY, JE
MOLNAR, K
HASSAN, A
机构
[1] Signals and Systems Laboratory, General Electric Corporate R&D Center, Schenectady, New York 12301
关键词
ALGORITHMS; SPREAD SPECTRUM COMMUNICATION;
D O I
10.1049/el:19921094
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The purpose of the Letter is to suggest that effective algorithms for spectrum search, such as those used for detecting spread spectrum signals, may be derived by selecting suboptimal algorithms and then recovering some of the lost efficacy through parallelisation methods. This thesis is motivated by considering a simple yet meaningful example of a spectrum search technique that exhibits what at first may seem to be counterintuitive behaviour.
引用
收藏
页码:1721 / 1722
页数:2
相关论文
共 3 条
[1]   SUPERLINEAR SPEEDUP OF AN EFFICIENT SEQUENTIAL ALGORITHM IS NOT POSSIBLE [J].
FABER, V ;
LUBECK, OM ;
WHITE, AB .
PARALLEL COMPUTING, 1986, 3 (03) :259-260
[2]  
MIYA E, 1988, NETWORK NEWS POS DEC
[3]  
WILKES MV, 1977, INFORMATION PROCESSI, V77, P1