Orthogonal perfect DFT Golay codes

Deciding about which coding sequences should be used is an important issue in many communication systems, such as those employing Code Division Multiple Access (CDMA). In this paper, we propose a cascading electronic codec based on a recursive algorithm for the generation of perfect sequences, deriv...

ver descrição completa

Detalhes bibliográficos
Autor principal: Lanza-Gutierrez, J. M. (author)
Outros Autores: Ferreira, M. (author), Gomez-Pulido, J. A. (author), Priem-Mendes, S. (author), Pereira, J. S. (author), Silva, H. J. A. (author)
Formato: article
Idioma:eng
Publicado em: 2017
Texto completo:http://hdl.handle.net/10400.8/2905
País:Portugal
Oai:oai:iconline.ipleiria.pt:10400.8/2905
Descrição
Resumo:Deciding about which coding sequences should be used is an important issue in many communication systems, such as those employing Code Division Multiple Access (CDMA). In this paper, we propose a cascading electronic codec based on a recursive algorithm for the generation of perfect sequences, derived from an Inverse Discrete Fourier Transform (IDFT) of Golay codes. The sequences generated have a low Peak-to-Average Power Ratio (PAPR), around 3 dB, which is the PAPR of a sine wave. The proposal is compared to the original Golay codes, verifying that our codec provides better crosscorrelation and autocorrelation results, crucial to gain immunity to multi-path interference.