Abstract
In 2006, Arikan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel (B-DMC). In this letter, we will give a description of the main ideas and mechanisms of this kind of codes. The codes construction, decoding algorithm as well as the probability of block error under successive cancellation (SC) decoding are also discussed.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of International Conference on ASIC |
| Pages | 804-807 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 2011 IEEE 9th International Conference on ASIC, ASICON 2011 - Xiamen Duration: 2011 Oct 25 → 2011 Oct 28 |
Other
| Other | 2011 IEEE 9th International Conference on ASIC, ASICON 2011 |
|---|---|
| City | Xiamen |
| Period | 11/10/25 → 11/10/28 |
Fingerprint
Keywords
- channel coding
- channel polarization
- polar codes
- successive cancellation decoding
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering
Cite this
A study on channel polarization and polar coding. / Lu, Yichao; Goto, Satoshi.
Proceedings of International Conference on ASIC. 2011. p. 804-807 6157327.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A study on channel polarization and polar coding
AU - Lu, Yichao
AU - Goto, Satoshi
PY - 2011
Y1 - 2011
N2 - In 2006, Arikan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel (B-DMC). In this letter, we will give a description of the main ideas and mechanisms of this kind of codes. The codes construction, decoding algorithm as well as the probability of block error under successive cancellation (SC) decoding are also discussed.
AB - In 2006, Arikan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel (B-DMC). In this letter, we will give a description of the main ideas and mechanisms of this kind of codes. The codes construction, decoding algorithm as well as the probability of block error under successive cancellation (SC) decoding are also discussed.
KW - channel coding
KW - channel polarization
KW - polar codes
KW - successive cancellation decoding
UR - http://www.scopus.com/inward/record.url?scp=84860858226&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860858226&partnerID=8YFLogxK
U2 - 10.1109/ASICON.2011.6157327
DO - 10.1109/ASICON.2011.6157327
M3 - Conference contribution
AN - SCOPUS:84860858226
SN - 9781612841908
SP - 804
EP - 807
BT - Proceedings of International Conference on ASIC
ER -