Polar Codes

A Non-Trivial Approach to Channel Coding

Nonfiction, Computers, Advanced Computing, Theory, Science & Nature, Technology, Telecommunications
Cover of the book Polar Codes by Orhan Gazi, Springer Singapore
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Orhan Gazi ISBN: 9789811307379
Publisher: Springer Singapore Publication: June 8, 2018
Imprint: Springer Language: English
Author: Orhan Gazi
ISBN: 9789811307379
Publisher: Springer Singapore
Publication: June 8, 2018
Imprint: Springer
Language: English

This book explains the philosophy of the polar encoding and decoding technique. Polar codes are one of the most recently discovered capacity-achieving channel codes. What sets them apart from other channel codes is the fact that polar codes are designed mathematically and their performance is mathematically proven.

The book develops related fundamental concepts from information theory, such as entropy, mutual information, and channel capacity. It then explains the successive cancellation decoding logic and provides the necessary formulas, moving on to demonstrate the successive cancellation decoding operation with a tree structure. It also demonstrates the calculation of split channel capacities when polar codes are employed for binary erasure channels, and explains the mathematical formulation of successive cancellation decoding for polar codes. In closing, the book presents and proves the channel polarization theorem, before mathematically analyzing the performance of polar codes.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

This book explains the philosophy of the polar encoding and decoding technique. Polar codes are one of the most recently discovered capacity-achieving channel codes. What sets them apart from other channel codes is the fact that polar codes are designed mathematically and their performance is mathematically proven.

The book develops related fundamental concepts from information theory, such as entropy, mutual information, and channel capacity. It then explains the successive cancellation decoding logic and provides the necessary formulas, moving on to demonstrate the successive cancellation decoding operation with a tree structure. It also demonstrates the calculation of split channel capacities when polar codes are employed for binary erasure channels, and explains the mathematical formulation of successive cancellation decoding for polar codes. In closing, the book presents and proves the channel polarization theorem, before mathematically analyzing the performance of polar codes.

More books from Springer Singapore

Cover of the book Single Frequency Semiconductor Lasers by Orhan Gazi
Cover of the book Universal Fuzzy Controllers for Non-affine Nonlinear Systems by Orhan Gazi
Cover of the book Protein Reviews by Orhan Gazi
Cover of the book International Human Resource Management in South Korean Multinational Enterprises by Orhan Gazi
Cover of the book Advanced Technologies in Modern Robotic Applications by Orhan Gazi
Cover of the book Proceeding of International Conference on Intelligent Communication, Control and Devices by Orhan Gazi
Cover of the book Mathematical Insights into Advanced Computer Graphics Techniques by Orhan Gazi
Cover of the book Study of Double Parton Scattering in Photon + 3 Jets Final State by Orhan Gazi
Cover of the book Mathematics and Transition to School by Orhan Gazi
Cover of the book Signal and Information Processing, Networking and Computers by Orhan Gazi
Cover of the book Advances in Cognitive Neurodynamics (V) by Orhan Gazi
Cover of the book Thermal Elastic Mechanics Problems of Concrete Rectangular Thin Plate by Orhan Gazi
Cover of the book The Fair-Line and the Good Frontage by Orhan Gazi
Cover of the book The Hair Fibre: Proteins, Structure and Development by Orhan Gazi
Cover of the book RUNX Proteins in Development and Cancer by Orhan Gazi
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy