信道编码的盲识别技术研究
|
摘要
信道编码的盲识别是在未知编码信息的条件下仅根据接收到的编码数据来快速识别编码结构,在信号截获、协作通信、智能移动通信、多点广播通信等领域具有重要而广泛的应用,已经成为该领域理论与技术研究的前沿问题和研究热点,对该技术进行研究具有重要的理论意义和应用价值。论文正是围绕这一方向开展的。
本文取得的主要研究成果与创新点有：
(1)针对系统二进制线性分组码,提出了基于线性空间变换的二进制线性分组码的盲识别。在误码较高,码长较短时,通过Walsh-Hadamard变换求解校验矩阵来完成二进制线性分组码的盲识别。理论分析和仿真实验均验证了提出算法的有效性。理论证明了二进制线性分组码通过分组交织后仍为一个二进制的线性分组码,完成了无误码情况下分组码的分组交织的识别,为有误码情况下分组码的分组交织提供了理论基础。
(2)根据二进制BCH码的循环特性,提出了基于欧几里得算法的二进制BCH码的盲识别,该算法计算复杂度低且具有一定的容错能力。
(3)首次提出了非二进制信道编码的盲识别算法,通过在伽罗华域对待识别RS码进行傅立叶变换来完成含错RS码的盲识别。理论分析和仿真实验均验证了提出算法可以在含错码的情况下对RS码进行有效识别。
(4)对于扩展Golay码,通过挑选偶数重量的码字来规避部分误码分组,进而降低误码对待识别分组的影响。仿真实验表明,在误码率相同的情况下,较现有算法而言,提出算法的正确识别概率具有显著的提高。
(5)针对(2,1,m)卷积码,提出了基于Walsh-Hadamard变换的卷积码的盲识别方法。较现有算法而言,提出算法具有一定的容错性能。通过将截获数据进行分路处理,首次提出了非系统含错(n,1,m)卷积码和系统含错(n,k,m)卷积码的盲识别算法,向任意参数卷积码的盲识别迈进了一大步。
(6)针对DVB-S系统中的删除卷积码的盲识别问题,提出了基于先验校验向量的删除卷积码的盲识别算法,仿真实验表明在保证估计可靠性的前提下,该算法的估计时间可以降低到传统算法估计时间的10%。
Blind recognition of the channel coding is that under the conditions of unknown encoding information, only in accordance with the unknown encoded data, it requires the receiver quickly recognize the system and the parameters of channel coding. It is widely used in information interception, cooperation communication, intelligent mobile communication, multicast communication and other fields of digital communication system. And it has become frontier issue and research hot spot in this field. Therefore, it is of great importance in both theory and practice. And the paper is spread around this direction.
The primary achievement and innovation points of the thesis are as follows:
(1) An algorithm of blind recognizing the binary linear block codes based on the linear space transformation is presented. In the high error rate condition, the Walsh-Hadamard transform can be used to solve the parity check matrix of the short length binary linear block codes. The theoretical analyses and simulation experiment demonstrate the effectiveness of the proposed algorithm. It is proved that the binary linear block codes passing block interleaver are still binary linear block codes. Blind recognition of block interleaving without errors is also achieved, which provided theoretical basis for block interleaving of block code with errors.
(2) Because the binary BCH codes are cyclic, an algorithm based on Euclidean algorithm to blind recognize the binary BCH codes is proposed in this paper. The proposed algorithm is error-resilient in a certain extent and the computation complexity is low.
(3) An algorithm of blind recognizing the non-binary codes is proposed for the first time in this paper. Based on the Galois Field Fourier Transform (GFFT) of codes with errors, the RS codes can be recognized. The theoretical analysis and simulation validate the effectiveness of the proposed algorithm.
(4) For the extended Golay codes, a blind recognition algorithm based on finding codewords with even hamming weights to avoid some error block, and thus reduce the effect of error on the codewords is proposed in this paper. The simulation shows that the correct recognition rate of the proposed algorithm is significantly higher than that of the existing algorithms under the same bit error rate.
(5) A blind recognition algorithm of (2,1,m) convolutional codes based on the Walsh-Hadamard transform is proposed. The proposed algorithm is error-tolerant in a certain extent compared with the existing algorithms. Blind recognition algorithms of the nonsystematic (n,1,m) convolutional codes with errors and the systematic (n,k,m) convolutional codes with errors are proposed for the first time, which makes it closer to practical application of the blind recognition of the general convolutional codes.
(6) A fast algorithm based on prior parity-check vector to blind recognize the punctured convolutional codes in digital video broadcast satellite (DVB-S) receiving system is proposed. The simulation experiment shows by using the proposed algorithm the estimating time can be reduced to 10% of the traditional algorithm with the reliable estimation.
本文取得的主要研究成果与创新点有：
(1)针对系统二进制线性分组码,提出了基于线性空间变换的二进制线性分组码的盲识别。在误码较高,码长较短时,通过Walsh-Hadamard变换求解校验矩阵来完成二进制线性分组码的盲识别。理论分析和仿真实验均验证了提出算法的有效性。理论证明了二进制线性分组码通过分组交织后仍为一个二进制的线性分组码,完成了无误码情况下分组码的分组交织的识别,为有误码情况下分组码的分组交织提供了理论基础。
(2)根据二进制BCH码的循环特性,提出了基于欧几里得算法的二进制BCH码的盲识别,该算法计算复杂度低且具有一定的容错能力。
(3)首次提出了非二进制信道编码的盲识别算法,通过在伽罗华域对待识别RS码进行傅立叶变换来完成含错RS码的盲识别。理论分析和仿真实验均验证了提出算法可以在含错码的情况下对RS码进行有效识别。
(4)对于扩展Golay码,通过挑选偶数重量的码字来规避部分误码分组,进而降低误码对待识别分组的影响。仿真实验表明,在误码率相同的情况下,较现有算法而言,提出算法的正确识别概率具有显著的提高。
(5)针对(2,1,m)卷积码,提出了基于Walsh-Hadamard变换的卷积码的盲识别方法。较现有算法而言,提出算法具有一定的容错性能。通过将截获数据进行分路处理,首次提出了非系统含错(n,1,m)卷积码和系统含错(n,k,m)卷积码的盲识别算法,向任意参数卷积码的盲识别迈进了一大步。
(6)针对DVB-S系统中的删除卷积码的盲识别问题,提出了基于先验校验向量的删除卷积码的盲识别算法,仿真实验表明在保证估计可靠性的前提下,该算法的估计时间可以降低到传统算法估计时间的10%。
Blind recognition of the channel coding is that under the conditions of unknown encoding information, only in accordance with the unknown encoded data, it requires the receiver quickly recognize the system and the parameters of channel coding. It is widely used in information interception, cooperation communication, intelligent mobile communication, multicast communication and other fields of digital communication system. And it has become frontier issue and research hot spot in this field. Therefore, it is of great importance in both theory and practice. And the paper is spread around this direction.
The primary achievement and innovation points of the thesis are as follows:
(1) An algorithm of blind recognizing the binary linear block codes based on the linear space transformation is presented. In the high error rate condition, the Walsh-Hadamard transform can be used to solve the parity check matrix of the short length binary linear block codes. The theoretical analyses and simulation experiment demonstrate the effectiveness of the proposed algorithm. It is proved that the binary linear block codes passing block interleaver are still binary linear block codes. Blind recognition of block interleaving without errors is also achieved, which provided theoretical basis for block interleaving of block code with errors.
(2) Because the binary BCH codes are cyclic, an algorithm based on Euclidean algorithm to blind recognize the binary BCH codes is proposed in this paper. The proposed algorithm is error-resilient in a certain extent and the computation complexity is low.
(3) An algorithm of blind recognizing the non-binary codes is proposed for the first time in this paper. Based on the Galois Field Fourier Transform (GFFT) of codes with errors, the RS codes can be recognized. The theoretical analysis and simulation validate the effectiveness of the proposed algorithm.
(4) For the extended Golay codes, a blind recognition algorithm based on finding codewords with even hamming weights to avoid some error block, and thus reduce the effect of error on the codewords is proposed in this paper. The simulation shows that the correct recognition rate of the proposed algorithm is significantly higher than that of the existing algorithms under the same bit error rate.
(5) A blind recognition algorithm of (2,1,m) convolutional codes based on the Walsh-Hadamard transform is proposed. The proposed algorithm is error-tolerant in a certain extent compared with the existing algorithms. Blind recognition algorithms of the nonsystematic (n,1,m) convolutional codes with errors and the systematic (n,k,m) convolutional codes with errors are proposed for the first time, which makes it closer to practical application of the blind recognition of the general convolutional codes.
(6) A fast algorithm based on prior parity-check vector to blind recognize the punctured convolutional codes in digital video broadcast satellite (DVB-S) receiving system is proposed. The simulation experiment shows by using the proposed algorithm the estimating time can be reduced to 10% of the traditional algorithm with the reliable estimation.
引文
[1]A.R.Calderbank, The art of signaling:Fifty years of coding theory, IEEE Trans. Inform.Theory, vol.44, No.6, Oct.1998, pp:2561-2595.
[2]C.E.Shannon, A mathematical theory of communication, Bell Syst.Tech.J., vol.27, Jul./Oct.1948, pp:379-423/623-656.
[3]曹志刚,钱亚生,现代通信原理,北京：清华大学出版社,1991.
[4]徐朝军,RS码译码算法及其实现研究,西安电子科技大学博士论文,2006.
[5]D.J.Costello Jr., J.Hagenauger, H.Imai, S.B. Wicker, Applications of error-control coding, IEEE Trans.Inform.Theory, vol.44, No.6, Oct.1998, pp:2531-2560.
[6]Verdu S., Fifty years of Shannon theory, IEEE Trans.Inform.Theory, vol.44, No.6, Oct.1998, pp:2057-2078.
[7]R.W.Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, Apri.1950, pp:147-160.
[8]D E Muller, Applications of Boolean algebra to Switching Circuits Design and to Error Detection, IRE Trans, vol.Ec-32,1954, pp:6-12.
[9]I S Reed, A Class of Multiple-Error-Correcting Codes and the Decoding Scheme, IRE Trans, vol.IT-4,1954, pp:38-49.
[10]E Prange, Cyclic Error-Correcting Codes in Two Symbols, AFCRC-TN-57,103, Air Force Cambridge Research Center, Cambridge, Mass,1957.
[11]A Hocquenghem, Codes corecteurs d'erreurs, Chiffres, vol.2,1959, pp:147-156.
[12]R C Bose and D K Ray-Chaudhuri, On a Class of Error Correcting Binary Group Codes, Inform. Control, vol.3,1960, pp:68-79.
[13]W W Peterson, Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes, IRE Trans. Inform. Theory, vol.IT-1,1960, pp:459-470.
[14]D Gorenstein and N Zierler, A Class of Cyclic linear Error-Correcting Codes in pm Symbols, J. Soc. Ind. Appl. Math., vol.9,1961,pp:107-214.
[15]I S Reed and G Solomon, Polynomial Codes over Certain Finite Fields, J. Soc. Ind. Appl. Math., vol.8,1960,pp:300-304.
[16]R T Chein, Cyclic Decoding Procedure for the Bose- Chaudhuri-Hocquenghem Codes, IEEE Trans. Inform. Theory, vol.IT-10, No.4,1964, pp:357-363.
[17]G D Forney, On Decoding BCH Codes, IEEE Trans. Inform. Theory, vol. IT-11, No.6,1965, pp:549-557.
[18]E R Berlekamp, On Decoding Binary Bose- Chaudhuri-Hocquenghem Codes, IEEE Trans. Inform. Theory, vol.IT-11, No.6,1965, pp:570-580.
[19]E R Berlekamp, Algebraic Coding Theory, McGraw-Hill New York,1968.
[20]J L Massey, Step-by-Step Decoding of the Bose- Chaudhuri-Hocquenghem Codes, IEEE Trans. Inform. Theory, vol.IT-11, No.6,1965, pp:580-585.
[21]J L Massey, Shift-Register Synthesis and BCH Decoding, IEEE Trans. Inform. Theory, vol.IT-11, No.2,1969, pp:122-127.
[22]H O Burton, Inversinonless Decoding of Binary BCH Codes, IEEE Trans. Inform. Theory, vol.IT-17, No.5,1971, pp:464-466.
[23]W C Core, Transmitting Binary Symbols with Reed-Solomon Codes, Proc. Conf. Infor. Sci. and Syst., Princeton, N. J.,1973, pp:495-97.
[24]R E Blahut, Transform Techniques for Error-Control Codes, IBM J. Res. Dev., vol.16,No.3,1979,pp:299-315.
[25]P Elias, Coding for Noisy Channels, IRE Conv. Rec., vol.4,No.1,1955, pp:37-47.
[26]J M Wozencraft and B Reiffen, Sequential Decoding, MIT Press, Cambridge,1961.
[27]J L Massey, Threshold Decoding, MIT Press, Cambridge,1963.
[28]A J Viterbi, Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Trans. Inform. Theory, vol. IT-13, No.3,1967, pp: 260-269.
[29]L R Baul, J Cocke, F Jelinek, and J Raviv, Optimal Decoding of Linear Codes for Minimal Symbol Error Rate, IEEE Trans. Inform. Theory, vol. IT-20,1974, pp:284-87.
[30]G D Forney, Jr, Concatenated Codes, MIT Press, Cambridge,1966.
[31]C.Berrou, A.Glavieux, P.Thitimasjshima, Near Shannon Limit Error-Correcting Coding and Decoding:Turbo Codes (1), ICC, Geneva, Switztland,1993, pp: 1064-1070.
[32]G Battail, M Decouvelaere, and P Godlewski, Replication Decoding, IEEE Trans. Inform. Theory, vol.IT-25, No.4,2009, pp:332-345.
[33]G Battail, Building Long Codes by Combination of Simple Ones, Thanks to Weighted-Output Decoding, Proc. URSI Intl. Symp. Signals, Systems, and Electronics, 1989, pp:634-67.
[34]J Hagenauer and P Hoeher, A Viterbi Algorithm with Soft-Decision Outputs and Its Applications, Proc. IEEE Global Commun. Conf.,1992, pp:1680-86.
[35]J H Lodge, P Hoeher, and J Hagenauer, The Decoding of Multidimensional Codes Using Separable MAP filters, Proc.16th Biennial Symp. Comm. Conf,1992, pp: 343-46.
[36]J D Andersen, The Turbo Coding Scheme, presented at IEEE Intl. Symp. Inform. Theory, Trondheim, Norway,1994.
[37]P Robertson, Illuminating the Structure of Code and Decoder of Parallel Concatenated Recursive Systematic Codes, Proc. IEEE Global Commun. Conf.,1994, pp:1298-1303.
[38]S Benedetto and G Montorsi, Unveiling Turbo Codes:Some Result on Parallel Concatenated Coding, IEEE Trans. Inform. Theory, vol. IT-42, No.3,1996, pp:409-428.
[39]S Benedetto and G Montorsi, Design of Parallel Concatenated Convolution Codes, IEEE Trans. Commun., vol.COM-44,1996, pp:591-600.
[40]L C Perez, J Seghers, and D J Costello, Jr, A Distance Spectrum Interpretation of Turbo Codes, IEEE Trans. Inform. Theory, vol. IT-42, No.7,1996, pp:1698-1709.
[41]G Barrail, A Conceptual Framework for Understanding Turbo Codes, IEEE J. Select. Areas Comm., vol. SAC-16, No.1,1998, pp:245-254.
[42]J Hagenauer, E Offer, and L Papke, Iterative Decoding of Binary Block and Convolutional Codes, IEEE Trans. Inform. Theory, vol. IT-42, No.2,1996, pp:429-445.
[43]J Hagenauer, The Turbo Principle:Tutorial Introduction and State of the Art, Proc. 1st Intl. Symp. Turbo Codes,1997, pp:1-11.
[44]R J McEliece, D. J MacKay, and J-F Cheng, Turbo Decoding As an Instance of Pearl's Belief Propagation Algorithm, IEEE J. Select. Areas Comm., vol.SAC-16, No.1, 1998, pp:140-152.
[45]A J Viterbi, An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes, IEEE J. Select. Areas Comm., vol.SAC-16, No.1, 1998, pp:260-264.
[46]D Divsalar and F Pollara, Multiple Turbo Codes for Deep-Space Communications, TDA Progress Report 42-121, Jet Propulsion Laboratory, Pasadena, Calif,1995.
[47]D Divsalar and F Pollara, On the Design of Turbo Codes, TDA Progress Report 42-123, Jet Propulsion Laboratory, Pasadena, Calif,1995.
[48]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, Jet Propulsion Laboratory, Pasadena, Calif,1996.
[49]S Dolinear, D Divsalar, and F Pollara, Code Perforrmance As a Function of Block Size, TMO Progress Report 42-133, Jet Propulsion Laboratory, Pasadena, Calif,1998.
[50]D Divsalar, and F Pollara, Serial and Hybrid Concatenated with Applications, Proc. 1st Intl. Symp. Turbo Codes,1997, pp:810-87.
[51]S Benedetto, D Divsalar, G Montorsi, and F Pollara, Analysis, Design and Iterative Decoding of Double Serially Concatenated Codes with Interleavers, IEEE J. Select. Areas Comm., vol.SAC-42, No.1,1998, pp:231-244.
[52]S Benedetto, D Divsalar, G Montorsi, and F Pollara, Serial Concatenation of Interleaved Codes:Performance Analysis, Design and Iterative Decoding, IEEE Trans. Inform. Theory, vol. IT-44, No.1,1998, pp:209-226.
[53]C Heegard and S B Wicker, Turbo Coding, Kluwer Academic, Boston, Mass., 1999.
[54]J Pearl, Probabilistic Reasoning in Intelligent Systems:Networks of Plausible Inference, Morgan Kaufmann, San Mateo, Calif.,1988.
[55]R G Gallager, Low Density Parity Check Codes, IRE Trans. Inform. Theory, vol.IT-8, No.1,1962, pp:21-28.
[56]R G Gallager, Low Density Parity Check Codes, MIT Press, Cambridge,1963.
[57]D J C MacKay and R M Neal, Near Shannon Limit Performance of Low Density Parity Check Codes, Electron. Letter, vol.32, No.18, Aug.1996, pp:1645-1646.
[58]M Sipser and D Spielman, Expander Codes, IEEE Trans. Inform. Theory, vol.42, No.6, Nov.1996, pp:1710-1722.
[59]A. Valembois, Detection and recognition of a binary linear code, Discrete Applied Mathematics, vol.111,2001, pp:199-218.
[60]C. Mathieu, Block code reconstruction using interative decoding techniques, IEEE International Symposium on Information Theory,2006, pp:2269-2273.
[61]C. Christophe, Recogniton of a code in a noisy environment, IEEE International Symposium on Information Theory,2007, pp:2211-2215.
[62]Robert H. Morelos-Zaragoza, The Art of Error Correcting Coding, London:Wiley, 2007.
[63]Gao, M., Li, L.,Wang, Z.,Lin, J.,Sha, J, Decoder Design for RS-Based LDPC Codes, IEEE Transactions on Circuits and Systems II:Express Briefs, vol.56, No.9, Sep.2009, pp:724-728.
[64]El-Samie Fathi Abd, Elazm Atef Abou, El-Fishawy Nawal, Shebl Seif, A random construction of LDPC codes using a sub-optimal search algorithm, National Radio Science Conference,2009,pp:c06(1-10).
[65]Rezard Vincent, Pacalet Renaud Amador, Erick, Optimum LDPC decoder:A memory architecture problem, ACM/IEEE Design Automation Conference,2009, pp: 892-896.
[66]Daneshrad, B., Cavus, E., Computationally efficient decoding of LDPC codes, Electronics Letters, vol.45, No.18,27th Aug.2009.
[67]He, He Yun, He, Chen, Hang, Jian-Bing, Research on Regular LDPC Codes with better Performance than Turbo Codes, WASE International Conference on Information Engineering,2009, pp:390-393.
[68]Rasmussen Lars, Lechner Gottfried, Land Ingmar, Adaptive decoding of LDPC codes with binary messages, IEEE International Symposium on Information Theory, 2009, pp:2146-2150.
[69]Sakaniwa Kohichi, Shibuya Tomoharu, Declercq David, Poulliat Charly, Kasai Kenta, Weight distribution of non-binary LDPC codes, International Symposium on Information Theory and Its Applications,2008, pp:212-217.
[70]Yanan Shen, Xinhui Si, Yan Cui, A novel algorithm of constructing LDPC codes with graph theory, IEEE Conference on Cybernetics and Intelligent Systems,2008, pp: 602-605.
[71]M.H. Todayon, M. Esmaeili, A novel approach to generating long low-density parity-check codes using two configurations, IET Communications, vol.2, No.4, Apr.2008, pp:587-597.
[72]Rosnes, E., Ytrehus, Y, Improved algorithms for the determination of turbo-code weight distributions, IEEE Transactions on Communications, vol.53, No.1, Jan.2005, pp:20-26.
[73]Fragouli C., Wesel R.D, Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation, IEEE Transactions on Communications, vol.49, No.3, Mar.2001, pp:425-435.
[74]Dave S., Junghwan Kim, Kwatra S.C., An efficient decoding algorithm for block turbo codes, IEEE Transactions on Communications, vol.49, No.1, Mar.2001, pp: 41-46.
[75]Frenger P., Turbo decoding for wireless systems with imperfect channel estimates, IEEE Transactions on Communications, vol.48, No.9, Sept.2000, pp:1437-1440.
[76]Souvignier T.V., Oberg M., Siegel P.H., Swanson R.E., Wolf J.K., Turbo decoding for partial response channels, IEEE Transactions on Communications, vol.48, No.8, Aug.2000,pp:1297-1308.
[77]Acikel O.F., Ryan W.E., Punctured turbo-codes for BPSK/QPSK channels, IEEE Transactions on Communications, vol.47, No.9, Sept.2000, pp:1315-1323.
[78]Cathy Ye Liu, Heng Tang, Shu Lin, Fossorier M.P.C., An interactive concatenated turbo coding system, IEEE Transactions on Vehicular Technology, vol.51, No.5, Sept.2002, pp:998-1010.
[79]Xiaodong Wang, Rong Chen, Blind turbo equalization in Gaussian and impulsive noise, IEEE Transactions on Vehicular Technology, vol.50, No.4, July 2001, pp: 1092-1105.
[80]Ferrari M., Bellini S., Existence and uniqueness of the solution for turbo decoding of parallel concatenated single parity check codes, IEEE Transactions on Information Theory, vol.49, No.3, Mar.2003, pp:722-725.
[81]Greferath M., Byrne E., Skachek V., Flanagan M. F., Linear-Programming Decoding of Nonbinary Linear Codes, IEEE Transactions on Information Theory, vol.55, No.9, Sep.2009, pp:4134-4154.
[82]Koscielny C., Constructing a better cyclic code than cyclic Reed-Solomon code, IEEE Transactions on Information Theory, vol.41, No.4, July 1995, pp:1191-1194.
[83]Michel Jezequel, Patrick Adde, Christophe Jego, Camille Leroux, On the higher efficiency of parallel Reed-Solomon turbo-decoding, IEEE International Conference on Electronics, Circuits and Systems,2008, pp:1308-1311.
[84]Il Ho Kim, Hyoung June Ko, A New Approach to Decoding of BCH and Reed-Solomon Codes Using Syzygy, Data Compression Conference,2007, pp: 387-387.
[85]Dianwu Yue; Hongbo Zhu, On the minimum distance of composite-length BCH codes, IEEE Communications Letters, vol.3, No.9, Sept.1999, pp:269-271.
[86]Kamiya N, On algebraic soft-decision decoding algorithms for BCH codes, IEEE Transactions on Information Theory, vol.47, No.1, Jan.2001, pp:45-58.
[87]T. M. Cover, Shannon, investment, IEEE Inform. Theory Newslett.(Special Golden Jubilee Issue), Summer 1998, pp:10-11.
[88]D. J. Sakrison, The rate of a class of random processes, IEEE Trans. Inform. Theory, vol. IT-16, No.1, Jan.1970, pp:10-16.
[89]K. Ramchandran, A. Ortega, K. Uz, M. Vetterli, Multiresolution broadcast for digital HDTV using joint source channel coding, IEEE J. Select. Areas Commun., vol. 11, No.1, Jan.1993,pp:6-23.
[90]H. Sato, The capacity of the Gaussian interference channel under strong interference, IEEE Trans. Inform. Theory, vol. IT-27, No.8, Nov.1981, pp:786-788.
[91]M. H. M. Costa, A. E. Gamal, The capacity region of the discrete memoryless interference channel with strong interference, IEEE Trans. Inform. Theory, vol. IT-33, No.8, Sept.1987, pp:710-711.
[92]Y. S. Liu, B. L. Hughes, A new universal random coding bound for the multiple-access channel, IEEE Trans. Inform. Theory, vol.42, No.2, Mar.1996, pp: 376-386.
[93]J.L. Shanks, Computation of the Fast Walsh-Fourier Transform, IEEE Trans. Computers, vol.18, no.5, May 1969, pp:457-459.
[94]W.K. Cham, R.J. Clarke, Dyadic Symmetry and Walsh Matrices, Proc. IEE, Pt. F., vol.134, no.2, Apr.1987,pp:141-145.
[95]Y. Hel-Or, H. Hel-Or, Real Time Pattern Matching Using Projection Kernels, IEEE Trans. Pattern Analysis and Machine Intelligence, vol.27, no.9, Sept.2005, pp: 1430-1445.
[96]C.M. Mak, N. Li, W.K. Cham, Fast Motion Estimation in Walsh Hadamard Domain, Proc. Int'l Symp. Intelligent Signal Processing and Comm. Systems, Dec.2005, pp: 349-352.
[97]Cham, W.K., Ouyang, Wanli, Fast Algorithm for Walsh Hadamard Transform on Sliding Windows, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 32, No.1, Jan.2010, pp:165-171.
[98]T. A. Brubaker, P.R. Risch, Evaluation of data reconstruction using Walsh functions, Electronics Letters, Vol.9, No.21, Oct.1973, pp:489-490.
[99]D.A. Bell, Walsh functions and Hadamard matrixes, Electronics Letters, Vol.2, No.9, Sep.1966, pp:340-341.
[100]C. K. Yuen, K. G. Beauchamp, Walsh Functions and Their Applications, IEEE Transactions on Systems, Man and Cybernetics, Nov.1976, pp:794-795.
[101]Rom-Shen Kao, Taylor F.J., A Fast Galois-Field Transform Algorithm Using Normal Bases,1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, Nov.1990, pp:511-515.
[102]Yupu Hu, Qiong Liu, A Fast Correlation Attack via Parallel Computing, Fifth International Conference on Information Assurance and Security,2009, pp:651-654.
[103]Chen Wanzhi, An improved algorithm for fast correlation attack on stream ciphers, 7th World Congress on Intelligent Control and Automation,2008, pp:2126-2129.
[104]Mihaljevic M.J., Fossorier M.P.C., Imai H., An improved fast correlation attack based on list decoding, IEEE International Symposium on Information Theory,2003, pp:165-165.
[105]Jonsson F., Johansson T., Theoretical analysis of a correlation attack based on convolutional codes, IEEE International Symposium on Information Theory,2000, pp: 212-212.
[106]Wang Li-Ping, An algorithm for computing bidirectional minimal polynomials for multisequences, IEEE International Symposium on Information Theory,2009, pp: 621-624.
[107]Meina Xu, Abdel-Ghaffar K., Shu Lin, Shumei Song, Jingyu Kang, Bo Zhou, Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions, IEEE Transactions on Communications, Vol.57, No.6, June 2009, pp:1652-1662.
[108]Y. Zheng, C. Xiao, Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms, IEEE Communicaiton Letter, vol.6, no.6, June 2002, pp: 256-258.
[109]A. Bennatan, D. Burshtein, Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels, IEEE Trans. Inform. Theory, vol.52, no.2, Feb. 2006, pp:549-583.
[110]D. Declercq, M. Fossorier, Decoding algorithms for nonbinary LDPC codes over GF(q), IEEE Trans. Commun., vol.54, no.4, Apr.2007, pp:633-643.
[111]Y. Kou, S. Lin, M. Fossorier, Low-density parity-check codes based on finite geometries:a rediscovery and new results, IEEE Trans. Inform. Theory, vol.47, no.7, Nov.2001, pp:2711-2736.
[112]S.Y. Chung, T. J. Richardson, R. L. Urbanke, Analysis of sumproduct decoding of low-density parity-check codes using a Gaussian approximation, IEEE Trans. Inform. Theory, vol.47, no.2, Feb.2001, pp:657-670.
[113]J. Ha, S. W. McLaughlin, Low-density parity-check codes over Gaussian channels with erasures," IEEE Trans. Inform. Theory, vol.49, no.7, July 2003, pp:1801-1809.
[114]W. J. Gross, F. R. Kschischang, R. Kotter, and P. G. Gulak, Applications of algebraic soft-decision decoding of Reed-Solomon codes, IEEE Trans. Commun., vol. 54, no.7, July 2006, pp:1224-1234.
[115]Z. Li, L. Chen, L. Zeng, S. Lin, W. Fong, Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol.54, no.1, Jan.2006, pp: 71-81.
[116]Ding Z.,Lin S.,Tai Y.Y.,Kang J.,Zhou B., High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries LDPC Codes on Euclidean Geometries, IEEE Transactions on Communications, Vol.57, No.5, May 2009, pp: 1398-1311.
[117]Yingquan Wu, New List Decoding Algorithms for Reed-Solomon and BCH Codes, IEEE International Symposium on Information Theory,2007, pp:2807-2810.
[118]Jean-Charles Faugere, Magali Bardet, Daniel Augot, On formulas for decoding binary cyclic codes, IEEE International Symposium on Information Theory,2007, pp: 2646-2650.
[119]Koga K., A simple decoding of BCH codes over GF(2m), IEEE Transactions on Communications, Vol.46, No.6, June 1998, pp:709-716.
[120]Egorov S., Markarian G, Pickavance K., A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Communications, Vol.52, No.12, Dec.2004, pp:2052-2056.
[121]Henkel W., An extended Berlekamp-Massey algorithm for the inversion of Toeplitz matrices, IEEE Transactions on Communications, Vol.40, No.10, Oct.1992, pp: 1557-1561.
[122]Kotter R., A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes, IEEE Transactions on Information Theory, Vol.44, No.4, July 1998, pp:1353-1368.
[123]Sakata S., Jensen H.E., Hoholdt T., Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound, IEEE Transactions on Information Theory, Vol.41, No.6, Nov.1995, pp:1762-1768.
[124]Dabiri D., Blake I.F., Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials, IEEE Transactions on Information Theory, Vol.41, No. 4, July 1995, pp:873-885.
[125]Gao Wen, Lei Jing, Code-Matched Interleaver Design over Surrogate Channels, IEEE Wireless Communications and Networking Conference,2009, pp:1-6.
[126]Yilmaz A.O., Gazi O., Collision free row column S-random interleaver, IEEE Communications Letters, Vol.3, No.4, Apr.2009, pp:257-259.
[127]Rui Lv, Kun Luo, Ping Shi, Interleaver Design for Turbo-Based Distributed Video Coding,4th International Conference on Wireless Communications, Networking and Mobile Computing,2008, pp:1-5.
[128]Peter Adam Hoeher, Pin Yao, Dapeng Hao, Analysis and design of interleaver sets for interleave-division multiplexing and related techniques,5th International Symposium on Turbo Codes and Related Topics,2008, pp:432-437.
[129]Yu-Chuan Fang, Yan-Xiu Zheng, Apply bit-level interleaver to improve the error rate performance of the double binary turbo code with less decoder complexity,5th International Symposium on Turbo Codes and Related Topics,2008, pp:118-122.
[130]S.Q. Li, S. Tong, D.S. Lin, Joint linear interleaver design for concatenated zigzag codes, Electronics Letters, Vol.44, No.19,11th Sep.2009, pp:1-2.
[131]Nabil Ouddane, Pavel Kromer, Jan Platos, Vaclav Snasel, Genetic Algorithms Searching for Turbo Code Interleaver and Solving Linear Ordering Problem,7th Computer Information Systems and Industrial Management Applications,2008, pp: 71-76.
[132]Yumin Wang, Xinjun Du, Hui Li, Ying Wang, The Design of Optimal Period Interleaver,22nd International Conference on Advanced Information Networking and Applications-Workshops,2008, pp:413-145.
[133]Snasel Vaclav, Kramer Pavel, Ouddane Nabril, Genetic Algorithms for Turbo Code Interleaver Optimization, Seventh International Conference on Intelligent Systems Design and Applications,2007, pp:279-282.
[134]Li Teng, Collins Oliver M., A Random Interleaver Based Successive Decoding Scheme over Markov Channels, IEEE Information Theory Workshop,2007, pp: 162-167.
[135]Pena Carlos J., Salehi Masoud, Optimal Interleaver Design for Short Block-length Turbo Codes, International Symposium on Signals, Systems and Electronics,2007, pp: 295-298.
[136]Wang Z., Li Q., Very Low-Complexity Hardware Interleaver for Turbo Decoding,, IEEE Transactions on Circuits and Systems Ⅱ, Vol.54, No.7, July 2007, pp:636-640.
[137]Qilian Liang, Lingming Wang, Channel coding and interleaver for secure wireless sensor networks, IEEE Wireless Communications and Networking Conference,2006, pp:1973-1977.
[138]Chauvet W., Lacaze B., Roviras D., Study of the Effect of Interleavers on the Power Spectral Density Application to the Matrix Interleaver,2006 IEEE International Conference on Acoustics, Speech and Signal Processing,2006, pp:545-547.
[139]Daneshgaran F., Laddomada M., Reduced Complexity Interleaver Growth Algorithm for Turbo Codes, IEEE Transactions on Wireless Communications, Vol.4, No.3, May 2005, pp:954-964.
[140]Dawson E., Design of a discrete cosine transform based speech scrambler, Electronics Letters, Vol.27, No.7, Mar.1993, pp:613-614.
[141]Bossert M., Dieterich H., Shavgulidze S., Partitioning of convolutional codes using a convolutional scrambler, Electronics Letters, Vol.32, No.9, Sep.1996, pp: 1758-1760.
[142]Cluzeau M., Reconstruction of a linear scrambler, International Symposium on Information Theory,2004, pp:234-234.
[143]Rice M., Tretter S., Mathys P., On differentially encoded M-sequences, IEEE Transactions on Communications, Vol.49, No.3, Mar.2001, pp:421-424.
[144]Lie-Liang Yang, Hanzo L., Acquisition of m-sequences using recursive soft sequential estimation, IEEE Transactions on Communications, Vol.52, No.2, Feb.2004, pp:199-204.
[145]Komo J.J., Liu S.C., Maximal length sequences for frequency hopping, IEEE Journal on Selected Areas in Communications, Vol.8, No.5, June 1990, pp:819-822.
[146]Lee Y. H., Tantaratana S., Sequential acquisition of PN sequences for DS/SS communications:design and performance, IEEE Journal on Selected Areas in Communications, Vol.10, No.4, May 1992, pp:750-759.
[147]Lee L. S., Chiu J. H., An improved sequential estimation scheme for PN acquisition, IEEE Transactions on Communications, Vol.36, No.10, Oct.1988, pp:1182-1184.
[148]Carlet C. Improving the algebraic immunity of resilient and nonlinear functions and constructing bent functions.http://eprint.iacr.org/2004/276,2004.
[149]Dalai D K, Gupta K C, Maitra M. Results on Algebraic Immunity for Cryptographically Significant Boolean Functions.Ganteaut A and Viswanathan K. Progress in Cryptology,2004, pp:92-106.
[150]Marvin K. Simon, Sam Dolinar, Improving SNR Estimation for Autonomous Receivers, IEEETransactions on Communications, Vol.53, No.6, June 2005, pp: 1063-1073
[151]Ofir shalvi, Ehud Weinstein, Super-Exponential Methods for Blind Deconvolution, IEEE Transactions on InformationTheory, Vol.39, No.2, Feb.1993, pp:504-519.
[152]Ka Lok Yeung, Sze fong Yau, A Super-Exponential Algorithm for Blind Deconvolution of MIMO System, IEEE International Symposium on Circuits and Systems,1997, pp:2517-2520.
[153]L Devroye, L Gyrofi, G Lugosi, A Probablistic Theory of Pattern Recognition, New York:Springer,1996.
[154]M. R. Azimi-Sadjadi, S. A. Zekavat, Cloud Classification Using Support Vector Machine, Processing of the 2000 IEEE Geoscience and Remote Sensing Symposium, 2000, pp:669-671.
[155]Xizhao Wang, Junfen Chen, Multiple Neural Networks Fusion Model Based on Choquet Fuzzy Integral, Proceedings of 3th International Conference on Machine Learning and Cybernetics,2004, pp:2024-2027.
[156]Keun Chan Kwak, Witold Pedrycz, Face Recognition using Fuzzy Integral and Wavelet Decomposition Method, IEEE Transactions on Systems, Man, and Cybernetics—Part B:Cybernetics, Vol.34, No.4, Apr.2004, pp:1666-1675.
[157]Y Mallet, D Coomans, J Kautsky, Classification Using Adaptive Wavelets for Feature Extraction, IEEE Transaction Pattern analysis and machine intelligence, Vol.19, No.10, Oct.1997,pp:1058-1066.
[158]Luay Azzam, Ender Ayanoglu, Reduced complexity sphere decoding via a reordered lattice representation, IEEE Transactions on Communications, Vol.57, No.9, Sep.2009, pp:2564-2569.
[159]Jubo Zhu, Feng He, Fengxia Yan, Zelong Wang, A New SVM Multi-Class Classification Method Based on Error-Correcting Code, International Conference on Computational Intelligence and Security,2008, pp:21-24.
[160]Yuan Li, Application of Fuzzy Pattern Recognition on Fingerprint Processing, Second International Conference on Intelligent Computation Technology and Automation,2009, pp:660-663.
[161]Irie Bunpei, Akagi Takuma, Hamamura Tomoyuki, Bayesian Best-First Search for Pattern Recognition-Application to Address Recognition,10th International Conference on Document Analysis and Recognition,2009, pp:461-465.
[162]Ying Gao, Shuxia Guo, Band adaptive modulation pattern recognition method research,3rd International Conference on Anti-counterfeiting, Security, and Identification in Communication,2009, pp:1-4.
[163]A.K. Nandi, E.E. Azzouz, Algorithms for Automatic Modulation Recognition of Communication Signals, IEEE Transactions on Communication, vol.46, no.4, April 1998, pp:431-436.
[164]C-D. Chung, A. Polydoros, Envelope-Based Classification Schemes for Continuous-Phase Binary Frequency-Shift-Keyed Modulations. Proceedings of IEEE MILCOM'94, vol.3, Oct.1994, pp:796-800.
[165]Huang, C.Y., Polydoros, A., Likelihood methods for MPSK modulation classification, IEEE Transactions on Communications, Vol.43, No.2-4, Feb.-Apr.1995, pp:1493-1504.
[166]J. Hagenauer, E. Offer et L. Papke., Iterative decoding of binary block and convolutional codes, IEEE Transactions on Information Theory, Vol.42, No.2, Feb. 1996,pp:429-445.
[167]J.S. Leon.,A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Transaction on Information Theory, Vol.34, No.5, May 1988,pp:1.354-1359.
[168]G. Ungerboeck, Trellis-Coded Modulation with Redundant Signal Sets Part I: Introduction, IEEE Commun.Mag., vol.25, No.1, Jan.1987, pp:5-11.
[169]G. Ungerboeck, Trellis-Coded Modulation with Redundant Signal Sets Part II: State of the Art, IEEE Commun.Mag., vol.25, No.1, Jan.1987, pp:12-21.
[170]Lu P Z, Zou Y., Fast computation of Grobner basis of homogenous ideals of F[x, y], Science in China Ser. F Information Science, vol.51, No.4, Apr.2008, pp:368-380.
[171]邹艳,陆佩忠,关键方程的新推广.计算机学报,2006,29(5)：712-718.
[172]Wang Feng-hua, Huang Zhi-tao, Zhou Yi-yu., A Method for Blind Recognition of Convolution Code Based Euclidean Algorithm. IEEE International Conference on Wireless Communications, Shanghai:IEEE Press,2007, pp:1414-1417.
[173]Shu Lin, Daniel J. Costello. Jr., Error Control Coding (Second Edition), London: Prentice Hall,2004.
[174]刘玉君,信道编码(修订版),郑州：河南科学技术出版社,2001.
[175]王新梅,肖国镇,纠错码——原理与方法,西安：西安电子科技大学出版社,2001.
[176]张卫国,密码函数及其构造,西安电子科技大学博士论文,2006.
[177]P Elias, Coding for Noisy Channels, IRE Conv. Rec, vol.4,1955, pp:37-57.
[178]J M Wozencraft and B Reiffen, Sequential Decoding, MIT Press, Cambridge, 1961.
[179]J L Massey, Threshold Decoding, MIT Press, Cambridge,1961.
[180]A J Viterbi, Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Transactions on Information Theory, vol. IT-13, No.3, Mar.1967, pp:260-269.
[181]L R Bahl, J Cocke, F Jelinek, and J Raviv, Optimal Decoding of Linear Codes for Minimal Symbol Error Rate, IEEE Transactions on Information Theory, vol.IT-20, No.3, Mar.1974, pp:284-287.
[182]Jacobs, J. Heller, Viterbi Decoding for Satellite and Space Communication, IEEE Transactions on Communication Technology, vol.15, No.9, Sep.1971, pp:835-847.
[183]Che-Ho Wei, Yuh-Long Chen, Erratum:Convolutional coding for BPSK system with orthogonal sounding tone on fast Raleigh fading channel, Electronics Letters, vol.23, No.6, Mar.1987, pp:304-306.
[184]J.M. Nowack, M.A. Herro, Simulated Viterbi decoding using importance sampling, IEE Proceedings, vol.135, No.2, Feb.1998, pp:133-142.
[185]H.F. Rashvand, Effective minimum free distance for convolutional codes, Electronics Letters, vol.17, No.13, July 1981, pp:463-465.
[186]Seshadri N., Sundberg, C.E.W., List Viterbi decoding algorithms with applications, IEEE Transactions on Communications, vol.42, No.2-4, Feb.-Apr.1994, pp:313-323.
[187]柴先明,黄知涛,王丰华,信道编码盲识别问题研究,通信对抗,2008,2：33-36.
[188]黄知涛,柴先明,陆凤波,彭耿,姜文利,一种(n-1)/n码率的删除卷积码的盲识别方法,专利申请号：CN200810030735.3.
[189]Lu Pei-zhong, Shen Li, Luo Xiang-yang, Zou Yan, Blind recognition of punctured convolutional codes, IEEE International Symposium on Information Theory, Shanghai: IEEE Press,2004, pp:457-457.
[190]Lu Pei-zhong, Shen Li, Luo Xiang-yang, Zou Yan, Blind recognition of punctured convolutional codes Science in China Ser. F Information Science,, vol.48, No.4, Apr. 2005, pp:484-498.
[191]Begin G, Haccoun D, High-Rate Punctured Convolutional Codes:Structure Properties and Construction Techniques, IEEE Trans Comm, vol.37, No.11, Nov.1989, pp:1381-1385.
[192]Bernard Sklar, Digital Communication Fundamentals and Applications, Prentice Hall PTR, London,2001.
[193]邹艳,陆佩忠,朱雪岭,软判决快速相关攻击新算法与应用,计算机研究与发展,2006,44(4)：581-588.
[194]张彦仲,沈乃汉,快速傅里叶变换及沃尔什变换,北京：航空工业出版社,1989.
[195]Sundararajan O, Ahmad M O, Fast computation of the discrete Walsh and Hadamard transforms, IEEE Trans Image Processing,vol,7, No.6, June 1998 pp:898-904.
[196]Shanks J L, Computation of the fast Walsh-Fourier transform, IEEE Trans Computers, May 1969, pp:457-459.
[197]Lechner R.J., Comment on Computation of the Fast Walsh-Fourier Transform"1, IEEE Trans. Computers, Feb.1970, pp:174-174.
[198]Henderson K.W., Comment on Computation of the Fast Walsh-Fourier Transform, IEEE Trans. Computers, Sep.1970, pp:850-851.
[199]Henry Y L, Sheng C L, Fast Hadamard transform using the H diagram, IEEE Trans. Computers, Oct.1973, pp:957-960.
[200]Lee M H,Kaveh M, Fast Hadamard transform based on a simple matrix factorization, IEEE Trans Acoust Speech Signal Processing,vol.34, No.6, June 1986, pp:1666-1667.
[201]Coppersmith D,Faig E,Linzer E, Hadamard transforms on multiply/add architectures, IEEE Trans Signal Processing,vol.42, No.4. Apr.1994, pp:969-970.
[202]盛骤,谢式千,潘承毅等,概率论与数理统计,北京：高等教育出版社,2002.
[203]T. Richardson, R. Urbanke, Modern Coding Theory, Cambridge:Cambridge University Press,2007.
[204]易志强,黄智杰,王匡,DVB-S接收系统中内码信息的快速估计,浙江大学学报(工学版),2004,38(5)：549-553.
[205]DENNIS R. Satellite communication,3rd Edition, New York:McGraw-Hill,2001, pp:197-207.
[206]ETSI.EN300 421, European standard (Telecommunication series),Sophia Antipolis:ETSI,1997.
[207]Xilinx company, Viterbi decoder product specification,New York:Xilinx company,2007.
[208]孙即祥,现代模式识别,长沙：国防科技大学出版社,2002.
[2]C.E.Shannon, A mathematical theory of communication, Bell Syst.Tech.J., vol.27, Jul./Oct.1948, pp:379-423/623-656.
[3]曹志刚,钱亚生,现代通信原理,北京：清华大学出版社,1991.
[4]徐朝军,RS码译码算法及其实现研究,西安电子科技大学博士论文,2006.
[5]D.J.Costello Jr., J.Hagenauger, H.Imai, S.B. Wicker, Applications of error-control coding, IEEE Trans.Inform.Theory, vol.44, No.6, Oct.1998, pp:2531-2560.
[6]Verdu S., Fifty years of Shannon theory, IEEE Trans.Inform.Theory, vol.44, No.6, Oct.1998, pp:2057-2078.
[7]R.W.Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, Apri.1950, pp:147-160.
[8]D E Muller, Applications of Boolean algebra to Switching Circuits Design and to Error Detection, IRE Trans, vol.Ec-32,1954, pp:6-12.
[9]I S Reed, A Class of Multiple-Error-Correcting Codes and the Decoding Scheme, IRE Trans, vol.IT-4,1954, pp:38-49.
[10]E Prange, Cyclic Error-Correcting Codes in Two Symbols, AFCRC-TN-57,103, Air Force Cambridge Research Center, Cambridge, Mass,1957.
[11]A Hocquenghem, Codes corecteurs d'erreurs, Chiffres, vol.2,1959, pp:147-156.
[12]R C Bose and D K Ray-Chaudhuri, On a Class of Error Correcting Binary Group Codes, Inform. Control, vol.3,1960, pp:68-79.
[13]W W Peterson, Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes, IRE Trans. Inform. Theory, vol.IT-1,1960, pp:459-470.
[14]D Gorenstein and N Zierler, A Class of Cyclic linear Error-Correcting Codes in pm Symbols, J. Soc. Ind. Appl. Math., vol.9,1961,pp:107-214.
[15]I S Reed and G Solomon, Polynomial Codes over Certain Finite Fields, J. Soc. Ind. Appl. Math., vol.8,1960,pp:300-304.
[16]R T Chein, Cyclic Decoding Procedure for the Bose- Chaudhuri-Hocquenghem Codes, IEEE Trans. Inform. Theory, vol.IT-10, No.4,1964, pp:357-363.
[17]G D Forney, On Decoding BCH Codes, IEEE Trans. Inform. Theory, vol. IT-11, No.6,1965, pp:549-557.
[18]E R Berlekamp, On Decoding Binary Bose- Chaudhuri-Hocquenghem Codes, IEEE Trans. Inform. Theory, vol.IT-11, No.6,1965, pp:570-580.
[19]E R Berlekamp, Algebraic Coding Theory, McGraw-Hill New York,1968.
[20]J L Massey, Step-by-Step Decoding of the Bose- Chaudhuri-Hocquenghem Codes, IEEE Trans. Inform. Theory, vol.IT-11, No.6,1965, pp:580-585.
[21]J L Massey, Shift-Register Synthesis and BCH Decoding, IEEE Trans. Inform. Theory, vol.IT-11, No.2,1969, pp:122-127.
[22]H O Burton, Inversinonless Decoding of Binary BCH Codes, IEEE Trans. Inform. Theory, vol.IT-17, No.5,1971, pp:464-466.
[23]W C Core, Transmitting Binary Symbols with Reed-Solomon Codes, Proc. Conf. Infor. Sci. and Syst., Princeton, N. J.,1973, pp:495-97.
[24]R E Blahut, Transform Techniques for Error-Control Codes, IBM J. Res. Dev., vol.16,No.3,1979,pp:299-315.
[25]P Elias, Coding for Noisy Channels, IRE Conv. Rec., vol.4,No.1,1955, pp:37-47.
[26]J M Wozencraft and B Reiffen, Sequential Decoding, MIT Press, Cambridge,1961.
[27]J L Massey, Threshold Decoding, MIT Press, Cambridge,1963.
[28]A J Viterbi, Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Trans. Inform. Theory, vol. IT-13, No.3,1967, pp: 260-269.
[29]L R Baul, J Cocke, F Jelinek, and J Raviv, Optimal Decoding of Linear Codes for Minimal Symbol Error Rate, IEEE Trans. Inform. Theory, vol. IT-20,1974, pp:284-87.
[30]G D Forney, Jr, Concatenated Codes, MIT Press, Cambridge,1966.
[31]C.Berrou, A.Glavieux, P.Thitimasjshima, Near Shannon Limit Error-Correcting Coding and Decoding:Turbo Codes (1), ICC, Geneva, Switztland,1993, pp: 1064-1070.
[32]G Battail, M Decouvelaere, and P Godlewski, Replication Decoding, IEEE Trans. Inform. Theory, vol.IT-25, No.4,2009, pp:332-345.
[33]G Battail, Building Long Codes by Combination of Simple Ones, Thanks to Weighted-Output Decoding, Proc. URSI Intl. Symp. Signals, Systems, and Electronics, 1989, pp:634-67.
[34]J Hagenauer and P Hoeher, A Viterbi Algorithm with Soft-Decision Outputs and Its Applications, Proc. IEEE Global Commun. Conf.,1992, pp:1680-86.
[35]J H Lodge, P Hoeher, and J Hagenauer, The Decoding of Multidimensional Codes Using Separable MAP filters, Proc.16th Biennial Symp. Comm. Conf,1992, pp: 343-46.
[36]J D Andersen, The Turbo Coding Scheme, presented at IEEE Intl. Symp. Inform. Theory, Trondheim, Norway,1994.
[37]P Robertson, Illuminating the Structure of Code and Decoder of Parallel Concatenated Recursive Systematic Codes, Proc. IEEE Global Commun. Conf.,1994, pp:1298-1303.
[38]S Benedetto and G Montorsi, Unveiling Turbo Codes:Some Result on Parallel Concatenated Coding, IEEE Trans. Inform. Theory, vol. IT-42, No.3,1996, pp:409-428.
[39]S Benedetto and G Montorsi, Design of Parallel Concatenated Convolution Codes, IEEE Trans. Commun., vol.COM-44,1996, pp:591-600.
[40]L C Perez, J Seghers, and D J Costello, Jr, A Distance Spectrum Interpretation of Turbo Codes, IEEE Trans. Inform. Theory, vol. IT-42, No.7,1996, pp:1698-1709.
[41]G Barrail, A Conceptual Framework for Understanding Turbo Codes, IEEE J. Select. Areas Comm., vol. SAC-16, No.1,1998, pp:245-254.
[42]J Hagenauer, E Offer, and L Papke, Iterative Decoding of Binary Block and Convolutional Codes, IEEE Trans. Inform. Theory, vol. IT-42, No.2,1996, pp:429-445.
[43]J Hagenauer, The Turbo Principle:Tutorial Introduction and State of the Art, Proc. 1st Intl. Symp. Turbo Codes,1997, pp:1-11.
[44]R J McEliece, D. J MacKay, and J-F Cheng, Turbo Decoding As an Instance of Pearl's Belief Propagation Algorithm, IEEE J. Select. Areas Comm., vol.SAC-16, No.1, 1998, pp:140-152.
[45]A J Viterbi, An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes, IEEE J. Select. Areas Comm., vol.SAC-16, No.1, 1998, pp:260-264.
[46]D Divsalar and F Pollara, Multiple Turbo Codes for Deep-Space Communications, TDA Progress Report 42-121, Jet Propulsion Laboratory, Pasadena, Calif,1995.
[47]D Divsalar and F Pollara, On the Design of Turbo Codes, TDA Progress Report 42-123, Jet Propulsion Laboratory, Pasadena, Calif,1995.
[48]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, Jet Propulsion Laboratory, Pasadena, Calif,1996.
[49]S Dolinear, D Divsalar, and F Pollara, Code Perforrmance As a Function of Block Size, TMO Progress Report 42-133, Jet Propulsion Laboratory, Pasadena, Calif,1998.
[50]D Divsalar, and F Pollara, Serial and Hybrid Concatenated with Applications, Proc. 1st Intl. Symp. Turbo Codes,1997, pp:810-87.
[51]S Benedetto, D Divsalar, G Montorsi, and F Pollara, Analysis, Design and Iterative Decoding of Double Serially Concatenated Codes with Interleavers, IEEE J. Select. Areas Comm., vol.SAC-42, No.1,1998, pp:231-244.
[52]S Benedetto, D Divsalar, G Montorsi, and F Pollara, Serial Concatenation of Interleaved Codes:Performance Analysis, Design and Iterative Decoding, IEEE Trans. Inform. Theory, vol. IT-44, No.1,1998, pp:209-226.
[53]C Heegard and S B Wicker, Turbo Coding, Kluwer Academic, Boston, Mass., 1999.
[54]J Pearl, Probabilistic Reasoning in Intelligent Systems:Networks of Plausible Inference, Morgan Kaufmann, San Mateo, Calif.,1988.
[55]R G Gallager, Low Density Parity Check Codes, IRE Trans. Inform. Theory, vol.IT-8, No.1,1962, pp:21-28.
[56]R G Gallager, Low Density Parity Check Codes, MIT Press, Cambridge,1963.
[57]D J C MacKay and R M Neal, Near Shannon Limit Performance of Low Density Parity Check Codes, Electron. Letter, vol.32, No.18, Aug.1996, pp:1645-1646.
[58]M Sipser and D Spielman, Expander Codes, IEEE Trans. Inform. Theory, vol.42, No.6, Nov.1996, pp:1710-1722.
[59]A. Valembois, Detection and recognition of a binary linear code, Discrete Applied Mathematics, vol.111,2001, pp:199-218.
[60]C. Mathieu, Block code reconstruction using interative decoding techniques, IEEE International Symposium on Information Theory,2006, pp:2269-2273.
[61]C. Christophe, Recogniton of a code in a noisy environment, IEEE International Symposium on Information Theory,2007, pp:2211-2215.
[62]Robert H. Morelos-Zaragoza, The Art of Error Correcting Coding, London:Wiley, 2007.
[63]Gao, M., Li, L.,Wang, Z.,Lin, J.,Sha, J, Decoder Design for RS-Based LDPC Codes, IEEE Transactions on Circuits and Systems II:Express Briefs, vol.56, No.9, Sep.2009, pp:724-728.
[64]El-Samie Fathi Abd, Elazm Atef Abou, El-Fishawy Nawal, Shebl Seif, A random construction of LDPC codes using a sub-optimal search algorithm, National Radio Science Conference,2009,pp:c06(1-10).
[65]Rezard Vincent, Pacalet Renaud Amador, Erick, Optimum LDPC decoder:A memory architecture problem, ACM/IEEE Design Automation Conference,2009, pp: 892-896.
[66]Daneshrad, B., Cavus, E., Computationally efficient decoding of LDPC codes, Electronics Letters, vol.45, No.18,27th Aug.2009.
[67]He, He Yun, He, Chen, Hang, Jian-Bing, Research on Regular LDPC Codes with better Performance than Turbo Codes, WASE International Conference on Information Engineering,2009, pp:390-393.
[68]Rasmussen Lars, Lechner Gottfried, Land Ingmar, Adaptive decoding of LDPC codes with binary messages, IEEE International Symposium on Information Theory, 2009, pp:2146-2150.
[69]Sakaniwa Kohichi, Shibuya Tomoharu, Declercq David, Poulliat Charly, Kasai Kenta, Weight distribution of non-binary LDPC codes, International Symposium on Information Theory and Its Applications,2008, pp:212-217.
[70]Yanan Shen, Xinhui Si, Yan Cui, A novel algorithm of constructing LDPC codes with graph theory, IEEE Conference on Cybernetics and Intelligent Systems,2008, pp: 602-605.
[71]M.H. Todayon, M. Esmaeili, A novel approach to generating long low-density parity-check codes using two configurations, IET Communications, vol.2, No.4, Apr.2008, pp:587-597.
[72]Rosnes, E., Ytrehus, Y, Improved algorithms for the determination of turbo-code weight distributions, IEEE Transactions on Communications, vol.53, No.1, Jan.2005, pp:20-26.
[73]Fragouli C., Wesel R.D, Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation, IEEE Transactions on Communications, vol.49, No.3, Mar.2001, pp:425-435.
[74]Dave S., Junghwan Kim, Kwatra S.C., An efficient decoding algorithm for block turbo codes, IEEE Transactions on Communications, vol.49, No.1, Mar.2001, pp: 41-46.
[75]Frenger P., Turbo decoding for wireless systems with imperfect channel estimates, IEEE Transactions on Communications, vol.48, No.9, Sept.2000, pp:1437-1440.
[76]Souvignier T.V., Oberg M., Siegel P.H., Swanson R.E., Wolf J.K., Turbo decoding for partial response channels, IEEE Transactions on Communications, vol.48, No.8, Aug.2000,pp:1297-1308.
[77]Acikel O.F., Ryan W.E., Punctured turbo-codes for BPSK/QPSK channels, IEEE Transactions on Communications, vol.47, No.9, Sept.2000, pp:1315-1323.
[78]Cathy Ye Liu, Heng Tang, Shu Lin, Fossorier M.P.C., An interactive concatenated turbo coding system, IEEE Transactions on Vehicular Technology, vol.51, No.5, Sept.2002, pp:998-1010.
[79]Xiaodong Wang, Rong Chen, Blind turbo equalization in Gaussian and impulsive noise, IEEE Transactions on Vehicular Technology, vol.50, No.4, July 2001, pp: 1092-1105.
[80]Ferrari M., Bellini S., Existence and uniqueness of the solution for turbo decoding of parallel concatenated single parity check codes, IEEE Transactions on Information Theory, vol.49, No.3, Mar.2003, pp:722-725.
[81]Greferath M., Byrne E., Skachek V., Flanagan M. F., Linear-Programming Decoding of Nonbinary Linear Codes, IEEE Transactions on Information Theory, vol.55, No.9, Sep.2009, pp:4134-4154.
[82]Koscielny C., Constructing a better cyclic code than cyclic Reed-Solomon code, IEEE Transactions on Information Theory, vol.41, No.4, July 1995, pp:1191-1194.
[83]Michel Jezequel, Patrick Adde, Christophe Jego, Camille Leroux, On the higher efficiency of parallel Reed-Solomon turbo-decoding, IEEE International Conference on Electronics, Circuits and Systems,2008, pp:1308-1311.
[84]Il Ho Kim, Hyoung June Ko, A New Approach to Decoding of BCH and Reed-Solomon Codes Using Syzygy, Data Compression Conference,2007, pp: 387-387.
[85]Dianwu Yue; Hongbo Zhu, On the minimum distance of composite-length BCH codes, IEEE Communications Letters, vol.3, No.9, Sept.1999, pp:269-271.
[86]Kamiya N, On algebraic soft-decision decoding algorithms for BCH codes, IEEE Transactions on Information Theory, vol.47, No.1, Jan.2001, pp:45-58.
[87]T. M. Cover, Shannon, investment, IEEE Inform. Theory Newslett.(Special Golden Jubilee Issue), Summer 1998, pp:10-11.
[88]D. J. Sakrison, The rate of a class of random processes, IEEE Trans. Inform. Theory, vol. IT-16, No.1, Jan.1970, pp:10-16.
[89]K. Ramchandran, A. Ortega, K. Uz, M. Vetterli, Multiresolution broadcast for digital HDTV using joint source channel coding, IEEE J. Select. Areas Commun., vol. 11, No.1, Jan.1993,pp:6-23.
[90]H. Sato, The capacity of the Gaussian interference channel under strong interference, IEEE Trans. Inform. Theory, vol. IT-27, No.8, Nov.1981, pp:786-788.
[91]M. H. M. Costa, A. E. Gamal, The capacity region of the discrete memoryless interference channel with strong interference, IEEE Trans. Inform. Theory, vol. IT-33, No.8, Sept.1987, pp:710-711.
[92]Y. S. Liu, B. L. Hughes, A new universal random coding bound for the multiple-access channel, IEEE Trans. Inform. Theory, vol.42, No.2, Mar.1996, pp: 376-386.
[93]J.L. Shanks, Computation of the Fast Walsh-Fourier Transform, IEEE Trans. Computers, vol.18, no.5, May 1969, pp:457-459.
[94]W.K. Cham, R.J. Clarke, Dyadic Symmetry and Walsh Matrices, Proc. IEE, Pt. F., vol.134, no.2, Apr.1987,pp:141-145.
[95]Y. Hel-Or, H. Hel-Or, Real Time Pattern Matching Using Projection Kernels, IEEE Trans. Pattern Analysis and Machine Intelligence, vol.27, no.9, Sept.2005, pp: 1430-1445.
[96]C.M. Mak, N. Li, W.K. Cham, Fast Motion Estimation in Walsh Hadamard Domain, Proc. Int'l Symp. Intelligent Signal Processing and Comm. Systems, Dec.2005, pp: 349-352.
[97]Cham, W.K., Ouyang, Wanli, Fast Algorithm for Walsh Hadamard Transform on Sliding Windows, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 32, No.1, Jan.2010, pp:165-171.
[98]T. A. Brubaker, P.R. Risch, Evaluation of data reconstruction using Walsh functions, Electronics Letters, Vol.9, No.21, Oct.1973, pp:489-490.
[99]D.A. Bell, Walsh functions and Hadamard matrixes, Electronics Letters, Vol.2, No.9, Sep.1966, pp:340-341.
[100]C. K. Yuen, K. G. Beauchamp, Walsh Functions and Their Applications, IEEE Transactions on Systems, Man and Cybernetics, Nov.1976, pp:794-795.
[101]Rom-Shen Kao, Taylor F.J., A Fast Galois-Field Transform Algorithm Using Normal Bases,1990 Conference Record Twenty-Fourth Asilomar Conference on Signals, Systems and Computers, Nov.1990, pp:511-515.
[102]Yupu Hu, Qiong Liu, A Fast Correlation Attack via Parallel Computing, Fifth International Conference on Information Assurance and Security,2009, pp:651-654.
[103]Chen Wanzhi, An improved algorithm for fast correlation attack on stream ciphers, 7th World Congress on Intelligent Control and Automation,2008, pp:2126-2129.
[104]Mihaljevic M.J., Fossorier M.P.C., Imai H., An improved fast correlation attack based on list decoding, IEEE International Symposium on Information Theory,2003, pp:165-165.
[105]Jonsson F., Johansson T., Theoretical analysis of a correlation attack based on convolutional codes, IEEE International Symposium on Information Theory,2000, pp: 212-212.
[106]Wang Li-Ping, An algorithm for computing bidirectional minimal polynomials for multisequences, IEEE International Symposium on Information Theory,2009, pp: 621-624.
[107]Meina Xu, Abdel-Ghaffar K., Shu Lin, Shumei Song, Jingyu Kang, Bo Zhou, Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions, IEEE Transactions on Communications, Vol.57, No.6, June 2009, pp:1652-1662.
[108]Y. Zheng, C. Xiao, Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms, IEEE Communicaiton Letter, vol.6, no.6, June 2002, pp: 256-258.
[109]A. Bennatan, D. Burshtein, Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels, IEEE Trans. Inform. Theory, vol.52, no.2, Feb. 2006, pp:549-583.
[110]D. Declercq, M. Fossorier, Decoding algorithms for nonbinary LDPC codes over GF(q), IEEE Trans. Commun., vol.54, no.4, Apr.2007, pp:633-643.
[111]Y. Kou, S. Lin, M. Fossorier, Low-density parity-check codes based on finite geometries:a rediscovery and new results, IEEE Trans. Inform. Theory, vol.47, no.7, Nov.2001, pp:2711-2736.
[112]S.Y. Chung, T. J. Richardson, R. L. Urbanke, Analysis of sumproduct decoding of low-density parity-check codes using a Gaussian approximation, IEEE Trans. Inform. Theory, vol.47, no.2, Feb.2001, pp:657-670.
[113]J. Ha, S. W. McLaughlin, Low-density parity-check codes over Gaussian channels with erasures," IEEE Trans. Inform. Theory, vol.49, no.7, July 2003, pp:1801-1809.
[114]W. J. Gross, F. R. Kschischang, R. Kotter, and P. G. Gulak, Applications of algebraic soft-decision decoding of Reed-Solomon codes, IEEE Trans. Commun., vol. 54, no.7, July 2006, pp:1224-1234.
[115]Z. Li, L. Chen, L. Zeng, S. Lin, W. Fong, Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol.54, no.1, Jan.2006, pp: 71-81.
[116]Ding Z.,Lin S.,Tai Y.Y.,Kang J.,Zhou B., High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries LDPC Codes on Euclidean Geometries, IEEE Transactions on Communications, Vol.57, No.5, May 2009, pp: 1398-1311.
[117]Yingquan Wu, New List Decoding Algorithms for Reed-Solomon and BCH Codes, IEEE International Symposium on Information Theory,2007, pp:2807-2810.
[118]Jean-Charles Faugere, Magali Bardet, Daniel Augot, On formulas for decoding binary cyclic codes, IEEE International Symposium on Information Theory,2007, pp: 2646-2650.
[119]Koga K., A simple decoding of BCH codes over GF(2m), IEEE Transactions on Communications, Vol.46, No.6, June 1998, pp:709-716.
[120]Egorov S., Markarian G, Pickavance K., A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Communications, Vol.52, No.12, Dec.2004, pp:2052-2056.
[121]Henkel W., An extended Berlekamp-Massey algorithm for the inversion of Toeplitz matrices, IEEE Transactions on Communications, Vol.40, No.10, Oct.1992, pp: 1557-1561.
[122]Kotter R., A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes, IEEE Transactions on Information Theory, Vol.44, No.4, July 1998, pp:1353-1368.
[123]Sakata S., Jensen H.E., Hoholdt T., Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound, IEEE Transactions on Information Theory, Vol.41, No.6, Nov.1995, pp:1762-1768.
[124]Dabiri D., Blake I.F., Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials, IEEE Transactions on Information Theory, Vol.41, No. 4, July 1995, pp:873-885.
[125]Gao Wen, Lei Jing, Code-Matched Interleaver Design over Surrogate Channels, IEEE Wireless Communications and Networking Conference,2009, pp:1-6.
[126]Yilmaz A.O., Gazi O., Collision free row column S-random interleaver, IEEE Communications Letters, Vol.3, No.4, Apr.2009, pp:257-259.
[127]Rui Lv, Kun Luo, Ping Shi, Interleaver Design for Turbo-Based Distributed Video Coding,4th International Conference on Wireless Communications, Networking and Mobile Computing,2008, pp:1-5.
[128]Peter Adam Hoeher, Pin Yao, Dapeng Hao, Analysis and design of interleaver sets for interleave-division multiplexing and related techniques,5th International Symposium on Turbo Codes and Related Topics,2008, pp:432-437.
[129]Yu-Chuan Fang, Yan-Xiu Zheng, Apply bit-level interleaver to improve the error rate performance of the double binary turbo code with less decoder complexity,5th International Symposium on Turbo Codes and Related Topics,2008, pp:118-122.
[130]S.Q. Li, S. Tong, D.S. Lin, Joint linear interleaver design for concatenated zigzag codes, Electronics Letters, Vol.44, No.19,11th Sep.2009, pp:1-2.
[131]Nabil Ouddane, Pavel Kromer, Jan Platos, Vaclav Snasel, Genetic Algorithms Searching for Turbo Code Interleaver and Solving Linear Ordering Problem,7th Computer Information Systems and Industrial Management Applications,2008, pp: 71-76.
[132]Yumin Wang, Xinjun Du, Hui Li, Ying Wang, The Design of Optimal Period Interleaver,22nd International Conference on Advanced Information Networking and Applications-Workshops,2008, pp:413-145.
[133]Snasel Vaclav, Kramer Pavel, Ouddane Nabril, Genetic Algorithms for Turbo Code Interleaver Optimization, Seventh International Conference on Intelligent Systems Design and Applications,2007, pp:279-282.
[134]Li Teng, Collins Oliver M., A Random Interleaver Based Successive Decoding Scheme over Markov Channels, IEEE Information Theory Workshop,2007, pp: 162-167.
[135]Pena Carlos J., Salehi Masoud, Optimal Interleaver Design for Short Block-length Turbo Codes, International Symposium on Signals, Systems and Electronics,2007, pp: 295-298.
[136]Wang Z., Li Q., Very Low-Complexity Hardware Interleaver for Turbo Decoding,, IEEE Transactions on Circuits and Systems Ⅱ, Vol.54, No.7, July 2007, pp:636-640.
[137]Qilian Liang, Lingming Wang, Channel coding and interleaver for secure wireless sensor networks, IEEE Wireless Communications and Networking Conference,2006, pp:1973-1977.
[138]Chauvet W., Lacaze B., Roviras D., Study of the Effect of Interleavers on the Power Spectral Density Application to the Matrix Interleaver,2006 IEEE International Conference on Acoustics, Speech and Signal Processing,2006, pp:545-547.
[139]Daneshgaran F., Laddomada M., Reduced Complexity Interleaver Growth Algorithm for Turbo Codes, IEEE Transactions on Wireless Communications, Vol.4, No.3, May 2005, pp:954-964.
[140]Dawson E., Design of a discrete cosine transform based speech scrambler, Electronics Letters, Vol.27, No.7, Mar.1993, pp:613-614.
[141]Bossert M., Dieterich H., Shavgulidze S., Partitioning of convolutional codes using a convolutional scrambler, Electronics Letters, Vol.32, No.9, Sep.1996, pp: 1758-1760.
[142]Cluzeau M., Reconstruction of a linear scrambler, International Symposium on Information Theory,2004, pp:234-234.
[143]Rice M., Tretter S., Mathys P., On differentially encoded M-sequences, IEEE Transactions on Communications, Vol.49, No.3, Mar.2001, pp:421-424.
[144]Lie-Liang Yang, Hanzo L., Acquisition of m-sequences using recursive soft sequential estimation, IEEE Transactions on Communications, Vol.52, No.2, Feb.2004, pp:199-204.
[145]Komo J.J., Liu S.C., Maximal length sequences for frequency hopping, IEEE Journal on Selected Areas in Communications, Vol.8, No.5, June 1990, pp:819-822.
[146]Lee Y. H., Tantaratana S., Sequential acquisition of PN sequences for DS/SS communications:design and performance, IEEE Journal on Selected Areas in Communications, Vol.10, No.4, May 1992, pp:750-759.
[147]Lee L. S., Chiu J. H., An improved sequential estimation scheme for PN acquisition, IEEE Transactions on Communications, Vol.36, No.10, Oct.1988, pp:1182-1184.
[148]Carlet C. Improving the algebraic immunity of resilient and nonlinear functions and constructing bent functions.http://eprint.iacr.org/2004/276,2004.
[149]Dalai D K, Gupta K C, Maitra M. Results on Algebraic Immunity for Cryptographically Significant Boolean Functions.Ganteaut A and Viswanathan K. Progress in Cryptology,2004, pp:92-106.
[150]Marvin K. Simon, Sam Dolinar, Improving SNR Estimation for Autonomous Receivers, IEEETransactions on Communications, Vol.53, No.6, June 2005, pp: 1063-1073
[151]Ofir shalvi, Ehud Weinstein, Super-Exponential Methods for Blind Deconvolution, IEEE Transactions on InformationTheory, Vol.39, No.2, Feb.1993, pp:504-519.
[152]Ka Lok Yeung, Sze fong Yau, A Super-Exponential Algorithm for Blind Deconvolution of MIMO System, IEEE International Symposium on Circuits and Systems,1997, pp:2517-2520.
[153]L Devroye, L Gyrofi, G Lugosi, A Probablistic Theory of Pattern Recognition, New York:Springer,1996.
[154]M. R. Azimi-Sadjadi, S. A. Zekavat, Cloud Classification Using Support Vector Machine, Processing of the 2000 IEEE Geoscience and Remote Sensing Symposium, 2000, pp:669-671.
[155]Xizhao Wang, Junfen Chen, Multiple Neural Networks Fusion Model Based on Choquet Fuzzy Integral, Proceedings of 3th International Conference on Machine Learning and Cybernetics,2004, pp:2024-2027.
[156]Keun Chan Kwak, Witold Pedrycz, Face Recognition using Fuzzy Integral and Wavelet Decomposition Method, IEEE Transactions on Systems, Man, and Cybernetics—Part B:Cybernetics, Vol.34, No.4, Apr.2004, pp:1666-1675.
[157]Y Mallet, D Coomans, J Kautsky, Classification Using Adaptive Wavelets for Feature Extraction, IEEE Transaction Pattern analysis and machine intelligence, Vol.19, No.10, Oct.1997,pp:1058-1066.
[158]Luay Azzam, Ender Ayanoglu, Reduced complexity sphere decoding via a reordered lattice representation, IEEE Transactions on Communications, Vol.57, No.9, Sep.2009, pp:2564-2569.
[159]Jubo Zhu, Feng He, Fengxia Yan, Zelong Wang, A New SVM Multi-Class Classification Method Based on Error-Correcting Code, International Conference on Computational Intelligence and Security,2008, pp:21-24.
[160]Yuan Li, Application of Fuzzy Pattern Recognition on Fingerprint Processing, Second International Conference on Intelligent Computation Technology and Automation,2009, pp:660-663.
[161]Irie Bunpei, Akagi Takuma, Hamamura Tomoyuki, Bayesian Best-First Search for Pattern Recognition-Application to Address Recognition,10th International Conference on Document Analysis and Recognition,2009, pp:461-465.
[162]Ying Gao, Shuxia Guo, Band adaptive modulation pattern recognition method research,3rd International Conference on Anti-counterfeiting, Security, and Identification in Communication,2009, pp:1-4.
[163]A.K. Nandi, E.E. Azzouz, Algorithms for Automatic Modulation Recognition of Communication Signals, IEEE Transactions on Communication, vol.46, no.4, April 1998, pp:431-436.
[164]C-D. Chung, A. Polydoros, Envelope-Based Classification Schemes for Continuous-Phase Binary Frequency-Shift-Keyed Modulations. Proceedings of IEEE MILCOM'94, vol.3, Oct.1994, pp:796-800.
[165]Huang, C.Y., Polydoros, A., Likelihood methods for MPSK modulation classification, IEEE Transactions on Communications, Vol.43, No.2-4, Feb.-Apr.1995, pp:1493-1504.
[166]J. Hagenauer, E. Offer et L. Papke., Iterative decoding of binary block and convolutional codes, IEEE Transactions on Information Theory, Vol.42, No.2, Feb. 1996,pp:429-445.
[167]J.S. Leon.,A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Transaction on Information Theory, Vol.34, No.5, May 1988,pp:1.354-1359.
[168]G. Ungerboeck, Trellis-Coded Modulation with Redundant Signal Sets Part I: Introduction, IEEE Commun.Mag., vol.25, No.1, Jan.1987, pp:5-11.
[169]G. Ungerboeck, Trellis-Coded Modulation with Redundant Signal Sets Part II: State of the Art, IEEE Commun.Mag., vol.25, No.1, Jan.1987, pp:12-21.
[170]Lu P Z, Zou Y., Fast computation of Grobner basis of homogenous ideals of F[x, y], Science in China Ser. F Information Science, vol.51, No.4, Apr.2008, pp:368-380.
[171]邹艳,陆佩忠,关键方程的新推广.计算机学报,2006,29(5)：712-718.
[172]Wang Feng-hua, Huang Zhi-tao, Zhou Yi-yu., A Method for Blind Recognition of Convolution Code Based Euclidean Algorithm. IEEE International Conference on Wireless Communications, Shanghai:IEEE Press,2007, pp:1414-1417.
[173]Shu Lin, Daniel J. Costello. Jr., Error Control Coding (Second Edition), London: Prentice Hall,2004.
[174]刘玉君,信道编码(修订版),郑州：河南科学技术出版社,2001.
[175]王新梅,肖国镇,纠错码——原理与方法,西安：西安电子科技大学出版社,2001.
[176]张卫国,密码函数及其构造,西安电子科技大学博士论文,2006.
[177]P Elias, Coding for Noisy Channels, IRE Conv. Rec, vol.4,1955, pp:37-57.
[178]J M Wozencraft and B Reiffen, Sequential Decoding, MIT Press, Cambridge, 1961.
[179]J L Massey, Threshold Decoding, MIT Press, Cambridge,1961.
[180]A J Viterbi, Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Transactions on Information Theory, vol. IT-13, No.3, Mar.1967, pp:260-269.
[181]L R Bahl, J Cocke, F Jelinek, and J Raviv, Optimal Decoding of Linear Codes for Minimal Symbol Error Rate, IEEE Transactions on Information Theory, vol.IT-20, No.3, Mar.1974, pp:284-287.
[182]Jacobs, J. Heller, Viterbi Decoding for Satellite and Space Communication, IEEE Transactions on Communication Technology, vol.15, No.9, Sep.1971, pp:835-847.
[183]Che-Ho Wei, Yuh-Long Chen, Erratum:Convolutional coding for BPSK system with orthogonal sounding tone on fast Raleigh fading channel, Electronics Letters, vol.23, No.6, Mar.1987, pp:304-306.
[184]J.M. Nowack, M.A. Herro, Simulated Viterbi decoding using importance sampling, IEE Proceedings, vol.135, No.2, Feb.1998, pp:133-142.
[185]H.F. Rashvand, Effective minimum free distance for convolutional codes, Electronics Letters, vol.17, No.13, July 1981, pp:463-465.
[186]Seshadri N., Sundberg, C.E.W., List Viterbi decoding algorithms with applications, IEEE Transactions on Communications, vol.42, No.2-4, Feb.-Apr.1994, pp:313-323.
[187]柴先明,黄知涛,王丰华,信道编码盲识别问题研究,通信对抗,2008,2：33-36.
[188]黄知涛,柴先明,陆凤波,彭耿,姜文利,一种(n-1)/n码率的删除卷积码的盲识别方法,专利申请号：CN200810030735.3.
[189]Lu Pei-zhong, Shen Li, Luo Xiang-yang, Zou Yan, Blind recognition of punctured convolutional codes, IEEE International Symposium on Information Theory, Shanghai: IEEE Press,2004, pp:457-457.
[190]Lu Pei-zhong, Shen Li, Luo Xiang-yang, Zou Yan, Blind recognition of punctured convolutional codes Science in China Ser. F Information Science,, vol.48, No.4, Apr. 2005, pp:484-498.
[191]Begin G, Haccoun D, High-Rate Punctured Convolutional Codes:Structure Properties and Construction Techniques, IEEE Trans Comm, vol.37, No.11, Nov.1989, pp:1381-1385.
[192]Bernard Sklar, Digital Communication Fundamentals and Applications, Prentice Hall PTR, London,2001.
[193]邹艳,陆佩忠,朱雪岭,软判决快速相关攻击新算法与应用,计算机研究与发展,2006,44(4)：581-588.
[194]张彦仲,沈乃汉,快速傅里叶变换及沃尔什变换,北京：航空工业出版社,1989.
[195]Sundararajan O, Ahmad M O, Fast computation of the discrete Walsh and Hadamard transforms, IEEE Trans Image Processing,vol,7, No.6, June 1998 pp:898-904.
[196]Shanks J L, Computation of the fast Walsh-Fourier transform, IEEE Trans Computers, May 1969, pp:457-459.
[197]Lechner R.J., Comment on Computation of the Fast Walsh-Fourier Transform"1, IEEE Trans. Computers, Feb.1970, pp:174-174.
[198]Henderson K.W., Comment on Computation of the Fast Walsh-Fourier Transform, IEEE Trans. Computers, Sep.1970, pp:850-851.
[199]Henry Y L, Sheng C L, Fast Hadamard transform using the H diagram, IEEE Trans. Computers, Oct.1973, pp:957-960.
[200]Lee M H,Kaveh M, Fast Hadamard transform based on a simple matrix factorization, IEEE Trans Acoust Speech Signal Processing,vol.34, No.6, June 1986, pp:1666-1667.
[201]Coppersmith D,Faig E,Linzer E, Hadamard transforms on multiply/add architectures, IEEE Trans Signal Processing,vol.42, No.4. Apr.1994, pp:969-970.
[202]盛骤,谢式千,潘承毅等,概率论与数理统计,北京：高等教育出版社,2002.
[203]T. Richardson, R. Urbanke, Modern Coding Theory, Cambridge:Cambridge University Press,2007.
[204]易志强,黄智杰,王匡,DVB-S接收系统中内码信息的快速估计,浙江大学学报(工学版),2004,38(5)：549-553.
[205]DENNIS R. Satellite communication,3rd Edition, New York:McGraw-Hill,2001, pp:197-207.
[206]ETSI.EN300 421, European standard (Telecommunication series),Sophia Antipolis:ETSI,1997.
[207]Xilinx company, Viterbi decoder product specification,New York:Xilinx company,2007.
[208]孙即祥,现代模式识别,长沙：国防科技大学出版社,2002.