Patent ID: 8156412
Filing Date: 2012-04-10
Classification: H03M

Abstract:
1. A tree decoding method for decoding a linear block code (n, k), the linear block code having a generator matrix G, where c=(c 0 , c 1 , . . . , c n−1 ) represents a transmitted codeword, r=(r 0 , r 1 , . . . , r n−1 ) represents a received signal, n represents a length of the codeword, and k represents a length of information bits, the tree decoding method comprising the steps of: (1) setting a sequence of the received signal r=(r (2) according to the code tree of G′, providing a bit metric M (3) assigning the root node as a pointer node, i.e., node v, which g(v)=0 and h(v)=0, setting a very poor metric value as an initial f(v (4) emanating from the pointer node to descendant nodes, and when the f(v) of the descendant node is better than f(v (5) selecting the best node v from the stack and assigning the selected node v as the pointer node, wherein if the path from the root node to the pointer node does not include all information bits, the method returns back to step ( (6) till now, the path from the root node to the pointer node comprising all of the information bits, and an estimated path metric of the entire codeword passing through the node v being f(v), and if f(v) is worse than or equal to f(v (7) if v