Name
Abstract | ||
|---|---|---|
In this letter, a new method is proposed to approximate n-input (n > 2) max* operation. Bi-variable Taylor series expansion, for the first time, is applied to approximate the correction term of n-input (n > 2) max* operation. It avoids the recursive computation of bi-variable Jacobian logarithm. To improve the approximation performance, multiple expansion points are considered. The proposed method is evaluated for 3GPP LTE turbo codes. The simulation results show that the approximation with five expansion points, applied with scaling factor to extrinsic information, has performance degradation of 0.01 dB compared with radix-4 Log-MAP algorithm. Furthermore, the approximation with three expansion points will bring minor performance loss but almost the same computational complexity compared with five expansion points. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/LCOMM.2017.2705643 | IEEE Communications Letters |
Keywords | Field | DocType |
Complexity theory,Jacobian matrices,Measurement,Decoding,Taylor series,Turbo codes,Simulation | Scale factor,Applied mathematics,Combinatorics,Multivariable calculus,Jacobian matrix and determinant,Turbo code,Real-time computing,Decoding methods,Logarithm,Mathematics,Computational complexity theory,Taylor series | Journal |
Volume | Issue | ISSN |
22 | 1 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen Liu | 1 | 1 | 1.05 |
| Bin Wu | 2 | 3 | 6.48 |
| Tianchun Ye | 3 | 30 | 8.32 |