Preamble-Less Group Synchronization of Binary Linear Block Codes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Preamble-Less Group Synchronization of Binary Linear Block Codes

Résumé

This paper addresses the possibility to realize the group synchronization of short linear, binary, block codes without the use of a preamble. The proposed algorithm is based on the cyclic use of the coding relations. The input data are equal probable and generated by a binary, memoryless source. We consider a binary symmetric channel (BSC) with known error probability. It is shown that the reliability of the proposed algorithm depends on the channel error probability and the length of the cumulative sums used for synchronization.
Fichier principal
Vignette du fichier
PID2086815.pdf (217.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00670783 , version 1 (16-02-2012)

Identifiants

  • HAL Id : hal-00670783 , version 1

Citer

Gheorghe Zaharia. Preamble-Less Group Synchronization of Binary Linear Block Codes. E-Health and Bioengineering Conference (EHB), 2011, Nov 2011, Iasi, Romania. pp.1-4. ⟨hal-00670783⟩
139 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More