.png){kind=icon}
Return
Shuffled iterative decoding
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2004.841982.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations has to remain small.
Keywords:
belief propagation (BP)
iterative decoding
low-density parity-check (LDPC) codes
scheduling
turbo codes
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave no more
no more