Abstract: This paper proposes a novel Viterbi-Like successive cancellation (VL-SC) decoding algorithm for polar codes. The algorithm employs the bit log-likelihood-ratio as the “penalty value” within ...
Abstract: Weighted vertex cover (WVC) problem, as one of the most important combinatorial optimization problems, is a general form of the classic vertex cover problem. The existing researches focused ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results