摘要:
A deterministic structure for controlled distribution of weight-2 columns is proposed for a parity-check matrix H that reduces the occurrence of undetected frame errors and significantly enhances the code performance in comparison to a randomly-constructed parity-check matrix. H comprises a non-deterministic section H1 and a deterministic section H2, and wherein H2 comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.
摘要翻译:对于奇偶校验矩阵H,提出了权重2列的受控分布的确定性结构,其减少了未检测到的帧错误的发生,并且与随机构造的奇偶校验矩阵相比显着增强了代码性能。 H包括非确定性部分H 1和确定性部分H 2 H 2,并且其中H 2 H 2包括第一部分,其包含具有 大于2的奇数,以及包括用于行i的矩阵元素的第二部分,对于i = j,列j等于1,对于i = j + 1,0,其他地方为1。
摘要:
A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb and wherein Hb comprises a section Hb1 and a section Hb2, and wherein Hb2 comprises a first part comprising a column hb having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The expansion of the base matrix Hb uses identical submatrices for 1s in each column of the second part H′b2, and the expansion uses paired submatrices for an even number of 1s in hb.
摘要翻译:提出了一种结构化奇偶校验矩阵H,其中H是基本矩阵H B b的扩展,并且其中H B b包括部分H b1 并且其中H b2包括具有奇数重量大于2的柱h B 1的第一部分,以及 第二部分包括用于行i的矩阵元素,列j对于i = j等于1,对于i = j + 1为1,在其他地方为0。 基本矩阵H B b的扩展在第二部分H'b2“的每列中使用相同的子矩阵1s,并且扩展使用成对的子矩阵用于偶数1s 在h / b>中。
摘要:
The present invention encompasses a method for determining values for parity check bits (p1, . . . , pm) based on a current symbol set (s1, . . . , sk). The method comprises the steps of receiving the current symbol set (s1, . . . , sk) and using a transformation of a matrix to determine the parity check bits. The first N2 columns of the matrix is defined that for column i, 1≦i≦└m/2┘, a value of 1 is assigned to row position i and a value of 1 is assigned to row position i+└m/2┘, all other row positions have a value of 0. Additionally for column i, └m/2┘+1≦i≦N2
摘要:
This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. A method and structure of processing soft information in a block code decoder, includes a soft-input soft-output decoder (910) receiving a length n soft input vector, creating a binary vector Y corresponding to the length n soft input vector, hard decoding each linear function Xi of Y and a test pattern Zi of one or more test patterns, wherein if the hard decoding is successful a codeword produced by the hard decoding of the linear function Xi is added to a set S, removing redundant codewords in S to form a reduced set S′ (520), and an extrinsic value estimator (1140) generating n soft outputs based on c estimated soft output values and (n−c) non-estimated soft output values (530) wherein the c estimated soft output values are computed from one or more positions of the length n soft input vector and one or more codewords in the set S′.
摘要翻译:该摘要不被认为是限制性的,因为其他实施例可能偏离本摘要中描述的特征。 在块码解码器中处理软信息的方法和结构包括:软输入软输出解码器(910),接收长度为n的软输入向量,创建与长度n软输入向量对应的二进制向量Y,硬解码 Y的每个线性函数X i i和一个或多个测试模式的测试模式Z i i i i,其中如果硬解码成功,则由硬解码产生的码字 线性函数X i i被添加到集合S中,去除S中的冗余码字以形成缩减集合S'(520),并且外部值估计器(1140)基于c估计生成n个软输出 软输出值和(nc)非估计软输出值(530),其中从所述长度n软输入向量和所述集合S'中的一个或多个码字的一个或多个位置计算c个估计软输出值。
摘要:
Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.
摘要:
Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.
摘要:
A structured parity-check matrix H is proposed, wherein H is an expansion of a base matrix Hb and wherein Hb comprises a section Hb1 and a section Hb2, and wherein Hb2 comprises a first part comprising a column hb having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, and 0 elsewhere. The expansion of the base matrix Hb uses identical submatrices for 1s in each column of the second part H′b2, and the expansion uses paired submatrices for an even number of 1s in hb.
摘要:
Apparatus, computer program, and method for producing filter coefficients for an equalizer, the method includes the steps of: estimating a response (810) of a communication channel to a signaling pulse; estimating an autocorrelation (820) of noise and interference of the communication channel; computing an array (830) based on the estimation of the response of the communication channel to the signaling pulse and the estimation of the autocorrelation of the noise and interference of the communication channel; designating (840) at least one pivot position in the array; recursively performing the steps of: transforming the array (850) by a sequence of operations; storing (860) at least one element of the at least one pivot position; shifting (870) the at least one element of the at least one pivot position, thereby providing a shifted transformed array; determining (890) whether the shifted transformed array contains at least one non-zero element; and calculating (880) the filter coefficients based on the stored at least one element and the estimation of the response of the communication channel.