In this paper we present a systematic technique for obtaining all the input sequences that are mapped by a given permutation either to themselves or to shifted versions of themselves (generically called permutation fixed points). Such sequences or their subsets, represent the primary candidates for examination in connection with obtaining estimates of the minimum distance of parallel concatenated codes, specially for interleaver lengths for which the determination of the actual minimum distance may be very difficult. Subsequently, we present a new class of permutations that nearly achieve the lower bound on the number of possible fixed points associated with a given permutation of prime length . Preliminary experimental evidence suggests that certain permutations of this class lead to turbo codes with large minimum distances for short interleaver lengths.
|Titolo:||Permutation Fixed Points With Application to Estimation of Minimum Distance of Turbo Codes|
|Data di pubblicazione:||2000|
|Digital Object Identifier (DOI):||10.1109/18.887848|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|Permutation Fixed Points With Application to Estimation of Minimum Distance of Turbo Codes.pdf||2. Post-print||Non Pubblico - Accesso privato/ristretto||Administrator Richiedi una copia|