利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

40 条记录 (耗时 0.024 秒)

    Method of generating parity data based on low-density parity check matrix and apparatus therefor
    2.
    发明授权
    Method of generating parity data based on low-density parity check matrix and apparatus therefor 失效
    基于低密度奇偶校验矩阵生成奇偶校验数据的方法及其设备

    公开(公告)号：US07278082B2

    公开(公告)日：2007-10-02

    申请号：US10765278

    申请日：2004-01-28

    申请人： Ki-hyun Kim ,  Sung-hyu Han ,  In-sik Park ,  Yoon-woo Lee

    发明人： Ki-hyun Kim ,  Sung-hyu Han ,  In-sik Park ,  Yoon-woo Lee

    IPC分类号： H03M13/00

    CPC分类号： H03M13/1182

    摘要： A method of generating parity data based on a low-density panty check matrix and an apparatus therefor, the method including: reordering columns of the parity check matrix based on elements in each column having values of one to generate a reordered parity check matrix; determining a cross-point between a diagonal line of a parity matrix part in the parity check matrix and a reordered diagonal line defined by a first entry of an element having a value of one in each column of the reordered parity check matrix; and performing column permutations on the reordered parity check matrix on the basis of positions of elements having a value of one in rows above a horizontal line that passes through the cross-point to generate a triangular matrix, thus reducing the computations required to generate parity data, thereby efficiently obtaining the parity data.

    摘要翻译： 一种基于低密度内裤校验矩阵产生奇偶校验数据的方法及其装置，所述方法包括：基于每列中具有值1的元素重新排列奇偶校验矩阵的列，以生成重新排序的奇偶校验矩阵; 确定所述奇偶校验矩阵中的奇偶校验矩阵部分的对角线与由所述重新排序的奇偶校验矩阵的每列中具有值1的元素的第一条目所定义的重排序的对角线之间的交叉点; 并且基于经过交叉点的水平线上的一行的值为1的元素的位置，在重新排序的奇偶校验矩阵上执行列排列，从而减少生成奇偶校验数据所需的计算 从而有效地获得奇偶校验数据。

    Fast low-density parity-check code encoder
    4.
    发明授权
    Fast low-density parity-check code encoder 有权
    快速低密度奇偶校验码编码器

    公开(公告)号：US08271850B2

    公开(公告)日：2012-09-18

    申请号：US12087177

    申请日：2005-12-29

    申请人： Andrey Gennadievich Efimov ,  Andrey Vladimirovich Belogolovy

    发明人： Andrey Gennadievich Efimov ,  Andrey Vladimirovich Belogolovy

    IPC分类号： G06F11/00

    CPC分类号： H03M13/1182

    摘要： Methods, apparatus, and systems are provided to encode a low-density parity-check codeword for transmission in a communications channel. In an embodiment, the encoding may include partially computing parity-check bits in response to receiving a block of message bits before obtaining all the message bits for the low-density parity-check codeword, including updating previously partially computed parity-check bits that depend on the received block.

    摘要翻译： 提供方法，装置和系统以对用于在通信信道中传输的低密度奇偶校验码字进行编码。 在一个实施例中，编码可以包括在获得用于低密度奇偶校验码字的所有消息比特之前响应于接收到消息比特块来部分地计算奇偶校验比特，包括更新先前部分计算的奇偶校验位 在收到的块。

    LDPC coding process with incremental redundancy
    5.
    发明申请
    LDPC coding process with incremental redundancy 有权
    具有增量冗余的LDPC编码过程

    公开(公告)号：US20110138260A1

    公开(公告)日：2011-06-09

    申请号：US12963218

    申请日：2010-12-08

    申请人： Valentin SAVIN

    发明人： Valentin SAVIN

    IPC分类号： H03M13/23 ,  G06F11/10

    CPC分类号： H03M13/1182 ,  H03M13/296 ,  H03M13/6508

    摘要： The invention relates to a coding method with incremental redundancy in which it is determined (620) whether to carry out the coding of a sequence of information symbols using a first code (C), of the LDPC type, defined by a first check matrix, H, or rather using a second code ({tilde over (C)}), of lesser efficiency than that of the first code, the second code being defined by a second check matrix, {tilde over (H)}, obtained by fractionation (630) of the rows of the first check matrix. The invention finds application to, among others, a link adaptation method, a turbo-coding method, a distributed coding method within a cooperative network, a packet transmission method using an IR-HARQ protocol.

    摘要翻译： 本发明涉及一种增量冗余的编码方法，其中确定（620）是否使用由第一校验矩阵定义的LDPC类型的第一代码（C）来执行信息符号序列的编码， 或者更确切地使用比第一代码更低效率的第二代码（{tilde over（C）}），第二代码由通过分段获得的第二校验矩阵{tilde over（H）}定义 （630）的第一个校验矩阵的行。 本发明尤其适用于协作网络中的链路自适应方法，turbo编码方法，分布式编码方法，使用IR-HARQ协议的分组传输方法。

    Methods and apparatus for encoding LDPC codes
    7.
    发明申请
    Methods and apparatus for encoding LDPC codes 有权

    公开(公告)号：US20050246611A1

    公开(公告)日：2005-11-03

    申请号：US11174790

    申请日：2005-07-05

    申请人： Hui Jin ,  Tom Richardson ,  Vladimir Novichkov

    发明人： Hui Jin ,  Tom Richardson ,  Vladimir Novichkov

    IPC分类号： H03M13/11 ,  G06F9/45 ,  H03M13/00

    CPC分类号： H03M13/6362 ,  H03M13/1102 ,  H03M13/1137 ,  H03M13/116 ,  H03M13/1182

    摘要： Methods and apparatus for encoding codewords which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow encoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support bit passing between the replicated copies of the small graph. Bits corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering bits, e.g., using a cyclic permutation operation, in each set of bits read out of a bit memory so that the bits are passed to processing circuits corresponding to different copies of the small graph.

    Methods and apparatus for encoding LDPC codes
    8.
    发明授权
    Methods and apparatus for encoding LDPC codes 有权
    用于编码LDPC码的方法和装置

    公开(公告)号：US06961888B2

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

    申请号：US10618325

    申请日：2003-07-11

    申请人： Hui Jin ,  Tom Richardson ,  Vladimir Novichkov

    发明人： Hui Jin ,  Tom Richardson ,  Vladimir Novichkov

    IPC分类号： H03M13/11 ,  H03M13/13

    CPC分类号： H03M13/6362 ,  H03M13/1102 ,  H03M13/1137 ,  H03M13/116 ,  H03M13/1182

    摘要： Methods and apparatus for encoding codewords which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow encoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support bit passing between the replicated copies of the small graph. Bits corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering bits, e.g., using a cyclic permutation operation, in each set of bits read out of a bit memory so that the bits are passed to processing circuits corresponding to different copies of the small graph.

    摘要翻译： 描述了特别适用于低密度奇偶校验（LDPC）码和长码字的码字的编码方法和装置。 所描述的方法允许编码图形结构，其大部分由更小的图的多个相同副本组成。 较小图的副本经受受控置换操作以创建较大的图形结构。 直接实现相同的受控置换，以支持小图的复制副本之间的位传递。 与图形的各个副本对应的位存储在存储器中，并使用SIMD读取或写入指令以组合的形式从图形的每个副本中进行访问。 图形置换操作可以通过在比特存储器中读出的每组比特中简单地重新排序比特，例如使用循环置换操作来实现，使得比特被传递到对应于小图的不同副本的处理电路。

    Method of converting parity check matrix for low density parity check coding
    9.
    发明申请
    Method of converting parity check matrix for low density parity check coding 失效
    用于低密度奇偶校验编码的奇偶校验矩阵的转换方法

    公开(公告)号：US20050235191A1

    公开(公告)日：2005-10-20

    申请号：US11020017

    申请日：2004-12-23

    申请人： Hyun-jung Kim ,  Ki-hyun Kim ,  Yoon-woo Lee

    发明人： Hyun-jung Kim ,  Ki-hyun Kim ,  Yoon-woo Lee

    IPC分类号： G06F11/10 ,  H03M13/11 ,  H03M13/19 ,  H03M13/00

    CPC分类号： H03M13/1182

    摘要： A method of converting a parity check matrix for low density parity check coding comprising moving rows and columns of the parity check matrix such that the parity check matrix includes a lower triangular submatrix. A calculation load for creating parity information can be reduced by using the converted parity check matrix including the lower triangular submatrix.

    摘要翻译： 一种转换用于低密度奇偶校验编码的奇偶校验矩阵的方法，包括移动奇偶校验矩阵的行和列，使得奇偶校验矩阵包括下三角形子矩阵。 可以通过使用包括下三角子矩阵的转换奇偶校验矩阵来减少用于创建奇偶校验信息的计算负载。