Present invention discloses a hardware complexity reduction method for successive cancellation list decoders (SCL). In path pruning stages of SCL decoding, L paths with smallest path metrics out of 2L candidate paths are chosen as surviving candidate paths as in conventional SCL algorithm. Moreover, the path indexes of L surviving candidate paths are provided in a sorted manner according to the indexes at the output of a sorter module. After path pruning, instead of L-to-1 multiplexers, (L/2+1)-to-1 multiplexers are deployed to perform copying operations of any required elements stored in dedicated registers of paths.
展开▼
