A reduced complexity symbolwise maximum a posteriori probability (MAP) decoding algorithm for linear block codes is presented. This algorithm is based on the recursive trellises and performs two passes over the recursion tree. Probability-domain and Log-Max implementations are considered. Numeric results show that the proposed method has lower complexity compared to other known recursive algorithms and the classical BCJR algorithm. The complexity analysis for random codes is provided.
机构:
Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China
Tampere Univ, Fac Informat Technol & Commun Sci, Tampere 33100, FinlandHong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China
Abbas, Syed Mohsin
Jalaleddine, Marwan
论文数: 0引用数: 0
h-index: 0
机构:
McGill Univ, Dept Elect & Comp Engn, Montreal, PQ H3A 0G4, CanadaHong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China
Jalaleddine, Marwan
Tsui, Chi-Ying
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R ChinaHong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China