-
公开(公告)号:US08375280B2
公开(公告)日:2013-02-12
申请号:US12260340
申请日:2008-10-29
IPC分类号: G06F11/00
CPC分类号: H03M13/23 , H03M13/2996
摘要: A method of generating a set of generator polynomials for use as a tail biting convolution code to operate on data transmitted over a channel comprises: (1) selecting valid combinations of generator polynomials to include in a pool of potential codes, each valid combination being a potential code; (2) determining first lines of a weight spectrum for each potential code in the pool and including potential codes of the pool having best first lines in a candidate set; (3) determining best codes of the candidate set based on the first L number of lines in the weight spectrum; (4) selecting an optimum code(s) from the best codes; and (5) configuring a shift register circuit(s) of a data transceiver to implement the optimum code(s).
摘要翻译: 一种生成一组生成多项式以用作尾部卷积码以对通过信道发送的数据进行操作的方法包括:(1)选择生成多项式的有效组合以包括在潜在代码池中,每个有效组合为 潜在代码; (2)确定所述池中每个潜在代码的权重谱的第一行,并且包括在候选集合中具有最佳第一行的所述池的潜在代码; (3)基于权重谱中的第一L个行数确定候选集合的最佳代码; (4)从最佳代码中选择最佳代码; 以及(5)配置数据收发器的移位寄存器电路以实现最佳代码。
-
2.
公开(公告)号:US20090150755A1
公开(公告)日:2009-06-11
申请号:US12260340
申请日:2008-10-29
CPC分类号: H03M13/23 , H03M13/2996
摘要: A method of generating a set of generator polynomials for use as a tail biting convolution code to operate on data transmitted over a channel comprises: (1) selecting valid combinations of generator polynomials to include in a pool of potential codes, each valid combination being a potential code; (2) determining first lines of a weight spectrum for each potential code in the pool and including potential codes of the pool having best first lines in a candidate set; (3) determining best codes of the candidate set based on the first L number of lines in the weight spectrum; (4) selecting an optimum code(s) from the best codes; and (5) configuring a shift register circuit(s) of a data transceiver to implement the optimum code(s).
摘要翻译: 一种生成一组生成多项式以用作尾部卷积码以对通过信道发送的数据进行操作的方法包括:(1)选择生成多项式的有效组合以包括在潜在代码池中,每个有效组合为 潜在代码; (2)确定所述池中每个潜在代码的权重谱的第一行,并且包括在候选集合中具有最佳第一行的所述池的潜在代码; (3)基于权重谱中的第一L个行数确定候选集合的最佳代码; (4)从最佳代码中选择最佳代码; 以及(5)配置数据收发器的移位寄存器电路以实现最佳代码。
-