Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes

Autores
de Micco, Luciana; Petruzzi, David Mario; Larrondo, Hilda Angela; Castiñeira Moreira, Jorge
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this study, the authors study a turbo-coding (TC) scheme, whose constituent codes are designed using convolutional encoders. These encoders are finite-state sequence machines (FSSMs) operating over the Galois Field, GF(4). The scheme includes encryption polynomials whose coefficients are selected every L steps, from the set of optimal polynomials of GF(4). Two cases are considered for the polynomial selection: periodical and random. This kind of encoder was studied in a previous study and a correspondence between the randomness of the encoded sequence and performance of the TC was conjectured. The main contribution of this study is to systematically confirm this correspondence, by analysing the randomness of the output and performance of the TC using several randomness quantifiers. Three of the quantifiers are defined on the basis of recurrence plots. Other two quantifiers are defined on the basis of the information theory. All the quantifiers allow one to justify why the proposed TC works better with random selection of the optimal polynomials and with small values of L. In summary, it is shown that a random selection of polynomials and a small L produce FSSMs with enhanced randomness properties and it is also shown that they produce the best quality of the TC, measured by means of the corresponding bit error rate.
Fil: de Micco, Luciana. Universidad Nacional de Mar del Plata. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; Argentina
Fil: Petruzzi, David Mario. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Departamento de Ingeniería Eléctrica; Argentina
Fil: Larrondo, Hilda Angela. Universidad Nacional de Mar del Plata. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; Argentina
Fil: Castiñeira Moreira, Jorge. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Departamento de Ingeniería Eléctrica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; Argentina
Materia
RANDOMNESS
FINITE STATE
SEQUENCE MACHINE
GALOIS FIELD
TURBO CODES
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/105238
Acceder
id CONICETDig_f8d9c408423e4fb90923abcca737a800
oai_identifier_str oai:ri.conicet.gov.ar:11336/105238
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codesde Micco, LucianaPetruzzi, David MarioLarrondo, Hilda AngelaCastiñeira Moreira, JorgeRANDOMNESSFINITE STATESEQUENCE MACHINEGALOIS FIELDTURBO CODEShttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2In this study, the authors study a turbo-coding (TC) scheme, whose constituent codes are designed using convolutional encoders. These encoders are finite-state sequence machines (FSSMs) operating over the Galois Field, GF(4). The scheme includes encryption polynomials whose coefficients are selected every L steps, from the set of optimal polynomials of GF(4). Two cases are considered for the polynomial selection: periodical and random. This kind of encoder was studied in a previous study and a correspondence between the randomness of the encoded sequence and performance of the TC was conjectured. The main contribution of this study is to systematically confirm this correspondence, by analysing the randomness of the output and performance of the TC using several randomness quantifiers. Three of the quantifiers are defined on the basis of recurrence plots. Other two quantifiers are defined on the basis of the information theory. All the quantifiers allow one to justify why the proposed TC works better with random selection of the optimal polynomials and with small values of L. In summary, it is shown that a random selection of polynomials and a small L produce FSSMs with enhanced randomness properties and it is also shown that they produce the best quality of the TC, measured by means of the corresponding bit error rate.Fil: de Micco, Luciana. Universidad Nacional de Mar del Plata. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; ArgentinaFil: Petruzzi, David Mario. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Departamento de Ingeniería Eléctrica; ArgentinaFil: Larrondo, Hilda Angela. Universidad Nacional de Mar del Plata. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; ArgentinaFil: Castiñeira Moreira, Jorge. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Departamento de Ingeniería Eléctrica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; ArgentinaInstitution of Engineering and Technology2013-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/105238de Micco, Luciana; Petruzzi, David Mario; Larrondo, Hilda Angela; Castiñeira Moreira, Jorge; Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes; Institution of Engineering and Technology; Iet Communications; 7; 9; 6-2013; 783-7901751-8628CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://digital-library.theiet.org/content/journals/10.1049/iet-com.2011.0861info:eu-repo/semantics/altIdentifier/doi/10.1049/IET-COM.2011.0861info: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-09-03T09:59:05Zoai:ri.conicet.gov.ar:11336/105238instacron: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-09-03 09:59:06.076CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
title Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
spellingShingle Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
de Micco, Luciana
RANDOMNESS
FINITE STATE
SEQUENCE MACHINE
GALOIS FIELD
TURBO CODES
title_short Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
title_full Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
title_fullStr Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
title_full_unstemmed Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
title_sort Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes
dc.creator.none.fl_str_mv de Micco, Luciana
Petruzzi, David Mario
Larrondo, Hilda Angela
Castiñeira Moreira, Jorge
author de Micco, Luciana
author_facet de Micco, Luciana
Petruzzi, David Mario
Larrondo, Hilda Angela
Castiñeira Moreira, Jorge
author_role author
author2 Petruzzi, David Mario
Larrondo, Hilda Angela
Castiñeira Moreira, Jorge
author2_role author
author
author
dc.subject.none.fl_str_mv RANDOMNESS
FINITE STATE
SEQUENCE MACHINE
GALOIS FIELD
TURBO CODES
topic RANDOMNESS
FINITE STATE
SEQUENCE MACHINE
GALOIS FIELD
TURBO CODES
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.2
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv In this study, the authors study a turbo-coding (TC) scheme, whose constituent codes are designed using convolutional encoders. These encoders are finite-state sequence machines (FSSMs) operating over the Galois Field, GF(4). The scheme includes encryption polynomials whose coefficients are selected every L steps, from the set of optimal polynomials of GF(4). Two cases are considered for the polynomial selection: periodical and random. This kind of encoder was studied in a previous study and a correspondence between the randomness of the encoded sequence and performance of the TC was conjectured. The main contribution of this study is to systematically confirm this correspondence, by analysing the randomness of the output and performance of the TC using several randomness quantifiers. Three of the quantifiers are defined on the basis of recurrence plots. Other two quantifiers are defined on the basis of the information theory. All the quantifiers allow one to justify why the proposed TC works better with random selection of the optimal polynomials and with small values of L. In summary, it is shown that a random selection of polynomials and a small L produce FSSMs with enhanced randomness properties and it is also shown that they produce the best quality of the TC, measured by means of the corresponding bit error rate.
Fil: de Micco, Luciana. Universidad Nacional de Mar del Plata. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; Argentina
Fil: Petruzzi, David Mario. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Departamento de Ingeniería Eléctrica; Argentina
Fil: Larrondo, Hilda Angela. Universidad Nacional de Mar del Plata. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; Argentina
Fil: Castiñeira Moreira, Jorge. Universidad Nacional de Mar del Plata. Facultad de Ingeniería. Departamento de Ingeniería Eléctrica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mar del Plata; Argentina
description In this study, the authors study a turbo-coding (TC) scheme, whose constituent codes are designed using convolutional encoders. These encoders are finite-state sequence machines (FSSMs) operating over the Galois Field, GF(4). The scheme includes encryption polynomials whose coefficients are selected every L steps, from the set of optimal polynomials of GF(4). Two cases are considered for the polynomial selection: periodical and random. This kind of encoder was studied in a previous study and a correspondence between the randomness of the encoded sequence and performance of the TC was conjectured. The main contribution of this study is to systematically confirm this correspondence, by analysing the randomness of the output and performance of the TC using several randomness quantifiers. Three of the quantifiers are defined on the basis of recurrence plots. Other two quantifiers are defined on the basis of the information theory. All the quantifiers allow one to justify why the proposed TC works better with random selection of the optimal polynomials and with small values of L. In summary, it is shown that a random selection of polynomials and a small L produce FSSMs with enhanced randomness properties and it is also shown that they produce the best quality of the TC, measured by means of the corresponding bit error rate.
publishDate 2013
dc.date.none.fl_str_mv 2013-06
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/105238
de Micco, Luciana; Petruzzi, David Mario; Larrondo, Hilda Angela; Castiñeira Moreira, Jorge; Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes; Institution of Engineering and Technology; Iet Communications; 7; 9; 6-2013; 783-790
1751-8628
CONICET Digital
CONICET
url http://hdl.handle.net/11336/105238
identifier_str_mv de Micco, Luciana; Petruzzi, David Mario; Larrondo, Hilda Angela; Castiñeira Moreira, Jorge; Randomness of finite-state sequence machine over GF(4) and quality of hopping turbo codes; Institution of Engineering and Technology; Iet Communications; 7; 9; 6-2013; 783-790
1751-8628
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://digital-library.theiet.org/content/journals/10.1049/iet-com.2011.0861
info:eu-repo/semantics/altIdentifier/doi/10.1049/IET-COM.2011.0861
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
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Institution of Engineering and Technology
publisher.none.fl_str_mv Institution of Engineering and Technology
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_ 1842269560660557824
score 13.13397

Publicaciones similares