• 沒有找到結果。

A Second Order log-MAP Algorithm for Turbo Code Decoding in CDMA Communications under Fading 蔡鳴凱、潘天賜

N/A
N/A
Protected

Academic year: 2022

Share "A Second Order log-MAP Algorithm for Turbo Code Decoding in CDMA Communications under Fading 蔡鳴凱、潘天賜"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

A Second Order log-MAP Algorithm for Turbo Code Decoding in CDMA Communications under Fading

蔡鳴凱、潘天賜

E-mail: 9607746@mail.dyu.edu.tw

ABSTRACT

A novel log-MAP algorithm with second order approximation for turbo code decoding in CDMA communications under fading is presented. Simulation results are performed for the IS-2000 CDMA turbo code under Additive White Gaussian Noise (AWGN) and slow fading channels by using various log-MAP algorithms. Results reveal that bit-error-rate (BER) performance of proposed second order log-MAP algorithm is superior to those of previous log-MAP algorithms such as max-log-MAP, constant-log-MAP, and linear-log-MAP.

Keywords : Code Division Multiple Access ; Turbo Decoding

Table of Contents

封面內頁 簽名頁 授權書.................... iii 中文摘要.................

.. iv 英文摘要................... v 誌謝..................... vi 目 錄..................... vii 圖目錄.................... ix 第一章 緒 論 .................1 1.1 研究動機與目的 ..............1 1.2 論文架構 .....

............2 第二章 文獻探討 ...............3 2.1 數位通訊理論 ........

.......3 2.2 錯誤控制碼(Error Control Coding) ....4 2.2.1 區塊碼(Block Code).......... 4   2.2.1.1 漢明碼(Hamming Code)...... 5   2.2.1.2 BCH碼...............7 2.2.2 迴旋碼

(Convolutional Code)...... 9 2.2.3 Viterbi迴旋解碼演算法則.........13 2.3 低密度奇偶檢查碼

(LDPC)......... 16 2.4 多重擷取技術............... 17 2.4.1 FDMA........

.......... 17 2.4.2 TDMA.................. 18 2.4.3 CDMA...........

....... 19 2.5 Shannon通道資訊容量 ........... 21 2.6 加成性白色高斯雜訊(AWGN) .....

...22 2.7 雷萊衰減(Rayleigh fading)........24 第三章 渦輪碼原理.............. 26 3.1 渦輪碼編碼器(Turbo Code Encoder).... 27 3.2 遞迴系統化迴旋碼編碼器(RSC Encoder)...28 3.3 交錯器

(Interleaver)...........29 3.4 渦輪碼解碼器(Turbo Code Decoder).... 30 3.5 渦輪碼解碼演算法.

............ 31 第四章 二階log-MAP渦輪解碼演算法 ......43 第五章 研究結果......

......... 46 第六章 結論................. 49 參考文獻..............

..... 50 REFERENCES

[1] C. Berrou, A. Glavieuc and P. Thitmajshima, “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes”, Proc., 1993, Int. Conf. Com., May 1993, Geneva, Seitzerland, pp. 1064-1070.

[2] P. Robertson, P. Hoeher and E. Villebrun, “Optimal and Sub-Optimal Maximum A Posteriori Algorithms Suitable for Turbo Decoding”, European Trans. On Telecommun., Mar./Apr. 1997, Vol. 8, pp. 119-125.

[3] S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, “A Soft-Input Soft-Output Maximum A Posteriori (MAP) Module to Decode Parallel and Serial Concatenated Codes”, TDA progress report 42-127, Nov. 15, 1996.

[4] W. J. Gross and P. G. Gulak, “Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders”, Electronics Letters, Aug. 1998, Vol. 34, pp. 1577-1578.

[5] B. Classon, K. Blankenship and V. Desai, “Turbo Decoding with The Constant-Log-MAP Algorithm”, Proc., Second Int. Sym. Turbo Codes and Related Appl., Sep. 2000, Brest, France, pp. 467-470.

[6] M. C. Valenti and J. Sun, “The UMTS Turbo Code and An Efficient Decoder Implementation Suitable for Software-Defined Radios”, Int.

J. Wireless Information Networks, Oct. 2001, Vol. 8, pp. 203-215.

[7] 翁萬德、江松茶,“通訊系統”,第四版,全華科技圖書股份有限公司,1993年。

[8] R. G. Gallager, “Low-Density Parity-Check Codes”, IEEE Trans. Inform. Theory, IT:8:21-28, Jan. 1963.

(2)

[9] 林振華,“MATLAB/Simulink在CDMA上的應用”,全華科技圖書股份有限公司,2001年。

[10] K. Wang, J. Xu, J. Tang, Z. Zhang and C. Zhang, “Modified Turbo Code Decoding Algorithm in CDMA Communications Under Fading Channel”, Proc., 2005, Int. Conf. Communications, Circuits and Systems, May 2005, Hong Kong, China, Vol. 1, pp. 27-30.

[11] L. R. Bahl , J. Coke , F. Jelinek, and J. Raviv, “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate,” IEEE Trans.

Inform. Theory, Vol. 20, pp.284-287, Mar. 1974.

[12] J. A. Erfanian, S. Pasupathy and G. Gulak, “Reduced Complexity Symbol Detectors with Parallel Structures for ISI Channels”, IEEE Trans. Commun., Feb./Mar./Apr. 1994, Vol. 42, pp. 1661-1671.

參考文獻

相關文件

In this paper, we have studied a neural network approach for solving general nonlinear convex programs with second-order cone constraints.. The proposed neural network is based on

Numerical results are reported for some convex second-order cone programs (SOCPs) by solving the unconstrained minimization reformulation of the KKT optimality conditions,

Section 3 is devoted to developing proximal point method to solve the monotone second-order cone complementarity problem with a practical approximation criterion based on a new

Although we have obtained the global and superlinear convergence properties of Algorithm 3.1 under mild conditions, this does not mean that Algorithm 3.1 is practi- cally efficient,

Abstract In this paper, we consider the smoothing Newton method for solving a type of absolute value equations associated with second order cone (SOCAVE for short), which.. 1

In this paper, we develop a novel volumetric stretch energy minimization algorithm for volume-preserving parameterizations of simply connected 3-manifolds with a single boundary

Abstract We investigate some properties related to the generalized Newton method for the Fischer-Burmeister (FB) function over second-order cones, which allows us to reformulate

We have provided alternative proofs for some results of vector-valued functions associ- ated with second-order cone, which are useful for designing and analyzing smoothing and