Re: which algorithm is good choice for forward error correction.# EE - 电子工程
t*t
1 楼
in terms of complexity, LDPC codes are cheaper. (decoding)
Typically the iterations can be done in less than 20 loops.
Because the "low-density" nature, each iteration is not expensive.
For encoding, it WAS expensive; but recently there's a paper
by Kou, Lin and Fossorier (GLOBECOM'00), they construct codes based
on Finite Geometries. The codes constructed this way are cyclic or
quasi-cyclic, which means it can be encoded by very simple hardware.
I think it's cheaper than turbo code because it d
Typically the iterations can be done in less than 20 loops.
Because the "low-density" nature, each iteration is not expensive.
For encoding, it WAS expensive; but recently there's a paper
by Kou, Lin and Fossorier (GLOBECOM'00), they construct codes based
on Finite Geometries. The codes constructed this way are cyclic or
quasi-cyclic, which means it can be encoded by very simple hardware.
I think it's cheaper than turbo code because it d