Study of State-Complexty of Trellises for Linear Block Codes
Jianqin Zhou · Journal of Anhui University of Technology · 2008
The definitions of conventional BCJR trellis and tail-biting trellis are started with. Next, a new way, called coset merge, to construct tail-biting trellises is shown. By using this method, half of the number of several continuous vertex-states can be reduced. How to construct tail-biting trellises by examples is also shown. Finally, how to reduce half of the state-complexity of a trellis with one peak is considered and an approach for trellises with 2 to 4 continuous peaks is also given.