Polar codes with higher-order memory

Publication date 10 December 2019

Abstract: We introduce the design of a set of code sequences

{m a t h s c r C}_{n}^{(m)} : n g e q 1, m g e q 1

, with memory order

m

and code-length

N = O (p h i^{n})

, where

p h i i n (1, 2]

is the largest real root of the polynomial equation

F (m, h o) = h o^{m} - h o^{m - 1} - 1

and

p h i

is decreasing in

m

.

{m a t h s c r C}_{n}^{(m)}

is based on the channel polarization idea, where

{m a t h s c r C}_{n}^{(1)}

coincides with the polar codes presented by Ari kan and can be encoded and decoded with complexity

O (N l o g N)

.

{m a t h s c r C}_{n}^{(m)}

achieves the symmetric capacity,

I (W)

, of an arbitrary binary-input, discrete-output memoryless channel,

W

, for any fixed

m

and its encoding and decoding complexities decrease with growing

m

. We obtain an achievable bound on the probability of block-decoding error,

P_{e}

, of

{m a t h s c r C}_{n}^{(m)}

and showed that

is achievable for

.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Polar codes with higher-order memory