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

31. 发明授权

US07827466B2 Rate matching method in mobile communication system 有权
公开(公告)号：US07827466B2
公开(公告)日：2010-11-02
申请号：US12399892
申请日：2009-03-06
申请人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
发明人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
IPC分类号： H03M13/00
CPC分类号： H04L1/0071 , H03M13/11 , H03M13/271 , H03M13/2792 , H03M13/2903 , H03M13/2957 , H03M13/6362 , H03M13/6368 , H03M13/6375 , H03M13/6381 , H03M13/6508 , H04L1/0041 , H04L1/0066 , H04L1/0069 , H04L1/08 , H04W88/181
摘要： A rate matching method is provided for a mobile communication system that performs an adjustment to a code rate based on an optimal level by puncturing or repetition to respective bit streams of transport channels. The rate matching method is preferably applicable to uplink and downlink rate matching for channel coding including turbo coding, convolutional coding and the like. The rate matching method for uplink can include executing coding for bits of a transport channel, and branching off the bits into a plurality of sequences, constructing a first interleaving pattern for the plurality of sequences, constructing a virtual interleaving pattern for at least one sequence based on a mapping rule with a corresponding first interleaving pattern and calculating different bit shifting values in each column of each virtual interleaving pattern. Then, a bit position to be punctured is determined in each constructed virtual interleaving pattern using the calculated bit shifting values.

32. 发明授权

US07814399B2 Apparatus and method of early decoding in communication systems 有权
标题翻译：通信系统中早期解码的装置和方法
公开(公告)号：US07814399B2
公开(公告)日：2010-10-12
申请号：US11871902
申请日：2007-10-12
申请人： Stein A. Lundby
发明人： Stein A. Lundby
IPC分类号： H03M13/03
CPC分类号： H03M13/6368 , H03M13/27
摘要： A method and apparatus are disclosed for forming a frame of interleaved information bits in a communication system, where the decoding of the frame of interleaved information bits may begin before all of the bits in the frame are received. An exemplary interleaved frame is formed by receiving a frame of N information bits within the communication system; encoding the information bits at a code rate R to provide encoded bits; and arranging the encoded bits into a frame of N/R coded bits, wherein a plurality of puncturing patterns pi are applied to the frame of N/R coded bits such that a code rate of R/ai is produced for each of the plurality of puncturing pattern pi. The arrangement of encoded bits involves applying a puncturing pattern pj to the encoded bits; and applying a permutation function to the punctured encoded bits to generate a fractional section of the frame of N/R coded bits. The fractional section of the frame of N/R coded bits comprises N/R * aj bits.
摘要翻译：公开了一种用于在通信系统中形成交错信息比特帧的方法和装置，其中交织的信息比特的帧的解码可以在帧中的所有比特被接收之前开始。通过在通信系统内接收N个信息比特的帧来形成示例性交织帧; 以码率R对信息比特进行编码以提供编码比特; 以及将编码的比特排列成N / R编码比特的帧，其中多个打孔图案pi被施加到N / R编码比特的帧，使得对于多个N / R编码比特中的每一个产生R / ai的码率穿刺图案pi。编码比特的排列涉及将打孔图案pj应用于编码比特; 以及将置换功能应用于所述穿孔的编码比特，以生成所述N / R编码比特的帧的小数部分。 N / R编码比特的帧的小数部分包括N / R * aj比特。

33. 发明申请

US20100251065A1 LOW DENSITY PARITY CHECK (LDPC) CODE 有权
标题翻译：低密度奇偶校验（LDPC）代码
公开(公告)号：US20100251065A1
公开(公告)日：2010-09-30
申请号：US12796453
申请日：2010-06-08
申请人： Michael LIVSHITZ
发明人： Michael LIVSHITZ
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： H03M13/1111 , H03M13/1137 , H03M13/114 , H03M13/116 , H03M13/118 , H03M13/1185 , H03M13/1188 , H03M13/618 , H03M13/6362 , H03M13/6368 , H03M13/6393 , H04L1/0057 , H04L1/0068
摘要： Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems. The method of expanding the base check parity matrix is described. Examples of expanded LDPC codes with different code lengths and expansion factors are also shown.
摘要翻译：低密度奇偶校验码（LDPC）基本奇偶校验矩阵及其在通信系统中的使用方法。描述了扩展基本校验奇偶校验矩阵的方法。还示出了具有不同码长和扩展因子的扩展LDPC码的示例。

34. 发明申请

US20100211847A1 STRUCTURED LOW-DENSITY PARITY-CHECK (LDPC) CODE 失效
标题翻译：结构化低密度奇偶校验（LDPC）代码
公开(公告)号：US20100211847A1
公开(公告)日：2010-08-19
申请号：US12704850
申请日：2010-02-12
申请人： MICHAEL LIVSHITZ , ALEKSANDAR PURKOVIC , NINA BURNS , SERGEY SUKHOBOK , MUHAMMAD CHAUDHRY
发明人： MICHAEL LIVSHITZ , ALEKSANDAR PURKOVIC , NINA BURNS , SERGEY SUKHOBOK , MUHAMMAD CHAUDHRY
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： H03M13/1111 , H03M13/1137 , H03M13/114 , H03M13/116 , H03M13/118 , H03M13/1185 , H03M13/1188 , H03M13/618 , H03M13/6362 , H03M13/6368 , H03M13/6393 , H04L1/0057 , H04L1/0068
摘要： A method for constructing a low-density parity-check (LDPC) code using a structured base parity check matrix with permutation matrix, pseudo-permutation matrix, or zero matrix as constituent sub-matrices; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for constructing a LDPC code using a structured base parity check matrix H=[Hd|Hp], Hd is the data portion, and Hp is the parity portion of the parity check matrix; the parity portion of the structured base parity check matrix is such so that when expanded, an inverse of the parity portion of the expanded parity check matrix is sparse; and expanding the structured base parity check matrix into an expanded parity check matrix. A method for encoding variable sized data by using the expanded LDPC code; and applying shortening, puncturing.
摘要翻译：一种使用具有置换矩阵，伪置换矩阵或零矩阵的结构化基本奇偶校验矩阵作为组成子矩阵来构造低密度奇偶校验（LDPC）码的方法; 并将结构化基本奇偶校验矩阵扩展成扩展奇偶校验矩阵。使用结构化基本奇偶校验矩阵H = [Hd | Hp]，Hd构造LDPC码的方法是数据部分，Hp是奇偶校验矩阵的奇偶校验部分; 结构化基本奇偶校验矩阵的奇偶校验部分使得当扩展时，扩展奇偶校验矩阵的奇偶校验部分的倒数是稀疏的; 并将结构化基本奇偶校验矩阵扩展成扩展奇偶校验矩阵。一种通过使用扩展的LDPC码对可变大小的数据进行编码的方法; 并应用缩短，穿刺。

35. 发明申请

US20090259915A1 Structured low-density parity-check (ldpc) code 有权
标题翻译：结构化低密度奇偶校验（ldpc）代码
公开(公告)号：US20090259915A1
公开(公告)日：2009-10-15
申请号：US11665171
申请日：2005-10-12
申请人： Michael Livshitz , Aleksandar Purkovic , Nina Burns , Sergey Sukhobok , Muhammad Chaudhry
发明人： Michael Livshitz , Aleksandar Purkovic , Nina Burns , Sergey Sukhobok , Muhammad Chaudhry
IPC分类号： H03M13/11 , G06F11/10
CPC分类号： H03M13/1111 , H03M13/1137 , H03M13/114 , H03M13/116 , H03M13/118 , H03M13/1185 , H03M13/1188 , H03M13/618 , H03M13/6362 , H03M13/6368 , H03M13/6393 , H04L1/0057 , H04L1/0068
摘要： The invention introduces an apparatus, method and system that allow coding matrices to be expanded to accommodate various information packet sizes and support for various code rates; additionally the invention defines a number of coding matrices particularly suited to the methodology. The invention enables high throughput implementations, allows achieving low latency, and offers other numerous implementation benefits. At the same time, the new parity part of the matrix preserves the simple (recursive) encoding feature.
摘要翻译：本发明引入了允许扩展编码矩阵以适应各种信息分组大小并支持各种码率的装置，方法和系统; 此外，本发明定义了特别适合该方法的多个编码矩阵。本发明实现了高吞吐量实现，允许实现低延迟，并且提供了其它许多实现益处。同时，矩阵的新的奇偶校验部分保留简单（递归）编码特征。

36. 发明申请

US20090235147A1 RATE MATCHING METHOD IN MOBILE COMMUNICATION SYSTEM 有权
公开(公告)号：US20090235147A1
公开(公告)日：2009-09-17
申请号：US12399892
申请日：2009-03-06
申请人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
发明人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
IPC分类号： H03M13/23 , G06F11/10
CPC分类号： H04L1/0071 , H03M13/11 , H03M13/271 , H03M13/2792 , H03M13/2903 , H03M13/2957 , H03M13/6362 , H03M13/6368 , H03M13/6375 , H03M13/6381 , H03M13/6508 , H04L1/0041 , H04L1/0066 , H04L1/0069 , H04L1/08 , H04W88/181
摘要： A rate matching method is provided for a mobile communication system that performs an adjustment to a code rate based on an optimal level by puncturing or repetition to respective bit streams of transport channels. The rate matching method is preferably applicable to uplink and downlink rate matching for channel coding including turbo coding, convolutional coding and the like. The rate matching method for uplink can include executing coding for bits of a transport channel, and branching off the bits into a plurality of sequences, constructing a first interleaving pattern for the plurality of sequences, constructing a virtual interleaving pattern for at least one sequence based on a mapping rule with a corresponding first interleaving pattern and calculating different bit shifting values in each column of each virtual interleaving pattern. Then, a bit position to be punctured is determined in each constructed virtual interleaving pattern using the calculated bit shifting values.

37. 发明授权

US07523383B2 Rate matching method in mobile communication system 有权
标题翻译：移动通信系统中的速率匹配方法
公开(公告)号：US07523383B2
公开(公告)日：2009-04-21
申请号：US11404175
申请日：2006-04-13
申请人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
发明人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
IPC分类号： H03M13/03
CPC分类号： H04L1/0071 , H03M13/11 , H03M13/271 , H03M13/2792 , H03M13/2903 , H03M13/2957 , H03M13/6362 , H03M13/6368 , H03M13/6375 , H03M13/6381 , H03M13/6508 , H04L1/0041 , H04L1/0066 , H04L1/0069 , H04L1/08 , H04W88/181
摘要： A rate matching method is provided for a mobile communication system that performs an adjustment to a code rate based on an optimal level by puncturing or repetition to respective bit streams of transport channels. The rate matching method is preferably applicable to uplink and downlink rate matching for channel coding including turbo coding, convolutional coding and the like. The rate matching method for uplink can include executing coding for bits of a transport channel, and branching off the bits into a plurality of sequences, constructing a first interleaving pattern for the plurality of sequences, constructing a virtual interleaving pattern for at least one sequence based on a mapping rule with a corresponding first interleaving pattern and calculating different bit shifting values in each column of each virtual interleaving pattern. Then, a bit position to be punctured is determined in each constructed virtual interleaving pattern using the calculated bit shifting values.
摘要翻译：提供了一种用于移动通信系统的速率匹配方法，该移动通信系统通过对传输信道的各个比特流进行穿孔或重复，基于最佳等级来对码率进行调整。速率匹配方法优选地适用于包括turbo编码，卷积编码等的信道编码的上行链路和下行链路速率匹配。用于上行链路的速率匹配方法可以包括对传输信道的比特执行编码，并将比特分支为多个序列，构成多个序列的第一交织模式，为至少一个序列建立虚拟交织模式在具有对应的第一交织模式的映射规则上，并计算每个虚拟交织模式的每列中的不同位移位值。然后，使用所计算的比特移位值，在每个构成的虚拟交织模式中确定要删截的比特位置。

38. 发明申请

US20060251001A1 Rate matching method in mobile communication system 有权
公开(公告)号：US20060251001A1
公开(公告)日：2006-11-09
申请号：US11404175
申请日：2006-04-13
申请人： Young Yun , Ki Kim , Sung Kwon , Young Lee , Sung Hong
发明人： Young Yun , Ki Kim , Sung Kwon , Young Lee , Sung Hong
IPC分类号： H04J3/08 , H04B7/14
CPC分类号： H04L1/0071 , H03M13/11 , H03M13/271 , H03M13/2792 , H03M13/2903 , H03M13/2957 , H03M13/6362 , H03M13/6368 , H03M13/6375 , H03M13/6381 , H03M13/6508 , H04L1/0041 , H04L1/0066 , H04L1/0069 , H04L1/08 , H04W88/181
摘要： A rate matching method is provided for a mobile communication system that performs an adjustment to a code rate based on an optimal level by puncturing or repetition to respective bit streams of transport channels. The rate matching method is preferably applicable to uplink and downlink rate matching for channel coding including turbo coding, convolutional coding and the like. The rate matching method for uplink can include executing coding for bits of a transport channel, and branching off the bits into a plurality of sequences, constructing a first interleaving pattern for the plurality of sequences, constructing a virtual interleaving pattern for at least one sequence based on a mapping rule with a corresponding first interleaving pattern and calculating different bit shifting values in each column of each virtual interleaving pattern. Then, a bit position to be punctured is determined in each constructed virtual interleaving pattern using the calculated bit shifting values.

39. 发明授权

US06622281B1 Rate matching method in mobile communication system 有权
公开(公告)号：US06622281B1
公开(公告)日：2003-09-16
申请号：US09615603
申请日：2000-07-13
申请人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
发明人： Young Woo Yun , Ki Jun Kim , Sung Lark Kwon , Young Jo Lee , Sung Kwon Hong
IPC分类号： H03M1303
CPC分类号： H04L1/0071 , H03M13/11 , H03M13/271 , H03M13/2792 , H03M13/2903 , H03M13/2957 , H03M13/6362 , H03M13/6368 , H03M13/6375 , H03M13/6381 , H03M13/6508 , H04L1/0041 , H04L1/0066 , H04L1/0069 , H04L1/08 , H04W88/181
摘要： A rate matching method is provided for a mobile communication system that performs an adjustment to a code rate based on an optimal level by puncturing or repetition to respective bit streams of transport channels. The rate matching method is preferably applicable to uplink and downlink rate matching for channel coding including turbo coding, convolutional coding and the like. The rate matching method for uplink can include executing coding for bits of a transport channel, and branching off the bits into a plurality of sequences, constructing a first interleaving pattern for the plurality of sequences, constructing a virtual interleaving pattern for at least one sequence based on a mapping rule with a corresponding first interleaving pattern and calculating different bit shifting values in each column of each virtual interleaving pattern. Then, a bit position to be punctured is determined in each constructed virtual interleaving pattern using the calculated bit shifting values.

40. 发明申请

US20190081646A1 DEVICES AND METHODS IMPLEMENTING POLAR CODES 审中-公开
公开(公告)号：US20190081646A1
公开(公告)日：2019-03-14
申请号：US16188717
申请日：2018-11-13
申请人： Huawei Technologies Co., Ltd.
发明人： Valerio BIOGLIO , Frederic GABRY , Ingmar LAND , Jean-Claude BELFIORE
IPC分类号： H03M13/00 , H03M13/13 , H03M13/09 , H04L1/00
CPC分类号： H03M13/618 , H03M13/09 , H03M13/13 , H03M13/611 , H03M13/6362 , H03M13/6368 , H04L1/0041 , H04L1/0069
摘要： Encoder for encoding K information bits into a code word of length N′ on the basis of a polar code of length N, wherein N is a power of 2 and greater than or equal to N′. The encoder comprises a memory storing a plurality of bit indices, wherein the plurality of bit indices comprise a set of N frozen bit indices associated with the polar code of length N, a set of N/2 puncturing bit indices and/or a set of N/2 shortening bit indices and a processor configured to retrieve at least a subset of the plurality of bit indices from the memory, to encode the K information bits using the polar code of length N for obtaining encoded data of length N and to reduce the number of bits of the encoded data to the length N′ for obtaining the code word of length N′.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式