WO2016172937A1 - Procédé et dispositif pour transmettre des données par utilisation de multiples codes polaires - Google Patents

Procédé et dispositif pour transmettre des données par utilisation de multiples codes polaires Download PDF

Info

Publication number
WO2016172937A1
WO2016172937A1 PCT/CN2015/078022 CN2015078022W WO2016172937A1 WO 2016172937 A1 WO2016172937 A1 WO 2016172937A1 CN 2015078022 W CN2015078022 W CN 2015078022W WO 2016172937 A1 WO2016172937 A1 WO 2016172937A1
Authority
WO
WIPO (PCT)
Prior art keywords
channels
letters
distance
merging
combined
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2015/078022
Other languages
English (en)
Chinese (zh)
Inventor
塔尔⋅爱德
瓦迪⋅亚历山大
沈晖
李斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to PCT/CN2015/078022 priority Critical patent/WO2016172937A1/fr
Priority to CN201580078059.5A priority patent/CN107431559B/zh
Publication of WO2016172937A1 publication Critical patent/WO2016172937A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
    • H03M13/251—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with block coding

Definitions

  • the present invention relates to the field of communications, and more particularly to a method and apparatus for data transmission using multi-polarization codes.
  • Polar code is a linear block code whose encoding process is:
  • B N is a transposed matrix, such as a bit reversal matrix
  • Polar code can be expressed as a coset code
  • K is the number of information bits
  • the encoding process is:
  • A is a set of information bits index
  • the sub-G N (A) to G N rows by a set A corresponding to the index consisting of a matrix
  • G N (A C) to G N by the set A C of a submatrix composed of rows corresponding to the index
  • It is a fixed bit (English: frozen bit) and its number is (NK).
  • the fixed bits can all be set to zero for simplicity.
  • SC decoder 1 first calculates the log likelihood ratio of u 1 among them, Then based on the sign decision of the value, the estimate of u 1 is obtained. 2) According to what has been obtained Calculate the log likelihood ratio of u 2 Then based on the sign decision of the value, the estimate of u 2 is obtained. 3) This translates u 3 , u 4 , ..., u N one by one. In the decision process, if the bit is a fixed bit, the bit is judged to be 0. Among them, if Then make a judgment as follows:
  • the Polar code pair Processing one by one the complexity of SC decoding is O(N log 2 N), and the complexity of List decoding is O(L*N*log 2 N).
  • the combination of the Polar code of the multi-layer code and the high-order modulation has a loss of information in the high-order modulation and demodulation. Finally, the entire scheme has a certain information loss, so the performance of the relatively optimal scheme must have a certain loss.
  • the embodiment of the invention provides a method for data transmission by using a multi-polarization code, which can realize controllable number of channels of multi-polarization codes under high-order modulation, thereby controlling the complexity of coding in data transmission, due to use
  • the multi-polarization code can reduce the loss of information in high-order modulation and demodulation.
  • an embodiment of the present invention provides a method for data transmission by using a multi-polarization code, including:
  • the plurality of channels are combined according to a posteriori probability distance between two letters of the plurality of channels.
  • the posterior probability distance is obtained according to the following method:
  • the greedy combining and combining the multiple channels of the multi-polarized basic unit includes:
  • the plurality of channels are combined according to a merge distance between two letters of the plurality of channels.
  • an embodiment of the present invention provides an apparatus for performing data transmission by using a multi-polarization code, including:
  • the pre-merging unit is configured to pre-merge multiple channels of the multi-polarized basic unit;
  • the greedy combining unit is configured to perform greedy combining on multiple channels of the multi-polarized basic unit.
  • the pre-merging unit is configured to:
  • the channels corresponding to the two letters are combined, and the channel transition probabilities corresponding to the combined two letters are added.
  • the plurality of channels are combined according to a merge distance between two letters of the plurality of channels.
  • the pre-merged channels corresponding to the two letters are combined, and so on, until the size of the output alphabet is less than or equal to the preset reliability.
  • the parameter where the initial value of the optimal threshold is 0, followed by the merge distance between the two letters with the smallest merge distance.
  • 16QAM input letters are as follows:
  • the merging in the embodiment of the present invention is for a plurality of channels, where the plurality of channels herein refers to the channel of the input alphabet having the size of q and the output of the channel of the alphabet of the M size.
  • the table size is M, and there are possible values in M, so that a variety of different channels can be formed. These channels can be pre-merged or greedy combined to reduce complexity.
  • the posterior probability distance between two letters is defined as follows:
  • combining y 1 and y 2 can be implemented by the following process:
  • the value of M is decremented by 1, that is, as long as the merge operation is performed, the value of M is correspondingly decremented by 1, that is, the size of the output alphabet is one less than the size before the merge.
  • Multiple channels are combined according to the merge distance between the two letters. That is, first, look for the two letters with the smallest merge distance; when the merge distance between the two letters is less than the optimal threshold, combine the multiple channels corresponding to the two letters, and so on. Until the size of the output alphabet is less than or equal to the preset reliability parameter; wherein the optimal threshold is the merge distance between the two letters with the smallest merge distance, the initial value can be set to 1. That is, the smaller the merge distance, the better the merge is until the size of the output alphabet reaches the given parameter.
  • Algorithm 4 is used to define the steps of the greedy merge phase. This step is to greedily merge according to the merge distance, that is, the smaller the merge distance, the priority is merged until the size of the output alphabet reaches the given parameter.
  • the steps of the specific combination are the same as those in step 601a.
  • one possible implementation of Algorithm 4 is as follows:
  • the foregoing construction method is mainly designed for the basic unit of the Polar code, and the entire Polar code can be implemented according to the basic unit, which can be obtained according to the prior art, and details are not described herein again.
  • FIG. 6 is a method for data transmission by using a multi-polarization code according to an embodiment of the present invention. As shown in FIG. 6, the method includes:
  • using the K channels to transmit the information bits with the smallest upper limit of the error probability in the combined multiple channels may specifically include: calculating an error probability of each symbol channel by using an upper limit of the error probability of the combined multiple channels;
  • the K symbol channels with the smallest error probability (or the upper limit of the error probability) transmit information bits.
  • the method provided by the embodiment of the present invention finally obtains a symbol channel, which is different from the prior art binary bit channel; the transmission information bit also modulates the bit into symbols or converts into symbols, and then determines the K channels (symbols). Channel) transmission, it is further understood that the channel (symbol channel) indicated in the K channels at this time is different from the channel indicated by the combined channels.
  • the step 604 may be: transmitting data by using the K channels with the smallest upper limit of the error probability in the symbol channels corresponding to the combined multiple channels.
  • the merging of the multiple channels of the basic unit of the multi-polarization code includes the pre-merging or the greedy merging.
  • the specific implementation process is the same as the method provided above, and details are not described herein again.
  • a merging unit 701 configured to combine multiple channels of a basic unit of a multi-polarization code, wherein a size of an alphabet of the plurality of channels is greater than 2;
  • the transmitting unit 704 is configured to use the K channel transmission information bits with the smallest upper limit of the error probability among the combined channels obtained by the processing unit 703.
  • the bus 804 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus. Etc., here is not limited.
  • the bus 804 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 8, but it does not mean that there is only one bus or one type of bus. among them:
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé pour transmettre des données par utilisation de multiples codes polaires, le procédé consistant : à combiner une pluralité de canaux d'unités de base des multiples codes polaires ; à mettre à jour une probabilité de transition de la pluralité de canaux combinés ; à acquérir, selon la probabilité de transition, une limite supérieure d'une probabilité d'erreur de la pluralité de canaux combinés ; et à transmettre des bits d'informations par utilisation de K canaux ayant une limite supérieure minimale de la probabilité d'erreur dans la pluralité de canaux combinés. Le nombre de canaux des multiples codes polaires ayant une modulation d'ordre élevé devient apte à être commandé en raison de la combinaison, ce qui permet de commander une complexité de codage dans un processus de transmission de données. L'utilisation de multiples codes polaires peut réduire les pertes d'informations se produisant lorsqu'une modulation d'ordre élevé est démodulée.
PCT/CN2015/078022 2015-04-30 2015-04-30 Procédé et dispositif pour transmettre des données par utilisation de multiples codes polaires Ceased WO2016172937A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2015/078022 WO2016172937A1 (fr) 2015-04-30 2015-04-30 Procédé et dispositif pour transmettre des données par utilisation de multiples codes polaires
CN201580078059.5A CN107431559B (zh) 2015-04-30 2015-04-30 一种利用多元极化码进行数据传输的方法、装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/078022 WO2016172937A1 (fr) 2015-04-30 2015-04-30 Procédé et dispositif pour transmettre des données par utilisation de multiples codes polaires

Publications (1)

Publication Number Publication Date
WO2016172937A1 true WO2016172937A1 (fr) 2016-11-03

Family

ID=57198033

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/078022 Ceased WO2016172937A1 (fr) 2015-04-30 2015-04-30 Procédé et dispositif pour transmettre des données par utilisation de multiples codes polaires

Country Status (2)

Country Link
CN (1) CN107431559B (fr)
WO (1) WO2016172937A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108540259A (zh) * 2017-03-01 2018-09-14 电信科学技术研究院 一种极化码编译码方法及装置
WO2018177258A1 (fr) * 2017-03-29 2018-10-04 华为技术有限公司 Procédé et dispositif de traitement d'informations d'identification
CN110168975A (zh) * 2016-12-29 2019-08-23 高通股份有限公司 使用密度演化的用于极化码构造的嵌套结构

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023618A (zh) * 2013-01-11 2013-04-03 北京邮电大学 一种任意码长的极化编码方法
CN103684477A (zh) * 2012-09-24 2014-03-26 华为技术有限公司 混合极性码的生成方法和生成装置
US20140208183A1 (en) * 2013-01-23 2014-07-24 Samsung Electronics Co., Ltd. Method and system for encoding and decoding data using concatenated polar codes

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8742957B2 (en) * 2010-12-15 2014-06-03 Analog Bits, Inc. Multi-variable multi-wire interconnect
CN102164025B (zh) * 2011-04-15 2013-06-05 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
CN102122966B (zh) * 2011-04-15 2012-11-14 北京邮电大学 基于信道极化的交错结构重复码的编码器及其编译码方法
CN103281166B (zh) * 2013-05-15 2016-05-25 北京邮电大学 一种基于极化码的混合自动重传请求传输方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103684477A (zh) * 2012-09-24 2014-03-26 华为技术有限公司 混合极性码的生成方法和生成装置
CN103023618A (zh) * 2013-01-11 2013-04-03 北京邮电大学 一种任意码长的极化编码方法
US20140208183A1 (en) * 2013-01-23 2014-07-24 Samsung Electronics Co., Ltd. Method and system for encoding and decoding data using concatenated polar codes

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110168975A (zh) * 2016-12-29 2019-08-23 高通股份有限公司 使用密度演化的用于极化码构造的嵌套结构
CN110168975B (zh) * 2016-12-29 2022-06-17 高通股份有限公司 使用密度演化的用于极化码构造的嵌套结构
US11394491B2 (en) 2016-12-29 2022-07-19 Qualcomm Incorporated Nested structure for polar code construction using density evolution
CN108540259A (zh) * 2017-03-01 2018-09-14 电信科学技术研究院 一种极化码编译码方法及装置
CN108540259B (zh) * 2017-03-01 2020-07-10 电信科学技术研究院 一种极化码编译码方法及装置
US10805045B2 (en) 2017-03-01 2020-10-13 China Academy Of Telecommunications Technology Polar code encoding method and device and polar code decoding method and device
WO2018177258A1 (fr) * 2017-03-29 2018-10-04 华为技术有限公司 Procédé et dispositif de traitement d'informations d'identification

Also Published As

Publication number Publication date
CN107431559A (zh) 2017-12-01
CN107431559B (zh) 2020-01-31

Similar Documents

Publication Publication Date Title
JP7026763B2 (ja) レートマッチング方法、符号化装置、および通信装置
CN109196781B (zh) 使用极化码时的分段码率匹配系统和方法
JP6731115B2 (ja) 情報送信方法、送信端デバイス及び受信端デバイス
CN106416083B (zh) 一种打孔的极化码的构造方法和装置
CN109314600B (zh) 用于在使用通用极化码时进行速率匹配的系统和方法
CN109039344B (zh) 编码输入数据为极性码的方法及设备、解码方法及其设备
US12463664B2 (en) Polar code rate matching method and apparatus for satellite communication and terrestrial communication
WO2013152605A1 (fr) Procédé de décodage et dispositif de décodage de code polaire
CN108809482B (zh) Polar码的速率匹配方法及装置
CN106899311A (zh) 混合极性码的生成方法和生成装置
US12483274B2 (en) Polar code encoding and rate-matched sequence outputting method and apparatus
US11239945B2 (en) Encoding method, decoding method, apparatus, and device
CN110391874B (zh) 极化码的速率匹配、解速率匹配方法及设备
CN111771336B (zh) 生成极化码的设备和方法
CN107431559B (zh) 一种利用多元极化码进行数据传输的方法、装置
CN111130564B (zh) 译码方法及装置
EP3987665A1 (fr) Fenêtre glissante et codage et décodage par sous-blocs de codes polaires
WO2021151463A1 (fr) Dispositif et procédé de codage ou de décodage de messages au moyen d'un code polaire
WO2024192763A1 (fr) Procédés, systèmes et appareil de décodage non séquentiel de codes polaires

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15890317

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15890317

Country of ref document: EP

Kind code of ref document: A1