Abstract
In this paper, we analyze the performance of irregular low-density parity-check (LDPC) codes with three belief propagation (BP) based decoding algorithms, namely the uniformly most powerful (UMP) BP-based algorithm, the normalized BP-based algorithm, and the offset BP-based algorithm on a fast Rayleigh fading channel by using density evolution (DE). We also optimize the code construction of the irregular LDPC codes with three BP-based algorithms, and determine optimum parameters for the normalized BP-based algorithm and the offset BP-based algorithm on the fast Rayleigh fading channel. From the numerical results, we show that the performance of the irregular LDPC codes with offset BP-based algorithm can be very close to that with BP algorithm on the fast Rayleigh fading channel. We also show that the irregular LDPC codes with offset BP-based algorithm can achieve very good trade-off between the performance and decoding complexity.
| Original language | English |
|---|---|
| Title of host publication | IEEE Vehicular Technology Conference |
| Pages | 2530-2534 |
| Number of pages | 5 |
| Volume | 60 |
| Edition | 4 |
| Publication status | Published - 2004 |
| Externally published | Yes |
| Event | 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, United States Duration: 2004 Sep 26 → 2004 Sep 29 |
Other
| Other | 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security |
|---|---|
| Country | United States |
| City | Los Angeles, CA |
| Period | 04/9/26 → 04/9/29 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Performance analysis of BP-based algorithms for irregular low-density parity-check codes on fast rayleigh fading channel. / Ohhashi, Akinori; Ohtsuki, Tomoaki.
IEEE Vehicular Technology Conference. Vol. 60 4. ed. 2004. p. 2530-2534.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Performance analysis of BP-based algorithms for irregular low-density parity-check codes on fast rayleigh fading channel
AU - Ohhashi, Akinori
AU - Ohtsuki, Tomoaki
PY - 2004
Y1 - 2004
N2 - In this paper, we analyze the performance of irregular low-density parity-check (LDPC) codes with three belief propagation (BP) based decoding algorithms, namely the uniformly most powerful (UMP) BP-based algorithm, the normalized BP-based algorithm, and the offset BP-based algorithm on a fast Rayleigh fading channel by using density evolution (DE). We also optimize the code construction of the irregular LDPC codes with three BP-based algorithms, and determine optimum parameters for the normalized BP-based algorithm and the offset BP-based algorithm on the fast Rayleigh fading channel. From the numerical results, we show that the performance of the irregular LDPC codes with offset BP-based algorithm can be very close to that with BP algorithm on the fast Rayleigh fading channel. We also show that the irregular LDPC codes with offset BP-based algorithm can achieve very good trade-off between the performance and decoding complexity.
AB - In this paper, we analyze the performance of irregular low-density parity-check (LDPC) codes with three belief propagation (BP) based decoding algorithms, namely the uniformly most powerful (UMP) BP-based algorithm, the normalized BP-based algorithm, and the offset BP-based algorithm on a fast Rayleigh fading channel by using density evolution (DE). We also optimize the code construction of the irregular LDPC codes with three BP-based algorithms, and determine optimum parameters for the normalized BP-based algorithm and the offset BP-based algorithm on the fast Rayleigh fading channel. From the numerical results, we show that the performance of the irregular LDPC codes with offset BP-based algorithm can be very close to that with BP algorithm on the fast Rayleigh fading channel. We also show that the irregular LDPC codes with offset BP-based algorithm can achieve very good trade-off between the performance and decoding complexity.
UR - http://www.scopus.com/inward/record.url?scp=17144414111&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=17144414111&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:17144414111
VL - 60
SP - 2530
EP - 2534
BT - IEEE Vehicular Technology Conference
ER -