一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

高斯近似法下LDPC碼tanh法則優(yōu)化近似新方法

鄭賀,  胡捍英,  周華瑩

鄭賀, 胡捍英, 周華瑩. 高斯近似法下LDPC碼tanh法則優(yōu)化近似新方法[J]. 電子與信息學(xué)報, 2006, 28(10): 1837-1841.
引用本文: 鄭賀, 胡捍英, 周華瑩. 高斯近似法下LDPC碼tanh法則優(yōu)化近似新方法[J]. 電子與信息學(xué)報, 2006, 28(10): 1837-1841.
Zheng He, HuHan-ying, Zhou Hua-ying. New Approach to Optimal Approximation of Tanh Rule for LDPC Codes under the Gaussian Approximation[J]. Journal of Electronics & Information Technology, 2006, 28(10): 1837-1841.
Citation: Zheng He, HuHan-ying, Zhou Hua-ying. New Approach to Optimal Approximation of Tanh Rule for LDPC Codes under the Gaussian Approximation[J]. Journal of Electronics & Information Technology, 2006, 28(10): 1837-1841.

高斯近似法下LDPC碼tanh法則優(yōu)化近似新方法

New Approach to Optimal Approximation of Tanh Rule for LDPC Codes under the Gaussian Approximation

  • 摘要: 該文利用高斯近似法，提出一種基于最小均方誤差(MMSE)準(zhǔn)則的tanh法則優(yōu)化近似新方法。提出反對稱分布與同構(gòu)廣義對稱分布新概念，推導(dǎo)出同構(gòu)廣義對稱分布條件下若干重要結(jié)論，并給出tanh法則最優(yōu)近似式的計算實(shí)現(xiàn)方法。加性高斯白噪聲(AWGN)信道下，對一系列(3,6)規(guī)則低密度校驗(yàn)(LDPC)碼的實(shí)驗(yàn)仿真顯示，與傳統(tǒng)Hagenauer近似法相比，該最優(yōu)近似方法在不明顯增加譯碼復(fù)雜度前提下，對LDPC碼譯碼性能夠帶來一定改善。
    Abstract: In this paper, a new approach is presented for optimizing the approximation of tanh rule based on Minimum Mean Square Error (MMSE) criterion under the Gaussian approximation. New concepts of anti-symmetric distribution and isomorphic generalized symmetric distribution are introduced. Under the isomorphic generalized symmetric distribution, several useful conclusions are drawn, by which a practical method for computing the optimal approximation is also presented. In comparison with the conventional approximation presented by Hagenauer, simulation results for several (3,6) regular Low-Density Parity-Check (LDPC) codes on the Additive White Gaussian Noise (AWGN) channel show that the approach can improve the decoding performance with a little increase in decoding complexity.
    • HTML全文
  • Callager R C. Low-Density Parity-Check Codes. Cambridge,MA: MIT Press, 1963, Chapter 1.[2]Tanner R M. A recursive approach to low complexity codes.IEEE Trcms. on I匆orm. Theory, 1981, IT-27(5): 533-547.[3]Richardson T J, Shokrollahi M A, Urbanke R L. Design ofcapacity-approaching irregular low-density parity-check codes[J].IEEETrans. onlnform. Theory.2001, 47(2):619-637[4]Luby M C, Mitzenmacher M, Shokrollahi M A, Spielman D A.Efficient erasure correcting codes[J].IEEE Trans. on Inform. Theory.2001, 47(2):569-584[5]Hagenauer J, Offer E,block and convolutionalPapkecodes.L. Iterative decoding of binaryZF.F.F.7YCL12,Son InformTheory,1996, 42(2): 429-445.[6]Ha J, Kim J, McLaughlin S W Rate-compatible puncturing of low-density parity-check codes. IEEE Trans[J].on Inform. Theory.2004, 50(11):2824-2836[7]Chung S Y, Richardson T J, Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Caussian approximation[J].IEEE Trans. on Iorm. Theory.2001, 47(2):657-670[8]Hagenauer J. Source-controlled channel decoding[J].IEEE Trans. on6}mmun.1995, 43(9):2449-2457[9]MacKay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans. on I匆orm. Theory.1999, 45(2):399-431[10]Chen J, Fossorier M. Near optimum universal belief propagation based decoding of low-density parity check codes[J].IEEE Trans. on6}mmun.2002, 50(3):406-414[11]Chen J, Fossorier M. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE Commun. Levers.2002, 6(5):208-210[12]Wei L. Several properties of short LDPC codes[J].IEEE Trans. on Commun.2004, 52(5):721-727
  • 加載中
計量
  • 文章訪問數(shù):  2571
  • HTML全文瀏覽量:  100
  • PDF下載量:  1116
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2005-01-17
  • 修回日期:  2006-01-27
  • 刊出日期:  2006-10-19

目錄

    /

    返回文章
    返回