Devices and methods implementing polar codes
US-2019081731-A1 · Mar 14, 2019 · US
US11005596B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11005596-B2 |
| Application number | US-201816641205-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 22, 2018 |
| Priority date | Aug 23, 2017 |
| Publication date | May 11, 2021 |
| Grant date | May 11, 2021 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The present disclosure relates to a pre-5t-Generation (5G) or 5G communication system to be provided for supporting higher data rates Beyond 4th-Generation (4G) communication system such as Long Term Evolution (LTE). A method for operating a transmitting stage in a wireless communication system includes generating a signal by encoding an input bit sequence according to polar code determined from a linear code, and transmitting the signal to a receiving stage. The input bit sequence includes a second frozen bit which is determined based on a first frozen bit and an information bit. The first frozen bit and the information bit precede the second frozen bit in the input bit sequence.
Opening claim text (preview).
What is claimed is: 1. An apparatus of a transmitting stage in a wireless communication system, comprising: at least one transceiver; and at least one processor functionally coupled to the at least one transceiver, wherein the at least one processor is configured to: generate a signal by encoding an input bit sequence according to a polar code determined from a linear code, and transmit the signal to a receiving stage, wherein the input bit sequence comprises a second frozen bit which is determined based on a first frozen bit and an information bit, and the first frozen bit and the information bit precede the second frozen bit in the input bit sequence. 2. The apparatus of claim 1 , wherein the linear code is determined based on a list size of successive cancellation list (SCL) decoding and a length of the polar code. 3. The apparatus of claim 2 , wherein the SCL decoding list size and the polar code length are used to determine a coding rate of the linear code, and the coding rate of the linear code is used to determine a length of an information bit of the linear code. 4. The apparatus of claim 1 , wherein the input bit sequence comprises an input bit sequence of the linear code, where some of information bits are changed to static frozen bits. 5. The apparatus of claim 4 , wherein some of the information bits are determined based on an error probability of the information bits. 6. The apparatus of claim 4 , wherein some of the information bits and some of the static frozen bits are determined as a candidate group to determine a first dynamic frozen bit and a second dynamic frozen bit. 7. The apparatus of claim 6 , wherein the first dynamic frozen bit and the second dynamic frozen bit are two bits of the lowest error probability for a bit-channel among bits of the candidate group. 8. The apparatus of claim 6 , wherein a value of the first dynamic frozen bit is determined based on a value of at least one information bit of a first information bit group of the candidate group, and a value of the second dynamic frozen bit is determined based on a value of at least one information bit of a second information bit group of the candidate group. 9. The apparatus of claim 6 , wherein a value of the second dynamic frozen bit is determined based on a value of the first dynamic frozen bit and values of information bits of a first information bit group in the candidate group, and a value of a third dynamic frozen bit is determined based on a value of the second dynamic frozen bit and values of information bits of a second information bit group in the candidate group. 10. The apparatus of claim 9 , wherein the number of the information bits in the first information bit group is equal to the number of the information bits in the second information bit group. 11. A method for operating a transmitting stage in a wireless communication system, comprising: generating a signal by encoding an input bit sequence according to a polar code determined from a linear code; and transmitting the signal to a receiving stage, wherein the input bit sequence comprises a second frozen bit which is determined based on a first frozen bit and an information bit, and the first frozen bit and the information bit precede the second frozen bit in the input bit sequence. 12. The method of claim 11 , wherein the linear code is determined based on a list size of successive cancellation list (SU) decoding and a length of the polar code. 13. The method of claim 12 , wherein the SCI, decoding list size and the polar code length are used to determine a coding rate of the linear code, and the coding rate of the linear code is used to determine a length of an information bit of the linear code. 14. The method of claim 11 , wherein the input bit sequence comprises an input bit sequence of the linear code, where some of information bits are changed to static frozen bits. 15. The method of claim 14 , wherein some of the information bits are determined based on an error probability of the information bits. 16. The method of claim 14 , wherein some of the information bits and some of the static frozen bits are determined as a candidate group to determine a first dynamic frozen bit and a second dynamic frozen bit. 17. The method of claim 16 , wherein the first dynamic frozen bit and the second dynamic frozen bit are two bits of the lowest error probability for a bit-channel among bits of the candidate group. 18. The method of claim 16 , wherein a value of the first dynamic frozen bit is determined based on a value of at least one information bit of a first information bit group of the candidate group, and a value of the second dynamic frozen bit is determined based on a value of at least one information bit of a second information bit group of the candidate group. 19. The method of claim 16 , wherein a value of the second dynamic frozen bit is determined based on a value of the first dynamic frozen bit and values of information bits of a first information bit group in the candidate group, and a value of a third dynamic frozen bit is determined based on a value of the second dynamic frozen bit and values of information bits of a second information bit group in the candidate group. 20. The method of claim 19 , wherein the number of the information bits in the first information bit group is equal to the number of the information bits in the second information bit group.
combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes · CPC title
Linear codes · CPC title
Arrangements at the transmitter end · CPC title
Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit · CPC title
Error detection codes · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.