Local Irreducibility of Tail-Biting Trellises


This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trellis properties that amount to observability and controllability of trellis fragments of various lengths. For fragments of length less than the minimum span length of the code it is shown that fragment observability and fragment controllability are equivalent to irreducibility. For reducible trellises, a constructive reduction procedure is presented. The considerations also lead to a characterization for when the dual of a trellis allows a product factorization into elementary (“atomic”) trellises.

DOI: 10.1109/TIT.2013.2267612

Extracted Key Phrases

14 Figures and Tables

Cite this paper

@article{GluesingLuerssen2013LocalIO, title={Local Irreducibility of Tail-Biting Trellises}, author={Heide Gluesing-Luerssen and G. David Forney}, journal={IEEE Transactions on Information Theory}, year={2013}, volume={59}, pages={6597-6610} }