[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN110535560A - A kind of polarization code combines coding and interpretation method - Google Patents

A kind of polarization code combines coding and interpretation method Download PDF

Info

Publication number
CN110535560A
CN110535560A CN201910716802.5A CN201910716802A CN110535560A CN 110535560 A CN110535560 A CN 110535560A CN 201910716802 A CN201910716802 A CN 201910716802A CN 110535560 A CN110535560 A CN 110535560A
Authority
CN
China
Prior art keywords
check
path
sequence
cyclic redundancy
coding
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.)
Pending
Application number
CN201910716802.5A
Other languages
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.)
Hangzhou Dianzi University
Hangzhou Electronic Science and Technology University
Original Assignee
Hangzhou Electronic Science and Technology University
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 Hangzhou Electronic Science and Technology University filed Critical Hangzhou Electronic Science and Technology University
Priority to CN201910716802.5A priority Critical patent/CN110535560A/en
Publication of CN110535560A publication Critical patent/CN110535560A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/13Linear codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0061Error detection codes
    • H04L1/0063Single parity check

Landscapes

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

Abstract

The invention discloses polarization codes to combine coding and interpretation method, and coding sets channel capacity the following steps are included: S11;S12 chooses channel, channel capacity is arranged from high to low;S13, information sequence comes foremost, then carries out even-odd check, check information sequence;S14 carries out cyclic redundancy check, obtains cyclic redundancy check as a result, for enhanced even-odd check result after information sequence, last is the check results of cyclic redundancy by information sequence preceding, is connected together as transmitting sequence;S15, after carrying out polarization code coding, the code word of generation is transmitted.The invention proposes the coding and decoding methods of the polarization code of enhanced parity check sum CRC auxiliary, and data are relatively reliable, and the bit error rate is low.

Description

A kind of polarization code combines coding and interpretation method
Technical field
The invention belongs to the communications field, it is related to a kind of polarization code and combines coding and interpretation method.
Background technique
Channel coding is mainly to add redundancy to the information of transmission, increases the anti-interference ability of information, improves information transmission Reliability.In message transmitting procedure, due to the interference by noise, it is low to cause information transmission reliability.Shannon was once explained Stated a theory: assuming that one has the channel of noise, channel capacity C, information is transmitted with speed R, as R < C It waits, then there are a kind of coding techniques, and the received mistake in receiving end to be made to reach any small numerical value, it would theoretically be possible to reach nothing Mistake transmission.
Polarization code is a kind of channel coding method that E.Arikan is proposed.Polarization code is theoretically proved to can achieve perfume (or spice) The agriculture limit, thus cause the concern and research of numerous scholars.Code length is longer, and the polarization phenomena of polarization code are better, but in code length In time-limited situation, there is the channel not by perfact polarization, the decoding performance of polarization code is lower than Turbo code and LDPC code.Pole The SC decoding accuracy rate for changing code is not good enough, and decoding delay is big, after there is scholar to propose serial to eliminate list (SCL) decoding and calculate Method, this method saves a plurality of possible path to reduce the probability that correct path is missed, to improve the accuracy of decoding.When When the width L of list is bigger, Block Error Rate will approach the Block Error Rate with maximum-likelihood decoding, but in computation complexity With very big difficulty is increased on space complexity.There is scholar to propose the interpretation method of cyclic redundancy check (CRC) auxiliary afterwards, The algorithm selects in path candidate can be by the coding sequence of CRC check as final sequence, if do not met all If, using the maximum sequence of likelihood probability as coding sequence.When using the SCL decoding algorithm of CRC auxiliary, it is compared to it The SCL method of preceding SC interpretation method and SCL interpretation method, CRC auxiliary reduces the bit error rate again.
It when carrying out CRC check, needs to generate generator matrix and check matrix, when code length is longer, need for depositing The space for storing up matrix is bigger,, will if auxiliary examination sequence can be simply obtained when generating auxiliary examination Reduce number and the time of operation, and the bit error rate also may remain in it is certain within the scope of.
Summary of the invention
It is calculated to solve the above problems, being decoded the present invention is based on the polarization code of the segmentation parity check sum CRC auxiliary of polarization code Method and traditional CRC auxiliary SCL decoding, propose the coding and decoding method of the polarization code of enhanced parity check sum CRC auxiliary, pass Transmission of data is reliable, and the bit error rate is low.
To achieve the above object, the technical scheme is that polarization code combination coding method, comprising the following steps:
S11 sets channel capacity, if the code length of polarization code is N, the check bit of code rate R, CRC auxiliary is C1, enhancing The digit of type even-odd check be C2, total information bit bit for K=k+C1+C2 wherein, k=NR;
S12 chooses channel, channel capacity is arranged from high to low, information of the K channels as transmission before choosing Position, remaining, which is used as, freezes position;
S13, information sequence comes foremost, then carries out even-odd check, check information sequence, by " 1 " in information sequence Number comes out, and the operation that rems, divisor 2 are carried out to itC2In maximum prime number, obtained remainder is converted to binary system, It places it in after information sequence;
S14 carries out cyclic redundancy check, obtains cyclic redundancy check as a result, by information sequence in preceding, enhanced odd even school Result is tested after information sequence, last is the check results of cyclic redundancy, is connected together as transmission sequence;
S15, after carrying out polarization code coding, the code word of generation is transmitted.
Preferably, the even-odd check is enhanced.
Based on above-mentioned purpose, the present invention also provides a kind of polarization code combination interpretation methods, comprising the following steps:
S21 carries out SCL decoding to sequence is received, and it is L_max item, current storing path that maximum storing path, which is arranged, It is 2 times originally by its Path extension and is less than or equal to L_ when not finding the coding sequence met in L paths for L item Max paths;
It after S22, SCL are decoded, is verified, is exported.
Preferably, the sequence exported in the S22 includes the following steps,
S31 exports the road when an only paths pass through cyclic redundancy check and enhanced even-odd check Diameter;
S32 exports likelihood in these paths when there is mulitpath by cyclic redundancy check and enhanced even-odd check One of maximum probability;
S33, if current path without simultaneously can be by the path of two kinds of methods of calibration when, by its Path extension be original First 2 times, and it is less than the maximum storing path L_max of setting, then carry out SCL decoding;
S34, when extensions path has had reached maximum value, still not over cyclic redundancy check in the path of preservation When with enhanced even-odd check, output is passed through by that path of cyclic redundancy check if any mulitpath, selects likelihood general The maximum output of rate;
S35 exports likelihood probability in these paths maximum one if nothing.
The present invention at least has the following beneficial effects:
1, it is decoded compared to SC, using the enhanced even-odd check+CRC check of SCL+, being compared to SCL+CRC verification can be with Obtain the better bit error rate.When receiving end receives coded sequence, SCL decoding is carried out, when storing path is bigger, correctly The probability of coding sequence in the paths is bigger.CRC+ enhanced even-odd check is used during verification, while meeting two kinds The decoding that the decoding of verification mode could become last can not find qualified code sequence as a result, working as in the path stored, then Extensions path is 2 times of current storing path, is then verified, if path has spread over maximum value, is not still had again Path meets the enhanced even-odd check of CRC+, then selection can be by the path of CRC auxiliary examination method, if may not be used in path To pass through the path of CRC auxiliary examination, then select the maximum path of likelihood probability as coding sequence;
2, the method for calibration for the enhanced even-odd check added is simple, counts the number of " 1 " in information bit in polarization code, will 1 number summation, and remainder is obtained divided by divisor for dividend, after remainder is placed on information bit, done when to decode Verification;Among these, divisor 2xIn maximum prime number, x is the digit of check code, such as: x 4, then divisor is maximum in 16 Prime number, then divisor be 13, coding when, be more readily available check bit, decoding when, the sequence in path is verified When, it is also easy to calculate.
Detailed description of the invention
Fig. 1 is the step flow chart of the polarization code combination coding method of the embodiment of the present invention;
Fig. 2 is the step flow chart of the polarization code combination interpretation method of the embodiment of the present invention;
Fig. 3 is the output flow chart of steps of the polarization code combination interpretation method of the embodiment of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and It is not used in the restriction present invention.
On the contrary, the present invention covers any substitution done on the essence and scope of the present invention being defined by the claims, repairs Change, equivalent method and scheme.Further, in order to make the public have a better understanding the present invention, below to of the invention thin It is detailed to describe some specific detail sections in section description.Part without these details for a person skilled in the art The present invention can also be understood completely in description.
It is the step flow chart of the polarization code combination coding method of the embodiment of the present invention referring to Fig. 1, comprising the following steps:
S11 sets channel capacity, if the code length of polarization code is N, the check bit of code rate R, CRC auxiliary is C1, enhancing The digit of type even-odd check be C2, total information bit bit for K=k+C1+C2 wherein, k=NR;
S12 chooses channel, channel capacity is arranged from high to low, information of the K channels as transmission before choosing Position, remaining, which is used as, freezes position;
S13, information sequence comes foremost, then carries out even-odd check, check information sequence, by " 1 " in information sequence Number comes out, and the operation that rems, divisor 2 are carried out to itC2In maximum prime number, obtained remainder is converted to binary system, It places it in after information sequence;
S14 carries out cyclic redundancy check, obtains cyclic redundancy check as a result, by information sequence in preceding, enhanced odd even school Result is tested after information sequence, last is the check results of cyclic redundancy, is connected together as transmission sequence;
S15, after carrying out polarization code coding, the code word of generation is transmitted.
Above-mentioned even-odd check is enhanced.
Based on above-mentioned purpose, the present invention also provides a kind of polarization code combination interpretation methods, comprising the following steps:
S21 carries out SCL decoding to sequence is received, and it is L_max item, current storing path that maximum storing path, which is arranged, It is 2 times originally by its Path extension and is less than or equal to L_ when not finding the coding sequence met in L paths for L item Max paths;
It after S22, SCL are decoded, is verified, is exported.
The sequence exported in S22 includes the following steps,
S31 exports the road when an only paths pass through cyclic redundancy check and enhanced even-odd check Diameter;
S32 exports likelihood in these paths when there is mulitpath by cyclic redundancy check and enhanced even-odd check One of maximum probability;
S33, if current path without simultaneously can be by the path of two kinds of methods of calibration when, by its Path extension be original First 2 times, and it is less than the maximum storing path L_max of setting, then carry out SCL decoding;
S34, when extensions path has had reached maximum value, still not over cyclic redundancy check in the path of preservation When with enhanced even-odd check, output is passed through by that path of cyclic redundancy check if any mulitpath, selects likelihood general The maximum output of rate;
S35 exports likelihood probability in these paths maximum one if nothing.
In specific embodiment, according to above-mentioned coding and decoding procedure, in S11, when the code length of polarization code is 1024 bits When, the information digit of transmission is 520, and effective information bit number is 508 bits, and the digit of cyclic redundancy check is 8, enhancing The digit of type even-odd check is 4, and code rate R is (520-8-4)/1024;It, first will letter when carrying out channel selection in S12 Road sorts (it is minimum to be ordered into channel capacity from channel capacity highest), the channel for selecting preceding 520 channels to transmit as information; In S13, information bit is first subjected to enhanced even-odd check, " 1 " in sequence is counted, and the behaviour that rems is carried out to it Make, divisor is maximum prime number 13 in 24, and obtained remainder is converted to after binary system is placed on information sequence, S14 is carried out The sequence that information bit and enhanced even-odd check are obtained carries out cyclic redundancy check, obtained check value is placed on enhanced After verification.When decoding, S21, maximum storing path is set as L=64 item, and current storing path is set as 8.Information Sequence is transmitted after coding, then the sequence after receiving end receives coding is decoded, when decoding current guarantor Depositing path is 8, and S22, SCL verify the path of preservation after decoding, S31-32, if passing through two kinds of verification sides simultaneously Rule is output it as coding sequence, S33, otherwise by 2 times that Path extension is current path, and is less than or equal to maximum save Path verifies again, if S34 has reached the maximum the number of path of storing path, and passes through two kinds of verification modes without path, then Select the output sequence that can be decoded by cyclic redundancy check and the maximum path of likelihood probability as this, S35, if looking for not To can be then defeated as this coding sequence using the maximum coding sequence of likelihood probability by the coding sequence of cyclic redundancy Out.
Still another embodiment, S11, after obtaining prime information sequence, according to the number of information sequence, number 508, The digit (8) of cyclic redundancy check and the digit (4) of enhanced even-odd check, the number for obtaining information needed position are 520;S12, when channel selection by calculating after the obtained size of channel capacity be ranked up and (arrange from high to low Sequence), preceding 520 channels are picked out and are transmitted as information bit, remaining channel is being encoded and translated as position transmission is freezed When code, freezes position and be defaulted as " 0 ";S13 first carries out enhanced even-odd check, counts to " 1 " in information sequence, And the operation that rems is carried out to it, divisor is maximum prime number 13 in 24, and obtained remainder is placed on after information bit;S14, Cyclic redundancy check is carried out to the sequence of information sequence and enhanced even-odd check, obtained check results insert enhanced odd even Verify subsequent position;Obtained information sequence is placed in information bit, is encoded by S15, the code word sequence obtained after coding Column are transmitted.Since there is interference in space, and this interference has uncertainty, with becoming larger for signal-to-noise ratio, error code Rate declines therewith.In decoding, S21 receives code word in receiving end, code word advance successive elimination list (SCL) side received Method is decoded, and it is 32 that its storing path, which is arranged,;S22, after decoding, by this 32 paths according to the size of likelihood probability Be ranked up, first by probability it is big come front, the last item is that probability is the smallest.Specifically, path probability is selected first Big path is verified, and then carries out the lesser path verification of likelihood probability again.When verification, CRC check is first carried out, if After the joint sequence of the information bit and cyclic redundancy check position that arrive is multiplied with check matrix, obtained result is 0, then it is by following The verification (retaining first sequence by cyclic redundancy check) of ring redundancy, then carries out testing for enhanced even-odd check again Card, if obtained volume result is not 0, carries out the verification in next path.Passing through cyclic redundancy check and then is being increased The number of " 1 " in the joint sequence of strong type even-odd check, statistical information position and cyclic redundancy check position, carries out complementation behaviour to it Make, divisor 24In maximum prime number 13, obtain remainder, by this remainder, obtained parity values compare after decoding, If meeting, the value that the output of this paths is decoded as this carries out the verification of next paths if not meeting.If All paths had all been verified, can all have been verified simultaneously by two kinds without a paths, then by Path extension It is 2 times of current path, and is less than or equal to maximum storing path, verifies again, carry out path again if without the path met Extension passes through two kinds of schools when reaching the number of path of maximum storing path, and without path until reaching maximum storing path value Proved recipe formula, then select the output sequence that can be decoded by cyclic redundancy check and the maximum path of likelihood probability as this Column, can be by the coding sequence of cyclic redundancy, using the maximum coding sequence of likelihood probability translating as this if can not find Code sequence output.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.

Claims (4)

1. a kind of polarization code combination coding method, which comprises the following steps:
S11 sets channel capacity, if the code length of polarization code is N, the check bit of code rate R, CRC auxiliary is C1, enhanced surprise The digit of even parity check be C2, total information bit bit for K=k+C1+C2 wherein, k=NR;
S12 chooses channel, channel capacity is arranged from high to low, information bit of the K channels as transmission before choosing, Remaining be used as freezes position;
S13, information sequence comes foremost, then carries out even-odd check, check information sequence, by the number of " 1 " in information sequence It comes out, the operation that rems, divisor 2 is carried out to itC2In maximum prime number, obtained remainder is converted to binary system, by it It is placed on after information sequence;
S14 carries out cyclic redundancy check, obtains cyclic redundancy check as a result, by information sequence in preceding, enhanced even-odd check knot For fruit after information sequence, last is the check results of cyclic redundancy, is connected together as transmission sequence;
S15, after carrying out polarization code coding, the code word of generation is transmitted.
2. coding method according to claim 1, which is characterized in that the even-odd check is enhanced.
3. a kind of polarization code combination interpretation method, which comprises the following steps:
S21 carries out SCL decoding to sequence is received, and it is L_max item that maximum storing path, which is arranged, and current storing path is L Its Path extension is 2 times originally and is less than or equal to L_max by item when not finding the coding sequence met in L paths Paths;
It after S22, SCL are decoded, is verified, is exported.
4. interpretation method according to claim 3, which is characterized in that the sequence exported in the S22 includes the following steps,
S31 exports the path when an only paths pass through cyclic redundancy check and enhanced even-odd check;
S32 exports likelihood probability in these paths when there is mulitpath by cyclic redundancy check and enhanced even-odd check Maximum one;
S33, if current path without simultaneously can be by the path of two kinds of methods of calibration when, be original by its Path extension 2 times, and it is less than the maximum storing path L_max of setting, then carry out SCL decoding;
S34, when extensions path has had reached maximum value, still not over cyclic redundancy check and increasing in the path of preservation When strong type even-odd check, output is passed through by that path of cyclic redundancy check if any mulitpath, selects likelihood probability most A big output;
S35 exports likelihood probability in these paths maximum one if nothing.
CN201910716802.5A 2019-08-05 2019-08-05 A kind of polarization code combines coding and interpretation method Pending CN110535560A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910716802.5A CN110535560A (en) 2019-08-05 2019-08-05 A kind of polarization code combines coding and interpretation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910716802.5A CN110535560A (en) 2019-08-05 2019-08-05 A kind of polarization code combines coding and interpretation method

Publications (1)

Publication Number Publication Date
CN110535560A true CN110535560A (en) 2019-12-03

Family

ID=68661475

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910716802.5A Pending CN110535560A (en) 2019-08-05 2019-08-05 A kind of polarization code combines coding and interpretation method

Country Status (1)

Country Link
CN (1) CN110535560A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113067584A (en) * 2021-03-23 2021-07-02 重庆邮电大学 Coding method for common auxiliary polarization code of CRC (Cyclic redundancy check) code and PC (personal computer) code
CN114448448A (en) * 2022-01-24 2022-05-06 电子科技大学 Polarization code encoding and decoding method based on CA-SCL
CN115037415A (en) * 2022-05-31 2022-09-09 江苏屹信航天科技有限公司 Error correction coding method, device and terminal based on CRC

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170230141A1 (en) * 2012-12-14 2017-08-10 Samsung Electronics Co., Ltd. Packet decoding method and apparatus
CN108462558A (en) * 2018-03-01 2018-08-28 西安电子科技大学 A kind of polarization code SCL interpretation methods, device and electronic equipment
CN108540140A (en) * 2017-03-01 2018-09-14 电信科学技术研究院 A kind of polarization code coding method and device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170230141A1 (en) * 2012-12-14 2017-08-10 Samsung Electronics Co., Ltd. Packet decoding method and apparatus
CN108540140A (en) * 2017-03-01 2018-09-14 电信科学技术研究院 A kind of polarization code coding method and device
CN108462558A (en) * 2018-03-01 2018-08-28 西安电子科技大学 A kind of polarization code SCL interpretation methods, device and electronic equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
沈周青等: "极化码的多比特译码算法研究", 《电信科学》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113067584A (en) * 2021-03-23 2021-07-02 重庆邮电大学 Coding method for common auxiliary polarization code of CRC (Cyclic redundancy check) code and PC (personal computer) code
CN114448448A (en) * 2022-01-24 2022-05-06 电子科技大学 Polarization code encoding and decoding method based on CA-SCL
CN114448448B (en) * 2022-01-24 2023-07-28 电子科技大学 CA-SCL-based polarization code encoding and decoding method
CN115037415A (en) * 2022-05-31 2022-09-09 江苏屹信航天科技有限公司 Error correction coding method, device and terminal based on CRC
CN115037415B (en) * 2022-05-31 2024-02-09 江苏屹信航天科技有限公司 CRC-based error correction coding method, CRC-based error correction coding device and CRC-based error correction coding terminal

Similar Documents

Publication Publication Date Title
Condo et al. Improved successive cancellation flip decoding of polar codes based on error distribution
US10348336B2 (en) System and method for early termination of decoding in a multi user equipment environment
CN105227189B (en) It is segmented the polarization code coding/decoding method of CRC auxiliary
CN108712231B (en) A kind of method, apparatus and system of coding and decoding
CN108462558B (en) Method and device for decoding polarization code SCL and electronic equipment
JP3451221B2 (en) Error correction coding apparatus, method and medium, and error correction code decoding apparatus, method and medium
EP3562071B1 (en) Polar code encoding and decoding method and device
EP3364542A1 (en) Error correction coding method based on cascading of polar codes and repetition codes or multi-bit parity check codes
CN101867379B (en) Cyclic redundancy check-assisted convolutional code decoding method
CN106209113A (en) A kind of decoding method of polarization code
WO2018153263A1 (en) A method to generate ordered sequence for polar codes
CN104025459A (en) Decoding processing method and decoder
CN107231158B (en) Polarization code iterative receiver, system and polarization code iterative decoding method
CN108540141A (en) Polar code coding/decoding methods and device
CN110535560A (en) A kind of polarization code combines coding and interpretation method
CN110233698B (en) Method for encoding and decoding polarization code, transmitting device, receiving device, and medium
CN107659318B (en) Self-adaptive polar code decoding method
CN110233628A (en) The adaptive belief propagation list decoding method of polarization code
Jamali et al. Low-complexity decoding of a class of Reed-Muller subcodes for low-capacity channels
US8156412B2 (en) Tree decoding method for decoding linear block codes
Kobozeva et al. Investigation of signal-code structures based on 3D error-locating codes
CN108833057B (en) Distributed CRC processing method based on 3GPP 5G-NR polarization code
VUCETIC et al. Low complexity soft decision decoding algorithms for reed-solomon codes
CN110061815A (en) A kind of polarization code coding method using partition strategy
EP2228935A1 (en) MIMO communication method and devices

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20191203

WD01 Invention patent application deemed withdrawn after publication