binary erasure channels
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 1)

H-INDEX

7
(FIVE YEARS 0)

2020 ◽  
Author(s):  
Mohammed Usman

Polar codes have been shown to approach capacity of symmetric binary erasure channels and also have low encoding and decoding complexity. Wireless channels are bursty in nature and a method to apply polar codes over wireless channels is proposed. This paper investigates the performance of polar codes over typical urban fading wireless channels. The wireless channel is modeled as a degraded erasure channel by using an inner convolution code and interleaving. When the convolution code fails to correct any errors, the corresponding bits are discarded and treated as erasures. We present the performance of polar codes over such degraded wireless channels using different code rates for the inner convolution code


Author(s):  
Rahul Devassy ◽  
Giuseppe Durisi ◽  
Benjamin Lindqvist ◽  
Wei Yang ◽  
Marco Dalai

Author(s):  
Christian Hager ◽  
Alexandre Graell i Amat ◽  
Alex Alvarado ◽  
Fredrik Brannstrom ◽  
Erik Agrell

Sign in / Sign up

Export Citation Format

Share Document