Recursive algorithm to directly obtain the sum of correlations in a CSS

详细信息    查看全文

• 作者：Carlos De Marziani^a ; ^b ; ^{marziani@unpata.edu.ar} ; Jesú ; s Ureñ ; a^c ; ¹ ; ^{urena@depeca.uah.es} ; Á ; lvaro Hern&#xe1 ; ndez^c ; ¹ ; ^{alvaro@depeca.uah.es} ; Juan Jesú ; s Garc&#xed ; a^c ; ¹ ; ^{jesus@depeca.uah.es} ; Fernando J. Á ; lvarez^d ; ^{fafranco@unex.es} ; Ana Jim&#xe9 ; nez^c ; ¹ ; ^{ajimenez@depeca.uah.es} ; Ma Carmen P&#xe9 ; rez^c ; ¹ ; ^{carmen@depeca.uah.es}
• 关键词：Code division multiple access ; Complementary Set of Sequences ; Filter banks ; Correlators ; Pulse compression methods
• 刊名：Signal Processing
• 出版年：2011
• 出版时间：May 2011
• 年：2011
• 卷：91
• 期：5
• 页码：1343-1346
• 全文大小：367 K

文摘

This paper presents a new recursive algorithm to directly obtain the sum of the autocorrelation functions of the M sequences belonging to a Complementary Set of Sequences (M-CSS). The proposed algorithm allows a digital filter with only one stage to be obtained, what significantly reduces the total number of memory requirements, multiplications and additions to be performed in comparison with the use of M correlators, even when these correlators could have an efficient implementation. The use of this algorithm can be of great relevancy since there is an increasing interest in the use of CSS (or derived sequences such as Loosely Synchronized—LS-sequences or Zero Correlation Zone—ZCZ-sequences) in the field of communications and sensor systems.