Trellis-hopping turbo coding
| Autor: | J. Casti neira Moreira, M. C. Liberatori, Bahram Honary, D.M. Petruzzi |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
business.industry
Computer science Galois theory Data_CODINGANDINFORMATIONTHEORY Trellis (graph) Serial concatenated convolutional codes Encryption Finite field Convolutional code Computer Science::Multimedia Turbo code Electrical and Electronic Engineering Trellis modulation business Algorithm Computer Science::Information Theory |
| Zdroj: | IEE Proceedings - Communications. 153:966 |
| ISSN: | 1350-2425 |
| DOI: | 10.1049/ip-com:20050547 |
| Popis: | We present a turbo coding scheme whose constituent codes are designed using convolutional encoders with time-varying coefficients. These encoders are finite state sequence machines that operate over the Galois field GF(q). The scheme includes an encryption polynomial whose coefficients are changed periodically by means of a user key. The trellis coding procedure thus hops from one trellis to another, following a random sequence taken over a set of subtrellises which correspond to different convolutional encoders. The proposed scheme is introduced as a turbo code with encryption properties, and is presented in two forms, the systematic and the nonsystematic schemes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|