کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10369452 | 875449 | 2011 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Recursive algorithm to directly obtain the sum of correlations in a CSS
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 91, Issue 5, May 2011, Pages 1343-1346
Journal: Signal Processing - Volume 91, Issue 5, May 2011, Pages 1343-1346
نویسندگان
Carlos De Marziani, Jesús Ureña, Álvaro Hernández, Juan Jesús GarcÃa, Fernando J. Álvarez, Ana Jiménez, Ma Carmen Pérez,