<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Carlos De Marzziani</style></author><author><style face="normal" font="default" size="100%">Ureña, J.</style></author><author><style face="normal" font="default" size="100%">Álvaro Hernández</style></author><author><style face="normal" font="default" size="100%">J.J. Garcia</style></author><author><style face="normal" font="default" size="100%">Fernando J. Álvarez</style></author><author><style face="normal" font="default" size="100%">Ana Jiménez</style></author><author><style face="normal" font="default" size="100%">María del Carmen Perez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Recursive algorithm to directly obtain the sum of correlations in a CSS</style></title><secondary-title><style face="normal" font="default" size="100%">Signal Processing</style></secondary-title><short-title><style face="normal" font="default" size="100%">Signal Processing</style></short-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Code division multiple access; Complementary Set of Sequences; Filter banks; Correlators; Pulse compression methods</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science?_ob=ArticleURL&amp;_udi=B6V18-51TYDXG-2&amp;_user=885393&amp;_coverDate=05%2F31%2F2011&amp;_rdoc=1&amp;_fmt=high&amp;_orig=search&amp;_origin=search&amp;_sort=d&amp;_docanchor=&amp;view=c&amp;_acct=C000047351&amp;_version=1&amp;_urlVersion=0&amp;_userid=885393&amp;md5=49453ab5c</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">91</style></volume><pages><style face="normal" font="default" size="100%">1343 - 1346</style></pages><language><style face="normal" font="default" size="100%">English</style></language><abstract><style face="normal" font="default" size="100%">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.

</style></abstract><issue><style face="normal" font="default" size="100%">5</style></issue></record></records></xml>