Subscription or Fee Access
A Linear Approximation of Logarithm Based on Least Squares and Interpolation Function for BICM-ID Embedded Turbo Codes
We propose a novel method to simply Logarithmic Maximum a posteriori (Log-MAP) algorithm BICM-ID embedded turbo codes in this paper. Firstly, we exploit a linear wise-function to approximate the logarithmic correction in the Jacobian logarithmic function based on the Least Squares and Interpolation Function, which avoids complicated logarithm look-up table operations in Log-MAP algorithm. Secondly, we utilize points estimation to replace the approximately lines in some ranges which have less influence on decoding performance. Simulation results show that the novel algorithm can offer almost equivalent performance to the optimal algorithm i.e. Log-MAP algorithm. In addition, compared with the improved MAX-Log-MAP algorithm proposed by S. Talakoub et al, the proposed algorithm can reduce about 40% of computational complexity, meanwhile it achieves about 0.1db performance gains.
BICM-ID; Interpolation Function; Least Squares; Linear approximation; Log-MAP.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.