An
Optimal Two-Stage Decoding Algorithm for Linear Block Codes
Speaker: Xianren Wu
Time: Thursday 1:
Place: EERC 226
Abstract:
A
new
optimal two stage decoding algorithm for linear block codes is
presented. At first stage, the minimum sufficient test set S is estimated. With the minimum
sufficient test set, decoding complexity can be greatly reduced while
maintaining the optimal performance. At the second stage, ordered
processing is performed over the estimated minimum sufficient test set S to find the optimal solution.
Ordered processing helps to find the optimal solution quickly and in
the meanwhile enables complexity-reduced sub-optimal solution with
bounded block error rate. Simulation result shows that this algorithm
achieves the optimal performance with low average computational
complexity.
References:
X. Wu, ``An Optimal Two-Stage Decoding Algorithm for Linear Block Codes, Proc. Asilomar Conference on Signals, Systems, and Computers, Nov. 2003.