Abstract

The implementation of channel coding techniques has the potential to yield coding gains, augment the capacity of the communication system, and significantly enhance the performance of the communication system. The quest for a code possessing a channel capacity surpassing the Shannon limit has been a longstanding pursuit among researchers. The utilization of Polar codes, a coding technique proposed by E. Arikan in 2007, was initially implemented. Theoretical demonstrations have shown that the Shannon limit can be achieved for binary, discrete, memoryless channels through the utilization of a code with a straightforward algorithm. This has resulted in notable progress within the realm of channel coding. As a new coding technology, polar codes have attracted extensive attention in the wireless communication field and become one of the most attractive research hotspots in the coding field. This paper systematically expounds polar codes, analyzes the coding and decoding principles of polar codes, and compares them with Turbo codes and LDPC codes. In this study, polar code coding and decoding are simulated and implemented, and the impact of coding block length, coding rate, and iteration time variations on the performance of polar codes is explored. Through simulation and comparison, the performance, benefits, and drawbacks of these three codes are compared with the polar codes, turbo codes, and LDPC codes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call