A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A unified method to derive Tanner graph related to tail-biting convolutional codes (CCs) is presented. The graphs obtained by this method have low complexity even for codes with a large number of states. It is shown that under certain conditions, a unique graph can be used for decoding of recursive and non-recursive CCs. Analog realization of such a graph employing MOS transistors is discussed and its circuit-level simulation results are given.doi:10.1109/iscas.2008.4541393 dblp:conf/iscas/ZahabiMMC08 fatcat:ttlaxkz3djatnhvbvklfalkyri