On the equivalence between canonical forms of recursive systematic convolutional transducers based on single shift registers - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Access Année : 2014

On the equivalence between canonical forms of recursive systematic convolutional transducers based on single shift registers

Résumé

Standardized turbo codes (TCs) use recursive systematic convolutional transducers of rate $b/(b{+}d)$ , having a single feedback polynomial $(b{+}d{rm RSCT})$ . In this paper, we investigate the realizability of the $b{+}d{rm RSCT}$ set through two single shift register canonical forms (SSRCFs), called, in the theory of linear systems, constructibility, and controllability. The two investigated SSRCF are the adaptations, for the implementation of $b{+}d{rm RSCT}$ , of the better-known canonical forms controller (constructibility) and observer (controllability). Constructibility is the implementation form actually used for convolutional transducers in TCs. This paper shows that any $b{+}1{rm RSCT}$ can be implemented in a unique SSRCF observer. As a result, we build a function, $xi:{{cal H}}to{cal G}$ , which has as definition domain the set of encoders in SSRCF constructibility, denoted by ${cal H}$ , and as codomain a subset of encoders in SSRCF observer, denoted by ${cal G}$ . By proving the noninjectivity and nonsurjectivity properties of the function $xi$ , we prove that ${cal H}$ is redundant and incomplete in comparison with ${cal G}$ , i.e., the SSRCF observer is more efficient than the - SRCF constructibility for the implementation of $b{+}1{rm RSCT}$ . We show that the redundancy of the set ${cal H}$ is dependent on the memory $m$ and on the number of inputs $b$ of the considered $b{+}1{rm RSCT}$ . In addition, the difference between ${cal G}$ and $xi({cal H})$ contains encoders with very good performance, when used in a TC structure. This difference is consistent for $mapprox b>1$ . The results on the realizability of the $b{+}1{rm RSCT}$ allowed us some considerations on $b{+}d{rm RSCT}$ , with $b$ , $d>1$ , as well, for which we proposed the SSRCF controllability. These results could be useful in the design of TC based on exhaustive search. So, the proposed implementation form permits the design of new TCs, which cannot be conceived based on the actual form. It is possible, even probable, among these new TCs to find better performance than in the current communication standards, such as LTE, DVB, or deep-space communications.

Dates et versions

hal-01015133 , version 1 (25-06-2014)

Identifiants

Citer

Horia Balta, Catherine Douillard, Alexandru Isar. On the equivalence between canonical forms of recursive systematic convolutional transducers based on single shift registers. IEEE Access, 2014, 2, pp.381 - 394. ⟨10.1109/ACCESS.2014.2316413⟩. ⟨hal-01015133⟩
82 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More