专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

EP0897223B1 High-performance low-complexity error-correcting codes 有权
标题翻译：高性能纠错低复杂度码
公开(公告)号：EP0897223B1
公开(公告)日：2013-03-20
申请号：EP98115338.0
申请日：1998-08-14
申请人： Her Majesty The Queen In Right Of Canada as represented by the Minister of Industry
发明人： Crozier, Stewart , Hunt, Andrew , Lodge, John
IPC分类号： H03M13/00
CPC分类号： H03M13/3916 , G11B20/18 , G11B20/1866 , H03M13/2717 , H03M13/2721 , H03M13/29 , H03M13/2903 , H03M13/2906 , H03M13/2909 , H03M13/2918 , H03M13/2933 , H03M13/2945 , H03M13/3905 , H03M13/658

2. 发明公开

EP0897223A3 High-performance low-complexity error-correcting codes 有权
标题翻译：高性能纠错低复杂度码
公开(公告)号：EP0897223A3
公开(公告)日：2001-11-14
申请号：EP98115338.0
申请日：1998-08-14
申请人： Her Majesty The Queen In Right Of Canada as represented by the Minister of Industry
发明人： Crozier, Stewart , Hunt, Andrew , Lodge, John
IPC分类号： H03M13/00
CPC分类号： H03M13/3916 , G11B20/18 , G11B20/1866 , H03M13/2717 , H03M13/2721 , H03M13/29 , H03M13/2903 , H03M13/2906 , H03M13/2909 , H03M13/2918 , H03M13/2933 , H03M13/2945 , H03M13/3905 , H03M13/658
摘要： A method of encoding data is described herein. According to the method, source data elements are coded using one or more product codes having a common component code. The resulting one or more primary product codewords consist of a plurality of first codewords of the common component code. One or more first sets of codewords of the common component code are assembled such that each of the first sets comprises two or more distinct first codewords forming part of a same primary product codeword. Each of the codewords of each of the first sets is codeword-mapped to a second codeword of the common component code using a one-to-one codeword-mapping. One or more second sets of second codewords are provided, where each second set corresponds to a first set of codewords. The codeword-mapping includes re-ordering, according to a known interleaving pattern, the symbols within a codeword. The codeword-mappings are such that if all of the codewords of a first set are from a same primary product codeword, then some codeword-mappings applied to the codewords of the first set are different, and if two or more repetitions of a same codeword are included in a single first set, then the codeword-mappings applied to those repetitions are different. Each set of second codewords is coded using a systematic code so as to generate a secondary product codeword for a product code having as component codes the common component code and the systematic code. Then, the primary product codewords and the non-systematic portion of the secondary product codewords are provided as encoded output data.

3. 发明公开

EP0237186A3 Decoding of lattices and codes 有权
标题翻译：解码和编码
公开(公告)号：EP0237186A3
公开(公告)日：1989-03-22
申请号：EP87301139.9
申请日：1987-02-10
申请人： CODEX CORPORATION
发明人： Forney, George D., Jr.
IPC分类号： H03M13/00 , H03M13/12 , H04L27/02
CPC分类号： H03M13/3944 , H03M13/1505 , H03M13/25 , H03M13/251 , H03M13/3916 , H03M13/41 , H03M13/451 , H03M13/458 , H04L27/3427 , H04L27/3438
摘要： Simplified decoding procedures based on trellis diagrams are given for lattices and codes. In one arrangement, for selecting a codeword near to a given N-tuple r, the codeword representing a point in an N-dimensional lattice, the N-tuple r comprising a sequence of N real values r i representing signals, the values r of the N-tuple r being organised into n sections r ; respectively of lengths N j , I ≦ j ≦ n, where n ≧ 3, and N j j , I ≦ j ≦n.Each such substage of the first stage comprises means for evaluating distances between multiple sets of possible partial codewords and the section r j , these partial codewords comprising the corresponding N of the symbols appearing in a subset of said codewords. Additionally, each first stage substage has means for selecting as a survivor from each of the multiple sets one of the partial codewords. The selection is based on the distances. Each substage also includes means for providing to the second decoding stage information indicative of each of the multiple survivors and its distance. The second decoding stage comprises n-I substages. Each such substage of the second stage corresponds to a supersection made up of a combination of two parts, each such part being a section or a supersection combined in an earlier substage of the second stage, a final such substage corresponding to a final supersection whose parts make up the complete N-tuple r. Each substage of the second stage except the final substage comprises means for evaluating distances between multiple sets of possible partial codewords and the received values in the corresponding supersection. This evaluation is based on the information indicative of survivor distances for the survivors corresponding to each of the two said parts. Each substage of the second stage other than the final substage also comprises means for selecting as a survivor from each of the multiple sets one partial codeword on the basis of the distances, and for providing information indicative of each of the multiple survivors and its distance to subsequent decoding substages of the second stage. The final substage comprises means for evaluating distances between said codewords and the N-tuple r. This evaluation is based on the indications of survivor distances for survivors corresponding to each of two of the parts. The final substage also includes means for selecting one codeword as a finally decoded codeword based on the distances between codewords and the N-tuple r, and for providing information indicative of the finally decided codeword as an output of the decoder.

4. 发明公开

EP0237186A2 Decoding of lattices and codes 有权
标题翻译： Dekodierung vonBrückennetzwerkenund Koden。
公开(公告)号：EP0237186A2
公开(公告)日：1987-09-16
申请号：EP87301139.9
申请日：1987-02-10
申请人： CODEX CORPORATION
发明人： Forney, George D., Jr.
IPC分类号： H03M13/00 , H03M13/12 , H04L27/02
CPC分类号： H03M13/3944 , H03M13/1505 , H03M13/25 , H03M13/251 , H03M13/3916 , H03M13/41 , H03M13/451 , H03M13/458 , H04L27/3427 , H04L27/3438
摘要： Simplified decoding procedures based on trellis diagrams are given for lattices and codes.
In one arrangement, for selecting a codeword near to a given N-tuple r, the codeword representing a point in an N-dimensional lattice, the N-tuple r comprising a sequence of N real values r i representing signals, the values r of the N-tuple r being organised into n sections r ; respectively of lengths N j , I ≦ j ≦ n, where n ≧ 3, and N j j , I ≦ j ≦n.Each such substage of the first stage comprises means for evaluating distances between multiple sets of possible partial codewords and the section r j , these partial codewords comprising the corresponding N of the symbols appearing in a subset of said codewords. Additionally, each first stage substage has means for selecting as a survivor from each of the multiple sets one of the partial codewords. The selection is based on the distances. Each substage also includes means for providing to the second decoding stage information indicative of each of the multiple survivors and its distance.
The second decoding stage comprises n-I substages.
Each such substage of the second stage corresponds to a supersection made up of a combination of two parts, each such part being a section or a supersection combined in an earlier substage of the second stage, a final such substage corresponding to a final supersection whose parts make up the complete N-tuple r.
Each substage of the second stage except the final substage comprises means for evaluating distances between multiple sets of possible partial codewords and the received values in the corresponding supersection. This evaluation is based on the information indicative of survivor distances for the survivors corresponding to each of the two said parts. Each substage of the second stage other than the final substage also comprises means for selecting as a survivor from each of the multiple sets one partial codeword on the basis of the distances, and for providing information indicative of each of the multiple survivors and its distance to subsequent decoding substages of the second stage. The final substage comprises means for evaluating distances between said codewords and the N-tuple r. This evaluation is based on the indications of survivor distances for survivors corresponding to each of two of the parts. The final substage also includes means for selecting one codeword as a finally decoded codeword based on the distances between codewords and the N-tuple r, and for providing information indicative of the finally decided codeword as an output of the decoder.
摘要翻译：解码器包括至少两个解码级，其中分段与分段相关联。每个子级别在多组可能的部分码字之间进行评估，并且部分码字包括出现在码字的子集中的符号的相应的Ni。从多个集合中的每一个选择一个部分码字作为幸存者。选择是基于距离。信息被提供给指示多个幸存者及其距离中的每一个的另一个解码阶段。第二级的每个子级对应于由两部分的组合构成的超文本，每个部分是在较早阶段中组合的部分或超文本。最后一个子步骤对应于最终的超越，其部分组成完整的N型。

5. 发明公开

EP1628404A3 Method and system for improving wired and wireless receivers through redundancy and iterative processing 失效转让
标题翻译：方法和系统，用于通过冗余和迭代处理改进有线和无线接收机的
公开(公告)号：EP1628404A3
公开(公告)日：2007-06-27
申请号：EP05016594.3
申请日：2005-07-29
申请人： Broadcom Corporation
发明人： Heiman, Arie , Molev-Shteiman, Arkady
IPC分类号： H03M13/37 , H04L25/03 , H04L1/00 , H03M13/29
CPC分类号： H04L1/005 , H03M13/09 , H03M13/29 , H03M13/2948 , H03M13/3746 , H03M13/3916 , H03M13/612 , H03M13/6331 , H03M13/6337 , H04L1/0054
摘要： A method and system for improving reception in wired and wireless systems through redundancy and iterative processing are provided. A multilayer decoding process may comprise a burst process and a frame process. Results from a first burst process may be utilized to generate a decoded bit sequence in the frame process. The frame process may utilize redundancy information and physical constraints to improve the performance of a decoding algorithm. Results from the frame process may be fed back for a second iteration of the burst process and of the frame process, to further improve the decoding operation. In some instances, the second iteration of the burst process may be based on a gradient search approach.

6. 发明公开

EP1756997A2 METHOD AND APPARATUS FOR JOINT SOURCE-CHANNEL MAP DECODING 审中-公开
标题翻译：方法和设备复合光源CHANNEL画面解码
公开(公告)号：EP1756997A2
公开(公告)日：2007-02-28
申请号：EP05747648.3
申请日：2005-05-05
申请人： Qualcomm, Incorporated
发明人： RAVEENDRAN, Vijayalakshmi, R.
IPC分类号： H04L1/00
CPC分类号： H03M13/3916 , H03M13/2927 , H03M13/293 , H03M13/2936 , H03M13/2957 , H03M13/45 , H03M13/63 , H03M13/6312 , H03M13/6318 , H04L1/0045 , H04L1/0055 , H04L1/0057 , H04L1/0065 , H04L1/0066
摘要： A method for error correction that includes receiving a bitstream, the bitstream comprising one or more bits, determining if the bitstream has one or more corrupt bits, determining one or more hypotheses representing an error pattern, and assigning a probability to each of the hypotheses, wherein the probability is determined based on one or more reference data.

7. 发明公开

EP1594130A1 DATA RECORDING/REPRODUCTION DEVICE AND METHOD USING REPEATED DECODING 有权
标题翻译：数据记录/重放装置和方法对于使用的重复解码
公开(公告)号：EP1594130A1
公开(公告)日：2005-11-09
申请号：EP03705157.0
申请日：2003-02-14
申请人： FUJITSU LIMITED
发明人： ITAKURA, Akihiro
IPC分类号： G11B20/10 , G11B20/12
CPC分类号： G11B20/10009 , G11B20/10055 , G11B20/18 , G11B20/1809 , H03M13/27 , H03M13/2957 , H03M13/3916 , H03M13/3927
摘要： A data recording and reproducing device with a small circuit size is provided that utilizes an iterative decoding technique to realize high-speed data reproduction from a recording medium on which data is recorded at a high density. This data recording and reproducing device records a data block having input data encoded with convolutional codes on a recording medium, reproduces the data block through a partial response channel, and decodes the data block from the reproduced signal, utilizing an iterative decoding technique by which the data block is decoded through iterative decoding using likelihood information. This data recording and reproducing device includes a dividing unit that divides the data block encoded with the convolutional codes into data sub blocks; and a recording unit that records the data sub blocks at non-adjacent locations on the recording medium.
摘要翻译：一种数据记录和再现设备具有小的电路规模提供没有利用到迭代解码技术来实现从在其上数据被记录在一个高密度记录介质的高速数据再现。该数据记录和再现装置记录具有记录介质上用卷积码编码的输入数据的数据块，转载通过部分响应信道的数据块，并将数据块从再现信号进行解码，迭代解码技术的利用，通过该数据块是使用似然信息通过迭代解码解码。该数据记录和再现设备包括：分割单元做分割与所述卷积码为数据的子块所编码的数据块; 和记录单元没在记录介质上的非相邻位置记录该数据的子块。

8. 发明授权

EP2214322B1 Iterative MAP decoding of block codes using sub-trellises 有权转让
标题翻译：使用子棚架的块码的迭代解码MAP
公开(公告)号：EP2214322B1
公开(公告)日：2015-04-08
申请号：EP09290070.3
申请日：2009-01-30
申请人： ALCATEL LUCENT , Centre National de la Recherche Scientifique , Supelec
发明人： Marin, Cedric , Kieffer, Michel , Duhamel, Pierre , Kumar, Vinod , Sayadi, Bessem
IPC分类号： H03M13/39 , H03M13/29
CPC分类号： H03M13/3916 , H03M13/2957

9. 发明公开

EP0897224A3 Method of enhanced max-log-a posteriori probability processing 审中-公开
标题翻译：一种用于改进的最大对数后验概率处理方法
公开(公告)号：EP0897224A3
公开(公告)日：2002-12-11
申请号：EP98115339.8
申请日：1998-08-14
申请人： Her Majesty The Queen In Right Of Canada as represented by the Minister of Industry
发明人： Crozier, Stewart , Hunt, Andrew , Lodge, John
IPC分类号： H03M13/00 , H03M13/29
CPC分类号： H03M13/3916 , G11B20/18 , G11B20/1866 , H03M13/2717 , H03M13/2721 , H03M13/29 , H03M13/2903 , H03M13/2906 , H03M13/2909 , H03M13/2918 , H03M13/2933 , H03M13/2945 , H03M13/3905 , H03M13/658
摘要： The invention comprises an enhancement to max-log-APP processing that significantly reduces performance degradation associated with introducing the "max" approximation into log-APP computations, while still maintaining lower computational complexity associated with max-log-APP processing. This enhancement is achieved by adjusting extrinsic information produced by a max-log-APP process where the magnitude of the extrinsic information is reduced, for example, by multiplying it with a scale factor between 0 and 1.

10. 发明公开

EP0897224A2 Method of enhanced max-log-a posteriori probability processing 审中-公开
标题翻译：一种用于改进的最大对数后验概率处理方法
公开(公告)号：EP0897224A2
公开(公告)日：1999-02-17
申请号：EP98115339.8
申请日：1998-08-14
申请人： Her Majesty The Queen In Right Of Canada as represented by the Minister of Industry
发明人： Crozier, Stewart , Hunt, Andrew , Lodge, John
IPC分类号： H03M13/00
CPC分类号： H03M13/3916 , G11B20/18 , G11B20/1866 , H03M13/2717 , H03M13/2721 , H03M13/29 , H03M13/2903 , H03M13/2906 , H03M13/2909 , H03M13/2918 , H03M13/2933 , H03M13/2945 , H03M13/3905 , H03M13/658
摘要： The invention comprises an enhancement to max-log-APP processing that significantly reduces performance degradation associated with introducing the "max" approximation into log-APP computations, while still maintaining lower computational complexity associated with max-log-APP processing. This enhancement is achieved by adjusting extrinsic information produced by a max-log-APP process where the magnitude of the extrinsic information is reduced, for example, by multiplying it with a scale factor between 0 and 1.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式