A Novel Turbo-TCM Scheme Based on Concatenated Tree Codes
Baoming Bai, Kin Shing Ho, Li Ping · IEICE Transactions on Communications · 2002
Tree codes are introduced in [4]. As examples, the encoding principles of two different tree codes are shown in Fig. 1 using Bayesian networks. Here, every node represents a bit in the code, distinguished by a white one (such as dk,0) for an information bit and a black one (such as qk ) for a parity bit. The latter is the parity check of the starting nodes of its incoming edges. Denote the kth information symbol by ) , ( 1 , 0 , k k k d d = d . The correspond-