-
1.
公开(公告)号:WO2019043680A1
公开(公告)日:2019-03-07
申请号:PCT/IL2018/050414
申请日:2018-04-10
Applicant: TSOFUN ALGORITHMS LTD.
Inventor: MELLER, Eldad , PRESMAN, Noam , SMEKHOV, Alexander , HALABI, Nissim
IPC: H03M13/13
CPC classification number: H03M13/13
Abstract: There is provided a method of sequential list decoding of an error correction code (ECC) utilizing a decoder comprising a plurality of processors. The method comprises: a) obtaining an ordered sequence of constituent codes usable for the sequential decoding of the ECC; b) executing, by a first processor, a task of decoding a first constituent code, the executing comprising: a. generating decoding candidate words (DCWs) usable to be selected for decoding a subsequent constituent code, each DCW associated with a ranking; b. for the first constituent code, upon occurrence of a sufficiency criterion, and prior to completion of the generating all DCWs and rankings, selecting, in accordance with a selection criterion, at least one DCW; c) executing, by a second processor, a task of decoding a subsequent constituent code, the executing comprising processing data derived from the selected DCWs to generate data usable for decoding a next subsequent constituent code.
-
公开(公告)号:WO2019042271A1
公开(公告)日:2019-03-07
申请号:PCT/CN2018/102647
申请日:2018-08-28
Applicant: 华为技术有限公司
Abstract: 本申请提供一种极化码的译码方法、译码器及译码设备,该方法包括:根据上一级译码得到的L条第一译码后序列,获取每条第一译码后序列在本级译码中对应的M个对数似然比值;针对任一第一译码后序列,根据第一译码后序列在本级译码中对应的M个对数似然比值,确定L条最优译码路径;其中,第一译码后序列在本级译码中对应2 M 个译码路径,L条最优译码路径为2 M 个译码路径中分支度量小于其它译码路径的分支度量的译码路径,各分支度量是根据M个对数似然比值确定的;针对L条第一译码后序列,在L×L条最优译码路径中确定本级译码对应的L条第二译码后序列。本申请在不增加译码复杂度的基础上,可以提高译码效率。
-
公开(公告)号:WO2019022334A1
公开(公告)日:2019-01-31
申请号:PCT/KR2018/003298
申请日:2018-03-21
Applicant: 연세대학교 산학협력단
CPC classification number: H03M13/1174 , H03M13/13
Abstract: 패리티 검사 연접 극 부호화기가 제공된다. 본 패리티 검사 연접 극 부호화기는 외부 부호화기 및 외부 부호화기에 연접된 극 부호화기를 포함할 수 있다. 외부 부호화기는 m개의 정보 비트를 입력받아 m개의 정보 비트와 r개의 패리티 검사 비트를 출력으로 제공하도록 구성될 수 있다. 극 부호화기는 외부 부호화기로부터 제공받은 m개의 정보 비트 및 r개의 패리티 검사 비트 그리고 선정된 비트 인덱스들에서 제공되는 [n - (m + r)]개의 프로즌 비트를 포함하는 n개의 비트를 입력으로 하여 n개의 출력 비트를 제공하도록 구성될 수 있다. 외부 부호화기에 의해 m개의 정보 비트와 함께 출력되는 r개의 패리티 검사 비트 용의 비트 인덱스들 및 그 비트 값들은, 극 부호화기에서 이론적으로 출력될 수 있는 부호화된 벡터들 중에서 최소 해밍 웨이트(Minimum Hamming Weight: MHW)를 갖는 부호화된 벡터(들)이 실제로 출력되지 않도록 그에 해당하는 입력 벡터(들)이 가능하면 극 부호화기로 입력되지 않게 되도록 정해질 수 있다.
-
公开(公告)号:WO2018223943A1
公开(公告)日:2018-12-13
申请号:PCT/CN2018/089898
申请日:2018-06-05
Applicant: HUAWEI TECHNOLOGIES CO., LTD.
Inventor: SABER, Hamid , GE, Yiqun
IPC: H04L1/00
CPC classification number: H03M13/611 , H03M13/09 , H03M13/13 , H03M13/27 , H03M13/2906 , H03M13/616
Abstract: Method and apparatus for generating a codeword by interleaving information and assistant bits. An interleaved sequence of information bits and assistant bits is generated according to an interleaving order. The interleaving order is selected to reduce a number of information bits occurring before a first assistant bit and further reduce each subsequent number of additional information bits occurring between assistant bits. The interleaved sequence is encoded using a polar code to generate a codeword, and the codeword is transmitted.
-
公开(公告)号:WO2018219031A1
公开(公告)日:2018-12-06
申请号:PCT/CN2018/080957
申请日:2018-03-28
Applicant: 华为技术有限公司
IPC: H03M13/13
Abstract: 本申请公开了一种Polar码处理方法、译码器和终端,以解决SCL译码器中吞吐率受限的问题。该方法应用于SCL译码器中,包括:获取本级译码块的译码信息;根据所述译码信息,确定所述本级译码块的第一Pattern;根据确定的所述第一Pattern,从预设的处理方式中,选择与所述第一Pattern对应的处理方式,基于所述选择的处理方式,对所述SCL译码器的本级输出路径进行判决,以选出最优路径,这样能够提高译码吞吐量,提升译码性能。
-
公开(公告)号:WO2018201671A1
公开(公告)日:2018-11-08
申请号:PCT/CN2017/105330
申请日:2017-10-09
Applicant: 西南交通大学
IPC: H03M13/13
CPC classification number: H03M13/13
Abstract: 一种极化码迭代接收机和极化码迭代译码方法,其中,上述的接收机包括:检测器(101)、第一加减法器(102)、解交织器(103)、迭代极化码译码器(104)、第二加减法器(105)、交织器(106)和逆映射器(107)。通过使用上述的接收机和方法,可以在保留编码增益的同时,在不增加译码复杂度的情况下,提高无线通信系统的误码率及误块率性能,提升用户体验。
-
公开(公告)号:WO2018201377A1
公开(公告)日:2018-11-08
申请号:PCT/CN2017/083003
申请日:2017-05-04
Inventor: JAYASINGHE, Keeth Saliya , CHEN, Yu , DU, Dongyang , CHEN, Jie
CPC classification number: H03M13/13 , H03M13/09 , H03M13/2906 , H04L1/00 , H04L1/0041 , H04L1/0057 , H04L1/0061
Abstract: It is provided a method, comprising generating J addon bits if K information bits are sequentially inputted into a generating means comprising J registers; retrieving J * addon bits from the J registers after at least one of the K information bits had been inputted into the generating means and before the K information bits are inputted into the generating means; constructing a codeblock comprising each of the K information bits, the J addon bits, and the J * addon bits, wherein each of the K information bits, the J addon bits, and the J * addon bits is at a respective predetermined position of the codeblock; polar encoding the codeblock.
-
公开(公告)号:WO2018151555A1
公开(公告)日:2018-08-23
申请号:PCT/KR2018/001980
申请日:2018-02-14
Applicant: 엘지전자 주식회사
Abstract: 무선 통신 시스템에서 전송장치는 크기 N인 폴라 코드의 N개 입력 비트 위치들 중 일부에 특정 비트 할당 시퀀스에 따라 D-비트 정보와 X-비트의 사용자기기 ID(user equipment ID, UE ID)를 포함하는 입력 비트들을 입력한다. 상기 전송장치는 상기 폴라 코드를 이용하여 상기 입력 비트들을 인코딩한다. 상기 전송장치는 인코딩된 출력 시퀀스를 전송한다.
-
9.
公开(公告)号:WO2018118289A1
公开(公告)日:2018-06-28
申请号:PCT/US2017/062092
申请日:2017-11-16
Applicant: INTEL CORPORATION
Inventor: SASOGLU, Eren , NIKOPOUR, Hosein , ORHAN, Oner
CPC classification number: H03M13/13 , H03M13/1191
Abstract: Described is an apparatus comprising an interface to receive channel output; and a decoder to decode the channel output. The decoder may comprise a plurality of decoding paths, wherein a first decoding path and a second decoding path may comprise a common decoding segment.
-
公开(公告)号:WO2018049164A1
公开(公告)日:2018-03-15
申请号:PCT/US2017/050684
申请日:2017-09-08
Applicant: INTEL CORPORATION
Inventor: RAN, Adee O. , BENHAMOU, Assaf , LANDAU, Yoni , MEZER, Amir , LEVIN, Itamar , MEISLER, Alon
CPC classification number: H03M13/015 , H03M13/09 , H03M13/13 , H03M13/15 , H03M13/1515 , H03M13/353 , H04L1/203
Abstract: Computing devices and techniques for providing link partner health reporting are described. In one embodiment, for example, an apparatus may include at least one memory, and logic, at least a portion of the logic comprised in hardware coupled to the at least one memory, the logic to determine a plurality of error counters, each of the plurality of error counters associated with a number of errors, determine the number of errors for each data unit of a plurality of data units associated with a data block, increment each of the plurality of error counters corresponding with the number of errors for each data unit of the plurality of data units, provide a plurality of error counts for the data block to a link partner, the plurality of error counts corresponding to the number of errors accumulated in each of the plurality of error counters for the data block, and reset the plurality of error counters. Other embodiments are described and claimed.
Abstract translation: 描述了用于提供链接伙伴健康报告的计算设备和技术。 在一个实施例中,例如,装置可以包括至少一个存储器和逻辑,所述逻辑的至少一部分包括在耦合到所述至少一个存储器的硬件中,所述逻辑确定多个错误计数器,每个 与多个错误相关联的多个错误计数器确定与数据块相关联的多个数据单元中的每个数据单元的错误数量,将与每个数据单元的错误数量相对应的多个错误计数器中的每一个递增 将所述数据块的多个错误计数提供给链接伙伴,所述多个错误计数对应于在所述数据块的所述多个错误计数器中的每一个中累积的错误的数量,并且将所述多个错误计数器 多个错误计数器。 描述并要求保护其他实施例。 p>
-
-
-
-
-
-
-
-
-