Codigos de grupo comutativo

AUTOR(ES)

Marcelo Eduardo Pelenz

DATA DE PUBLICAÇÃO

1996

RESUMO

The construction of commutative group codes for the Gaussian channel is considered. The initial vector problem can be formulated in a similar fashion as it has been done for cyc1ic group codes. All subgroups of ( Z IND. 8 ) POT. L , L = 2,3, with order 2 POT. M where m = 6,9, have been tested and new optimal codes were obtained. They have better efficiency than cyclic group codes. Curiously, some codes (L =3) have two energy levels and can be implemented as coded leveI Star QAM. The group structure suggests and allow us to find a solution for the initial vector problem, simplifies the coding and possibly the decoding scheme. It also implies that maximun likelihood decison regions are congruent, which simplifies the computation of efficiency parameters. In this work we will use the error probability union bound as a perfomance criterion for the generated codes. A performance comparison of the new codes with other traditional modulation schemes , in special cyclicgroup codes, is shown.

ASSUNTO(S)

comunicações digitais sistemas de transmissão de dados modulação digital codificação

Documentos Relacionados

• O gás de elétrons degenerado não-comutativo
• Discursos Sobre o Comer de um Grupo de Trabalhadores: Códigos de Identificação do Saudável nas Práticas de Alimentação
• Sobre as extensões ciclicas de grau p de um anel comutativo
• Codigos de linha a partir de codigos corretores de erro concatenados
• Teorias de calibre supersimétricas formuladas num espaço-tempo não-comutativo tetradimensional