公开(公告)号：US20060206781A1

公开(公告)日：2006-09-14

申请号：US11367521

申请日：2006-03-03

申请人： Eoi-Young Choi ,  Seung-Bum Suh

发明人： Eoi-Young Choi ,  Seung-Bum Suh

IPC分类号： H03M13/00

CPC分类号： H03M13/6368 ,  H03M13/1102 ,  H03M13/116 ,  H03M13/118 ,  H03M13/1188 ,  H03M13/6306 ,  H03M13/6362

摘要： A method is provided for puncturing a low density parity check (LDPC) code decoded by a parity check matrix that is expressed by a factor graph including a check node and a bit node, being connected to each other at an edge, and includes a parity part having a dual diagonal matrix with a single 3-weight column and the remaining columns being 2-weight columns. The method includes generating a puncturing pattern such that bits of the LDPC code are punctured in an order of a bit mapped to a column with a higher weight from among the columns constituting the parity part; and puncturing the LDPC code according to the generated puncturing pattern.

摘要翻译： 提供了一种用于对由奇偶校验矩阵解码的低密度奇偶校验（LDPC）码的方法，所述奇偶校验矩阵由包括校验节点和比特节点的因子图表示，所述校验节点和比特节点在边缘彼此连接，并且包括奇偶校验 部分具有双重对角线矩阵，具有单个3重量列，其余列是2重量列。 该方法包括生成删截图案，使得从构成奇偶校验部分的列中以比特映射到具有较高权重的列的顺序对LDPC码的比特进行穿孔; 以及根据所生成的穿孔模式对所述LDPC码进行穿孔。

公开(公告)号：US08006162B2

公开(公告)日：2011-08-23

申请号：US11435014

申请日：2006-05-16

申请人： Eoi-Young Choi ,  Seung-Bum Suh

发明人： Eoi-Young Choi ,  Seung-Bum Suh

IPC分类号： H03M13/00

CPC分类号： H03M13/6393 ,  H03M13/116 ,  H03M13/1185 ,  H03M13/1188 ,  H03M13/6356 ,  H03M13/6362

摘要： Disclosed is a method for puncturing a Low Density Parity Check (LDPC) code that is expressed by a factor graph having a check node and a variable node, connected to each other by an edge, and is decoded by a parity check matrix including a parity part having a single weight-3 column and a dual-diagonal matrix. The method includes selecting 1-step recoverable (1-SR) variable nodes with the highest quality including a variable node mapped to a weight-3 column, and setting a first puncturing priority group using the selected 1-SR variable nodes, selecting k-step recoverable (k-SR) variable nodes with the highest quality in the next step k taking into account the variable nodes selected in the current step, and setting a priority group for each individual step, puncturing an LDPC code mapped to a variable node belonging to a corresponding group according to priority of each group obtained in the preceding steps.

摘要翻译： 公开了一种用于删除由具有由边缘彼此连接的校验节点和可变节点的因子图表示的低密度奇偶校验（LDPC）码的方法，并且通过包括奇偶校验的奇偶校验矩阵来解码 部分具有单个重量3列和双对角矩阵。 该方法包括选择具有最高质量的一步可恢复（1-SR）变量节点，包括映射到权重3列的变量节点，以及使用所选择的1-SR变量节点设置第一穿孔优先级组，选择k- 考虑到当前步骤中选择的变量节点，在下一步骤k中具有最高质量的步骤可恢复（k-SR）变量节点，并且为每个单独步骤设置优先级组，对映射到属于变量节点的LDPC码进行穿孔 根据在前述步骤中获得的每个组的优先级，对应于组。

公开(公告)号：US07409000B2

公开(公告)日：2008-08-05

申请号：US11002405

申请日：2004-12-02

申请人： Eoi-Young Choi ,  Seung-Bum Suh ,  Jun-Hong Hui ,  Ying Li

发明人： Eoi-Young Choi ,  Seung-Bum Suh ,  Jun-Hong Hui ,  Ying Li

IPC分类号： H04L23/02

CPC分类号： H04L1/065 ,  H04L1/006 ,  H04L1/0065 ,  H04L1/0625

摘要： Disclosed is a space-time trellis code (STTC) encoding method for performing space-time coding of a serially-concatenated space-time code (SC-STC) in an encoder having an outer encoder for performing channel coding and an inner encoder for performing the space-time coding, in a mobile communication system including one or more transmission antennas, by transmitting via a first transmission antenna a symbol generated by encoding a first input signal output from the outer encoder by a first recursive convolutional encoder and a symbol generated by encoding a second input signal output from the outer encoder by a second recursive convolutional encoder; and transmitting via a second transmission antenna the first and second input signals.

摘要翻译： 公开了一种用于在具有用于执行信道编码的外部编码器的编码器中执行串行级联空时码（SC-STC）的时空编码的时空网格码（STTC）编码方法和用于执行 在包括一个或多个发送天线的移动通信系统中，通过经由第一发送天线发送由第一递归卷积编码器对从外编码器输出的第一输入信号进行编码而产生的符号，以及由 通过第二递归卷积编码器对从外编码器输出的第二输入信号进行编码; 以及经由第二发送天线发送所述第一和第二输入信号。

公开(公告)号：US07743312B2

公开(公告)日：2010-06-22

申请号：US11367521

申请日：2006-03-03

申请人： Eoi-Young Choi ,  Seung-Bum Suh

发明人： Eoi-Young Choi ,  Seung-Bum Suh

IPC分类号： H03M13/03

CPC分类号： H03M13/6368 ,  H03M13/1102 ,  H03M13/116 ,  H03M13/118 ,  H03M13/1188 ,  H03M13/6306 ,  H03M13/6362

摘要： A method is provided for puncturing a low density parity check (LDPC) code decoded by a parity check matrix that is expressed by a factor graph including a check node and a bit node, being connected to each other at an edge, and includes a parity part having a dual diagonal matrix with a single 3-weight column and the remaining columns being 2-weight columns. The method includes generating a puncturing pattern such that bits of the LDPC code are punctured in an order of a bit mapped to a column with a higher weight from among the columns constituting the parity part; and puncturing the LDPC code according to the generated puncturing pattern.

摘要翻译： 提供了一种用于对由奇偶校验矩阵解码的低密度奇偶校验（LDPC）码的方法，所述奇偶校验矩阵由包括校验节点和比特节点的因子图表示，所述校验节点和比特节点在边缘彼此连接，并且包括奇偶校验 部分具有双重对角线矩阵，具有单个3重量列，其余列是2重量列。 该方法包括生成删截图案，使得从构成奇偶校验部分的列中以比特映射到具有较高权重的列的顺序对LDPC码的比特进行穿孔; 以及根据所生成的穿孔模式对所述LDPC码进行穿孔。

公开(公告)号：US07451374B2

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

申请号：US11190543

申请日：2005-07-27

申请人： Nam-Shik Kim ,  Hyun-Cheol Park ,  Seung-Bum Suh ,  Eoi-Young Choi

发明人： Nam-Shik Kim ,  Hyun-Cheol Park ,  Seung-Bum Suh ,  Eoi-Young Choi

IPC分类号： H04L1/779

CPC分类号： H03M13/116

摘要： Disclosed are an apparatus and a method for reducing the coding complexity in an LDPC code used in a digital communication system. In the method, parameters required for coding are determined according to a coding rate and a code length, a seed matrix is generated according to values of the parameters, a plurality of cell matrices are generated according to the values of the parameters, a parity check matrix is generated using the seed matrix and the cell matrix, and information bits are coded from the parity check matrix. The method can be realized by a small memory and a simple shift register and can perform coding even without obtaining a generation matrix, thereby remarkably reducing the complexity of a system.

摘要翻译： 公开了一种降低数字通信系统中使用的LDPC码的编码复杂度的装置和方法。 在该方法中，根据编码率和码长来确定编码所需的参数，根据参数的值生成种子矩阵，根据参数的值生成多个小区矩阵，奇偶校验 使用种子矩阵和单元矩阵生成矩阵，并且从奇偶校验矩阵编码信息比特。 该方法可以通过小存储器和简单的移位寄存器来实现，并且即使没有获得生成矩阵也可以执行编码，从而显着降低了系统的复杂性。

公开(公告)号：US20070011567A1

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

申请号：US11435014

申请日：2006-05-16

申请人： Eoi-Young Choi ,  Seung-Bum Suh

发明人： Eoi-Young Choi ,  Seung-Bum Suh

IPC分类号： H03M13/00

CPC分类号： H03M13/6393 ,  H03M13/116 ,  H03M13/1185 ,  H03M13/1188 ,  H03M13/6356 ,  H03M13/6362

摘要： Disclosed is a method for puncturing a Low Density Parity Check (LDPC) code that is expressed by a factor graph having a check node and a variable node, connected to each other by an edge, and is decoded by a parity check matrix including a parity part having a single weight-3 column and a dual-diagonal matrix. The method includes selecting 1-step recoverable (1-SR) variable nodes with the highest quality including a variable node mapped to a weight-3 column, and setting a first puncturing priority group using the selected 1-SR variable nodes, selecting k-step recoverable (k-SR) variable nodes with the highest quality in the next step k taking into account the variable nodes selected in the current step, and setting a priority group for each individual step, puncturing an LDPC code mapped to a variable node belonging to a corresponding group according to priority of each group obtained in the preceding steps.

摘要翻译： 公开了一种用于删除由具有由边缘彼此连接的校验节点和可变节点的因子图表示的低密度奇偶校验（LDPC）码的方法，并且通过包括奇偶校验的奇偶校验矩阵来解码 部分具有单个重量3列和双对角矩阵。 该方法包括选择具有最高质量的一步可恢复（1-SR）变量节点，包括映射到权重3列的变量节点，以及使用所选择的1-SR变量节点设置第一穿孔优先级组，选择k- 考虑到当前步骤中选择的变量节点，在下一步骤k中具有最高质量的步骤可恢复（k-SR）变量节点，并且为每个单独步骤设置优先级组，对映射到属于变量节点的LDPC码进行穿孔 根据在前述步骤中获得的每个组的优先级，对应于组。

公开(公告)号：US20060029149A1

公开(公告)日：2006-02-09

申请号：US11197144

申请日：2005-08-04

申请人： Hyoun-Kuk Kim ,  Hyun-Cheol Park ,  Seung-Bum Suh ,  Eoi-Young Choi

发明人： Hyoun-Kuk Kim ,  Hyun-Cheol Park ,  Seung-Bum Suh ,  Eoi-Young Choi

IPC分类号： H04L1/02

CPC分类号： H04L25/03057 ,  H04L2025/03375 ,  H04L2025/0349

摘要： An improved receiver for a multicarrier-based MIMO (Multiple-Input Multiple-Output) system is provided. A MIMO receiving apparatus includes a detection priority decision unit, which receives via N receiving antennas signals transmitted from M transmitting antennas and determines the detection priorities of the signals, and a signal detector, which successively detects the signals in a decreasing order from a signal having a higher priority according to the detection priorities determined by the detection priority decision unit. System complexity can be reduced by minimizing the number of the inverse matrix calculations required for an SIC mechanism using one MIMO DFE and MISO DFEs corresponding to the number of transmitting antennas.

摘要翻译： 提供了一种用于基于多载波的MIMO（多输入多输出）系统的改进的接收机。 MIMO接收装置包括：检测优先级决定单元，其经由N个接收天线接收从M个发送天线发送的信号，并确定信号的检测优先级;以及信号检测器，其从具有 根据由检测优先级决定单元确定的检测优先级，优先级更高。 可以通过使用与发射天线数量相对应的一个MIMO DFE和MISO DFE来最小化SIC机制所需的逆矩阵计算的数量来减少系统复杂度。

公开(公告)号：US20060026488A1

公开(公告)日：2006-02-02

申请号：US11190543

申请日：2005-07-27

申请人： Nam-Shik Kim ,  Hyun-Cheol Park ,  Seung-Bum Suh ,  Eoi-Young Choi

发明人： Nam-Shik Kim ,  Hyun-Cheol Park ,  Seung-Bum Suh ,  Eoi-Young Choi

IPC分类号： H03M13/00

CPC分类号： H03M13/116

摘要： Disclosed are an apparatus and a method for reducing the coding complexity in an LDPC code used in a digital communication system. In the method, parameters required for coding are determined according to a coding rate and a code length, a seed matrix is generated according to values of the parameters, a plurality of cell matrices are generated according to the values of the parameters, a parity check matrix is generated using the seed matrix and the cell matrix, and information bits are coded from the parity check matrix. The method can be realized by a small memory and a simple shift register and can perform coding even without obtaining a generation matrix, thereby remarkably reducing the complexity of a system.

摘要翻译： 公开了一种降低数字通信系统中使用的LDPC码的编码复杂度的装置和方法。 在该方法中，根据编码率和码长来确定编码所需的参数，根据参数的值生成种子矩阵，根据参数的值生成多个小区矩阵，奇偶校验 使用种子矩阵和单元矩阵生成矩阵，并且从奇偶校验矩阵编码信息比特。 该方法可以通过小存储器和简单的移位寄存器来实现，并且即使没有获得生成矩阵也可以执行编码，从而显着降低了系统的复杂性。

公开(公告)号：US20050149845A1

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

申请号：US10983347

申请日：2004-11-08

申请人： Min-Ho Shin ,  Hong-Yeop Song ,  Seung-Bum Suh ,  Eoi-Young Choi

发明人： Min-Ho Shin ,  Hong-Yeop Song ,  Seung-Bum Suh ,  Eoi-Young Choi

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

CPC分类号： H03M13/1168 ,  H03M13/033 ,  H03M13/116 ,  H03M13/1177 ,  H03M13/6516 ,  H03M13/6561

摘要： An LDPC encoding method in a digital communication system is provided, in which a parity-check matrix H having a plurality of circulant matrices as elements is first generated. A generation matrix G is generated using the parity-check matrix. Information bits are then encoded using the generation matrix G.

摘要翻译： 提供了一种数字通信系统中的LDPC编码方法，其中首先产生具有多个循环矩阵作为元素的奇偶校验矩阵H。 使用奇偶校验矩阵生成生成矩阵G. 然后使用生成矩阵G对信息比特进行编码。

公开(公告)号：US20050141632A1

公开(公告)日：2005-06-30

申请号：US11002405

申请日：2004-12-02

申请人： Eoi-Young Choi ,  Seung-Bum Suh ,  Jun-Hong Hui ,  Ying Li

发明人： Eoi-Young Choi ,  Seung-Bum Suh ,  Jun-Hong Hui ,  Ying Li

IPC分类号： H04B7/02 ,  H04L1/00 ,  H04L1/06 ,  H04L1/02

CPC分类号： H04L1/065 ,  H04L1/006 ,  H04L1/0065 ,  H04L1/0625

摘要： Disclosed is a space-time trellis code (STTC) encoding method for performing space-time coding of a serially-concatenated space-time code (SC-STC) in an encoder having an outer encoder for performing channel coding and an inner encoder for performing the space-time coding, in a mobile communication system including one or more transmission antennas, by transmitting via a first transmission antenna a symbol generated by encoding a first input signal output from the outer encoder by a first recursive convolutional encoder and a symbol generated by encoding a second input signal output from the outer encoder by a second recursive convolutional encoder; and transmitting via a second transmission antenna the first and second input signals.

摘要翻译： 公开了一种用于在具有用于执行信道编码的外部编码器的编码器中执行串行级联空时码（SC-STC）的时空编码的时空网格码（STTC）编码方法和用于执行 在包括一个或多个发送天线的移动通信系统中，通过经由第一发送天线发送由第一递归卷积编码器对从外编码器输出的第一输入信号进行编码而产生的符号，以及由 通过第二递归卷积编码器对从外编码器输出的第二输入信号进行编码; 以及经由第二发送天线发送所述第一和第二输入信号。