公开(公告)号：US06785861B2

公开(公告)日：2004-08-31

申请号：US09781130

申请日：2001-02-09

申请人： Fabio Scalise ,  Fabio Osnato ,  Stefano Valle ,  Massimiliano Siti ,  Sergio Benedetto

发明人： Fabio Scalise ,  Fabio Osnato ,  Stefano Valle ,  Massimiliano Siti ,  Sergio Benedetto

IPC分类号： H03M1300

CPC分类号： H03M13/2972 ,  H03M13/256 ,  H03M13/2789 ,  H03M13/6362

摘要： An input digital signal is encoded by subjecting it to a first convolutional coding step followed by an interleaving step and a second convolutional coding step. The serial concatenated convolutional coded signal thus obtained is then subjected to modulation by means of a two-dimensional modulation scheme such as M-PSK or M-QAM. The corresponding decoding process involves an iterative decoding algorithm based on cascaded logarithmic soft-input soft-output processing steps.

摘要翻译： 通过对输入数字信号进行经过交织步骤和第二卷积编码步骤的第一卷积编码步骤进行编码。 然后通过诸如M-PSK或M-QAM的二维调制方案对如此获得的串行级联卷积编码信号进行调制。 相应的解码过程涉及基于级联对数软输入软输出处理步骤的迭代解码算法。

公开(公告)号：US07210075B2

公开(公告)日：2007-04-24

申请号：US10143531

申请日：2002-05-09

申请人： Marco Ferrari ,  Massimiliano Siti ,  Stefano Valle ,  Fabio Osnato ,  Fabio Scalise

发明人： Marco Ferrari ,  Massimiliano Siti ,  Stefano Valle ,  Fabio Osnato ,  Fabio Scalise

IPC分类号： G06F11/00

CPC分类号： H03M13/2957 ,  H03M13/2746 ,  H03M13/2771 ,  H03M13/2789

摘要： A method for designing a new prunable S-random interleaver class to be used as a constituent part of turbo codes. With respect to previously proposed solutions the method has the advantage of being prunable to different block sizes while exhibiting at the same time, for any considered block size, performance comparable with the optimized “ad hoc” S-random interleavers. Another advantage is that, as for every S-random interleaver, the design rules are independent of the constituent codes and of the puncturing rate applied to the turbo code. Therefore, these interleavers potentially can find applications in any turbo code scheme that requires interleaver size flexibility and code rate versatility, thanks to the advantage of requiring a single law storage (i e., one ROM storage instead of several ROMs) from which all the others are obtained by pruning, without compromising the overall error rate performance.

摘要翻译： 一种用于设计新的可修剪的S随机交织器类的方法，以用作turbo码的组成部分。 对于先前提出的解决方案，该方法的优点是可以同时展现不同的块大小，对于任何考虑的块大小，与优化的“ad hoc”S随机交织器相当的性能。 另一个优点是，对于每个S随机交织器，设计规则独立于构成码和应用于turbo码的打孔率。 因此，这些交织器潜在地可以在需要交织器大小灵活性和代码率多功能性的任何turbo码方案中找到应用，这得益于需要单一定律存储（即，一个ROM存储而不是几个ROM）​​的优点， 其他人通过修剪获得，而不会影响整体错误率性能。

公开(公告)号：US07802172B2

公开(公告)日：2010-09-21

申请号：US11471439

申请日：2006-06-20

申请人： Andres I. Vila Casado ,  Wen-Yen Weng ,  Richard D. Wesel ,  Nicola Moschini ,  Massimiliano Siti ,  Stefano Valle ,  Engling Yeo

发明人： Andres I. Vila Casado ,  Wen-Yen Weng ,  Richard D. Wesel ,  Nicola Moschini ,  Massimiliano Siti ,  Stefano Valle ,  Engling Yeo

IPC分类号： G06F11/00 ,  H03M13/00

CPC分类号： H03M13/1185

摘要： Low density parity check (LDPC) codes (LDPCCs) have an identical code blocklength and different code rates. At least one of the rows of a higher-rate LDPC matrix is obtained by combining a plurality of rows of a lower-rate LDPC matrix with the identical code blocklength as the higher-rate LDPC matrix.

摘要翻译： 低密度奇偶校验（LDPC）码（LDPCC）具有相同的码块长度和不同的码率。 通过将具有相同代码块长度的较低速率LDPC矩阵的多行组合为较高速率LDPC矩阵来获得较高速率LDPC矩阵的行中的至少一行。

公开(公告)号：US20070011569A1

公开(公告)日：2007-01-11

申请号：US11471439

申请日：2006-06-20

申请人： Andres Vila Casado ,  Wen-Yen Weng ,  Richard Wesel ,  Nicola Moschini ,  Massimiliano Siti ,  Stefano Valle ,  Engling Yeo

发明人： Andres Vila Casado ,  Wen-Yen Weng ,  Richard Wesel ,  Nicola Moschini ,  Massimiliano Siti ,  Stefano Valle ,  Engling Yeo

IPC分类号： H03M13/00

CPC分类号： H03M13/1185

摘要： Low density parity check (LDPC) codes (LDPCCs) have an identical code blocklength and different code rates. At least one of the rows of a higher-rate LDPC matrix is obtained by combining a plurality of rows of a lower-rate LDPC matrix with the identical code blocklength as the higher-rate LDPC matrix.

摘要翻译： 低密度奇偶校验（LDPC）码（LDPCC）具有相同的码块长度和不同的码率。 通过将具有相同代码块长度的较低速率LDPC矩阵的多行组合为较高速率LDPC矩阵来获得较高速率LDPC矩阵的行中的至少一行。

公开(公告)号：US08675756B2

公开(公告)日：2014-03-18

申请号：US13189769

申请日：2011-07-25

申请人： Angelo Poloni ,  Stefano Valle ,  Stefano Vincenti

发明人： Angelo Poloni ,  Stefano Valle ,  Stefano Vincenti

IPC分类号： H04L5/12 ,  H04L23/02

CPC分类号： H04L1/0045 ,  H03M13/255

摘要： A method for identifying a corrupted received signal that includes symbols is described. Each symbol may have a value of a Galois field associated therewith. The receiver may be configured to store a logarithm of normalized probability mass functions and corresponding Galois field values for each of the symbols. The normalized probability mass functions may be normalized with respect to a greatest probability mass function of a given symbol. The method may include comparing, for each symbol, a logarithm of normalized probability of an n-th best probability value with a respective threshold, counting a number of the logarithms that exceed the respective threshold and generating, for each symbol, a score corresponding to the number. The method may also include calculating a moving average of the scores, and comparing the moving average with an output threshold and flagging a just received symbol as corrupted based upon the comparison.

摘要翻译： 描述了用于识别包括符号的损坏的接收信号的方法。 每个符号可以具有与其相关联的伽罗瓦域的值。 接收机可以被配置为存储用于每个符号的归一化概率质量函数和对应的伽罗瓦域值的对数。 归一化概率质量函数可以相对于给定符号的最大概率质量函数进行归一化。 该方法可以包括对于每个符号比较具有相应阈值的第n个最佳概率值的归一化概率的对数，对超过相应阈值的对数进行计数，并且对于每个符号，生成对应于 号码。 该方法还可以包括计算分数的移动平均值，以及将移动平均值与输出阈值进行比较，并且基于比较标记刚被接收的符号被破坏。

公开(公告)号：US20120020400A1

公开(公告)日：2012-01-26

申请号：US13189769

申请日：2011-07-25

申请人： Angelo POLONI ,  Stefano Valle ,  Stefano Vincenti

发明人： Angelo POLONI ,  Stefano Valle ,  Stefano Vincenti

IPC分类号： H04B3/46

CPC分类号： H04L1/0045 ,  H03M13/255

摘要： A method for identifying a corrupted received signal at a receiver is described. A received signal may include symbols. Each symbol may have a value of a Galois field associated therewith. The receiver may be configured to store a logarithm of normalized probability mass functions and corresponding Galois field values for each of the plurality of symbols. The normalized probability mass functions may be normalized with respect to a greatest probability mass function of a given symbol of the plurality of symbols. The method may include comparing, for each of the plurality of symbols, a logarithm of normalized probability of an n-th best probability value with a respective threshold, counting a number of the logarithms that exceed the respective threshold and generating, for each of the plurality of symbols, a score corresponding to the number. The method may also include calculating a moving average of the scores, and comparing the calculated moving average with an output threshold and flagging a just received one of the plurality of symbols as corrupted based upon the comparison.

摘要翻译： 描述了在接收机处识别受损的接收信号的方法。 接收到的信号可以包括符号。 每个符号可以具有与其相关联的伽罗瓦域的值。 接收机可以被配置为存储用于多个符号中的每一个的归一化概率质量函数的对数和对应的伽罗瓦域值。 归一化概率质量函数可以相对于多个符号的给定符号的最大概率质量函数被归一化。 该方法可以包括对于多个符号中的每一个，比较具有相应阈值的第n个最佳概率值的归一化概率的对数，对超过相应阈值的对数进行计数，并且对于每个 多个符号，一个分数对应的数字。 该方法还可以包括计算分数的移动平均值，以及将计算出的移动平均值与输出阈值进行比较，并且基于比较将多个符号中刚刚接收到的符号标记为已损坏。

公开(公告)号：US07770092B2

公开(公告)日：2010-08-03

申请号：US11323909

申请日：2005-12-29

申请人： Andrea Concil ,  Andrea Giorgi ,  Stefano Valle

发明人： Andrea Concil ,  Andrea Giorgi ,  Stefano Valle

IPC分类号： H03M13/03

CPC分类号： H03M13/2957 ,  H03M13/3911 ,  H03M13/3922 ,  H03M13/3927 ,  H03M13/6511

摘要： In a digital system using a turbo code, a method for performing iterative decoding in accordance with a Log-MAP Algorithm comprises the steps of:—generating a look-up table comprising a plurality of values representative of a correcting factor;—performing a first calculation to obtain a forward metric;—performing a second calculation to obtain a backward metric;—performing a third calculation to obtain a log-likelihood ratio for every information bit to be decoded. In accordance with the method, at least one and no more than two of such calculations are performed by the use of said look-up table for implementing the Log-MAP decoding algorithm and the remaining calculations are performed implementing a Max-Log-MAP decoding algorithm.

摘要翻译： 在使用turbo码的数字系统中，根据Log-MAP算法执行迭代解码的方法包括以下步骤： - 生成包括表示校正因子的多个值的查找表; - 执行第一 计算以获得前向度量; - 执行第二计算以获得反向度量; - 执行第三计算以获得要解码的每个信息比特的对数似然比。 根据该方法，通过使用用于实现Log-MAP解码算法的查找表来执行至少一个且不超过两个这样的计算，并且执行剩余的计算，以实现Max-Log-MAP解码 算法。

公开(公告)号：US20050153701A1

公开(公告)日：2005-07-14

申请号：US10508928

申请日：2003-03-17

申请人： Donato Ettore ,  Maurizio Graziano ,  Bruno Melis ,  Andrea Finotello ,  Alfredo Ruscitto ,  Stefano Valle ,  Lorena Simoni

发明人： Donato Ettore ,  Maurizio Graziano ,  Bruno Melis ,  Andrea Finotello ,  Alfredo Ruscitto ,  Stefano Valle ,  Lorena Simoni

IPC分类号： H04L25/02 ,  H04Q7/20

CPC分类号： H04L25/0232

摘要： A method for the estimation of the transfer function of a transmission channel in a receiving system of UMTS type envisages the computation of a plurality of channel coefficients, included among known channel coefficients corresponding to pilot symbols, through the reiteration of an interpolation algorithm, capable of calculating an intermediate point (Z, f(Z)) between a first extreme and a second extreme of a determined interval, the first extreme being formed by at least two known points and the second extreme being formed by at least one known point, the intermediate point to be calculated having as abscissa (Z) the abscissa value of the mean point between the points defining the interval rounded off to the integer closest to the first extreme, and having as ordinate (F(Z)) the arithmetic average between the ordinate of the known point of the second extreme and the ordinate of a point, chosen between the two known points of the first extreme, having a distance from the intermediate point equal to the distance between the intermediate point and the known point of the second extreme.

摘要翻译： 用于估计UMTS类型的接收系统中的传输信道的传递函数的方法设想通过重复插值算法来计算包括在与导频符号相对应的已知信道系数之中的多个信道系数，能够 计算确定间隔的第一极限和第二极限之间的中间点（Z，f（Z）），所述第一极值由至少两个已知点形成，所述第二极值由至少一个已知点形成， 要计算的中间点具有横坐标（Z），将定义间隔的间隔的平均点的横坐标值舍入到最接近第一极限的整数，并且具有纵坐标（F（Z））之间的算术平均值 在第二极端的已知点的纵坐标和在第一极端的两个已知点之间选择的点的纵坐标具有与中间物的距离 点等于中间点与第二极限的已知点之间的距离。

公开(公告)号：US07676006B2

公开(公告)日：2010-03-09

申请号：US10930733

申请日：2004-08-31

申请人： Stefano Valle

发明人： Stefano Valle

IPC分类号： H03D1/04

CPC分类号： H04B7/01 ,  H04B17/336

摘要： The Doppler spread associated to a transmission channel with a gain represented by a random process, is estimated by transmitting on the channel a digital signal (DPCCHI,Q), which comprises at least one pilot signal, which in turn comprises fields of known symbols, and estimating, on the basis of the pilot signal(DPCCHI,Q), the channel so as to generate a signal indicating the aforesaid gain. There is then detected the zero-crossing rate (η) of the aforesaid signal during a given time interval, and there is also estimated the signal-to-noise ratio (SNR) associated to the channel. The bandwidth ({circumflex over (f)}D) of the aforesaid random process is estimated according to a reference quantity (ID(2)), which comprises: a first term ({circumflex over (η)}2π2), representing an estimate ({circumflex over (η)}) of said zero-crossing rate (η); and a second term ( I N ( 2 ) - η ^ 2 ⁢ π 2 ⁢ I N ( 0 ) 2 ⁢ SNR ) , which includes said signal-to-noise ratio of the channel.

摘要翻译： 通过在信道上发送包括至少一个导频信号的数字信号（DPCCHI，Q）来估计与具有由随机过程表示的增益的传输信道相关联的多普勒扩展，所述数字信号（DPCCHI，Q）又包括已知符号的字段， 以及基于所述导频信号（DPCCHI，Q）估计所述信道，以产生指示所述增益的信号。 然后在给定的时间间隔期间检测到上述信号的过零率（＆egrgr），并且还估计与信道相关联的信噪比（SNR）。 根据参考数量（ID（2））来估计上述随机过程的带宽（（f）} D），其包括：第一项（{echo（（＆eegr））} 2＆pgr; 2） ，表示所述过零率（＆eegr;）的估计值（{circumflex over（＆eegr;）}）; 以及第二项（I N（2） - ＆eegr; ^ 2＆pgr; 2 I N（0）2 SNR），其包括信道的所述信噪比。

公开(公告)号：US07450663B2

公开(公告)日：2008-11-11

申请号：US10508928

申请日：2003-03-17

申请人： Donato Ettorre ,  Maurizio Graziano ,  Bruno Melis ,  Andrea Finotello ,  Alfredo Ruscitto ,  Stefano Valle ,  Lorena Simoni

发明人： Donato Ettorre ,  Maurizio Graziano ,  Bruno Melis ,  Andrea Finotello ,  Alfredo Ruscitto ,  Stefano Valle ,  Lorena Simoni

IPC分类号： H04B1/06 ,  H04L5/02

CPC分类号： H04L25/0232

摘要： A method for the estimation of the transfer function of a transmission channel in a receiving system of UMTS type envisages the computation of a plurality of channel coefficients, included among known channel coefficients corresponding to pilot symbols, through the reiteration of an interpolation algorithm, capable of calculating an intermediate point (Z, f(Z)) between a first extreme and a second extreme of a determined interval, the first extreme being formed by at least two known points and the second extreme being formed by at least one known point, the intermediate point to be calculated having as abscissa (Z) the abscissa value of the mean point between the points defining the interval rounded off to the integer closest to the first extreme, and having as ordinate (F(Z)) the arithmetic average between the ordinate of the known point of the second extreme and the ordinate of a point, chosen between the two known points of the first extreme, having a distance from the intermediate point equal to the distance between the intermediate point and the known point of the second extreme.

摘要翻译： 用于估计UMTS类型的接收系统中的传输信道的传递函数的方法设想通过重复插值算法来计算包括在与导频符号相对应的已知信道系数之中的多个信道系数，能够 计算确定间隔的第一极限和第二极限之间的中间点（Z，f（Z）），所述第一极值由至少两个已知点形成，所述第二极值由至少一个已知点形成， 要计算的中间点具有横坐标（Z），将定义间隔的间隔的平均点的横坐标值舍入到最接近第一极限的整数，并且具有纵坐标（F（Z））之间的算术平均值 在第二极端的已知点的纵坐标和在第一极端的两个已知点之间选择的点的纵坐标具有与中间物的距离 点等于中间点与第二极限的已知点之间的距离。