Recursive algorithm to directly obtain the sum of correlations in a CSS
- Autores
- de Marziani, Carlos Manuel; Ureña, Jesús; Hernández, Álvaro; García, Juan Jesús; Alvarez, Fernando J.; Jimenez, Ana; Perez, Maria Carmen
- Año de publicación
- 2011
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- 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 SynchronizedLS-sequences or Zero Correlation ZoneZCZ-sequences) in the field of communications and sensor systems.
Fil: de Marziani, Carlos Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de la Patagonia "San Juan Bosco". Facultad de Ingeniería - Sede Comodoro; Argentina
Fil: Ureña, Jesús. Universidad de Alcalá; España
Fil: Hernández, Álvaro. Universidad de Alcalá; España
Fil: García, Juan Jesús. Universidad de Alcalá; España
Fil: Alvarez, Fernando J.. Universidad de Extremadura; España
Fil: Jimenez, Ana. Universidad de Alcalá; España
Fil: Perez, Maria Carmen. Universidad de Alcalá; España - Materia
-
CODE DIVISION MULTIPLE ACCESS
COMPLEMENTARY SET OF SEQUENCES
CORRELATORS
FILTER BANKS
PULSE COMPRESSION METHODS - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/84406
Ver los metadatos del registro completo
id |
CONICETDig_9c1185df5a1264e88ae978c1c9568512 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/84406 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Recursive algorithm to directly obtain the sum of correlations in a CSSde Marziani, Carlos ManuelUreña, JesúsHernández, ÁlvaroGarcía, Juan JesúsAlvarez, Fernando J.Jimenez, AnaPerez, Maria CarmenCODE DIVISION MULTIPLE ACCESSCOMPLEMENTARY SET OF SEQUENCESCORRELATORSFILTER BANKSPULSE COMPRESSION METHODShttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2This 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 SynchronizedLS-sequences or Zero Correlation ZoneZCZ-sequences) in the field of communications and sensor systems.Fil: de Marziani, Carlos Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de la Patagonia "San Juan Bosco". Facultad de Ingeniería - Sede Comodoro; ArgentinaFil: Ureña, Jesús. Universidad de Alcalá; EspañaFil: Hernández, Álvaro. Universidad de Alcalá; EspañaFil: García, Juan Jesús. Universidad de Alcalá; EspañaFil: Alvarez, Fernando J.. Universidad de Extremadura; EspañaFil: Jimenez, Ana. Universidad de Alcalá; EspañaFil: Perez, Maria Carmen. Universidad de Alcalá; EspañaElsevier Science2011-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/84406de Marziani, Carlos Manuel; Ureña, Jesús; Hernández, Álvaro; García, Juan Jesús; Alvarez, Fernando J.; et al.; Recursive algorithm to directly obtain the sum of correlations in a CSS; Elsevier Science; Signal Processing; 91; 5; 5-2011; 1343-13460165-1684CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.sigpro.2010.12.010info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0165168410004378info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:58:52Zoai:ri.conicet.gov.ar:11336/84406instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:58:52.852CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
title |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
spellingShingle |
Recursive algorithm to directly obtain the sum of correlations in a CSS de Marziani, Carlos Manuel CODE DIVISION MULTIPLE ACCESS COMPLEMENTARY SET OF SEQUENCES CORRELATORS FILTER BANKS PULSE COMPRESSION METHODS |
title_short |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
title_full |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
title_fullStr |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
title_full_unstemmed |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
title_sort |
Recursive algorithm to directly obtain the sum of correlations in a CSS |
dc.creator.none.fl_str_mv |
de Marziani, Carlos Manuel Ureña, Jesús Hernández, Álvaro García, Juan Jesús Alvarez, Fernando J. Jimenez, Ana Perez, Maria Carmen |
author |
de Marziani, Carlos Manuel |
author_facet |
de Marziani, Carlos Manuel Ureña, Jesús Hernández, Álvaro García, Juan Jesús Alvarez, Fernando J. Jimenez, Ana Perez, Maria Carmen |
author_role |
author |
author2 |
Ureña, Jesús Hernández, Álvaro García, Juan Jesús Alvarez, Fernando J. Jimenez, Ana Perez, Maria Carmen |
author2_role |
author author author author author author |
dc.subject.none.fl_str_mv |
CODE DIVISION MULTIPLE ACCESS COMPLEMENTARY SET OF SEQUENCES CORRELATORS FILTER BANKS PULSE COMPRESSION METHODS |
topic |
CODE DIVISION MULTIPLE ACCESS COMPLEMENTARY SET OF SEQUENCES CORRELATORS FILTER BANKS PULSE COMPRESSION METHODS |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
dc.description.none.fl_txt_mv |
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 SynchronizedLS-sequences or Zero Correlation ZoneZCZ-sequences) in the field of communications and sensor systems. Fil: de Marziani, Carlos Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de la Patagonia "San Juan Bosco". Facultad de Ingeniería - Sede Comodoro; Argentina Fil: Ureña, Jesús. Universidad de Alcalá; España Fil: Hernández, Álvaro. Universidad de Alcalá; España Fil: García, Juan Jesús. Universidad de Alcalá; España Fil: Alvarez, Fernando J.. Universidad de Extremadura; España Fil: Jimenez, Ana. Universidad de Alcalá; España Fil: Perez, Maria Carmen. Universidad de Alcalá; España |
description |
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 SynchronizedLS-sequences or Zero Correlation ZoneZCZ-sequences) in the field of communications and sensor systems. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-05 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/84406 de Marziani, Carlos Manuel; Ureña, Jesús; Hernández, Álvaro; García, Juan Jesús; Alvarez, Fernando J.; et al.; Recursive algorithm to directly obtain the sum of correlations in a CSS; Elsevier Science; Signal Processing; 91; 5; 5-2011; 1343-1346 0165-1684 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/84406 |
identifier_str_mv |
de Marziani, Carlos Manuel; Ureña, Jesús; Hernández, Álvaro; García, Juan Jesús; Alvarez, Fernando J.; et al.; Recursive algorithm to directly obtain the sum of correlations in a CSS; Elsevier Science; Signal Processing; 91; 5; 5-2011; 1343-1346 0165-1684 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.sigpro.2010.12.010 info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0165168410004378 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier Science |
publisher.none.fl_str_mv |
Elsevier Science |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1846083129812451328 |
score |
13.22299 |