基于因子图的迭代接收机设计与优化
|
摘要
迭代接收技术能够大大提高系统性能，因子图是一种用于分析和设计迭代接收机的有效工具。本论文对于两种基于因子图的迭代接收结构进行了深入的研究。主要工作包括：
1．对IDMA原理进行深入研究，包括：(1)运用因子图对交织分多址接入(IDMA)的迭代多用户检测问题进行分析，并与CDMA的因子图相比较，分析IDMA能够采用低复杂度迭代检测算法的原因，(2)用和积算法的一般准则推导IDMA检测算法，揭示IDMA低复杂度检测算法与因子图上和积算法的内在联系。(3)用EXIT图对未编码IDMA系统和卷积编码IDMA系统进行分析，研究信道编码方式对于IDMA系统性能的影响。
2．对等功率IDMA系统进行了优化设计，包括：(1)对未编码IDMA系统中消息之间的相关性进行分析，在此基础上设计了一种PEG交织器，改进未编码IDMA系统性能；(2)将LDPC码用于多址接入信道，设计了多用户LDPC编码和LDPC编码IDMA两种方案，设计了一种针对IDMA低复杂度检测算法的高斯近似密度进化方法，将这种方法与差分进化方法相结合对用于多址接入信道的非规则LDPC码进行优化。
3．设计了一种用于B3G系统的基于IDMA的单步随机接入信道。将IDMA用于B3G系统随机接入信道的资源请求数据传输。设计了完整的单步随机接入信道，包括前导码和资源请求数据，提出了一种基于峰均比检测的前导码检测算法并对其性能进行分析；通过在数据部分加入子标识的方法，使得基于IDMA的单步随机接入具有更低的碰撞概率。
4．研究了m序列迭代捕获有关的三个问题，包括：(1)非相干差分迭代捕获算法及序列还原：利用m序列的差分特性，设计了一种差分和积迭代捕获算法，并利用m序列的相差约束特性，设计了一种低复杂度的差分序列还原算法。(2)多个m序列的并行迭代捕获问题：将m序列的迭代捕获和LDPC多用户编码结合起来，设计了一种低复杂度的多个m序列并行迭代捕获算法。(3)生成多项式非“稀疏”的m序列并行迭代捕获的因子图优化问题：利用m序列的采样特性和相差约束特性，结合LDPC码因子图的优化设计理论，对生成多项式非“稀疏”的m序列因子图进行优化设计，获得了良好的迭代捕获性能。
Iterative receiver technology can improve the system performance dramatically. Factor graph is a powful tool to analyze and design iterative receiver. In this thesis, several iterative systems are analyzed intensively. The main topics include:
1．IDMA systems are studied intensively. The main contributions include: (l)The problem of iterative multiuser detection for IDMA system is analyzed by using factor graph. The factor graph representation of IDMA system is compared with that of CDMA system. The reason for that IDMA can use low complexity detection algorithm is analyzed. (2) The detection algorithm of IDMA system is derived by using the universal rule of sum-product algorithm and the inner relationship between the IDMA detection algorithm and the sum-product on factor graph is also discovered. (3) EXIT charts technology is used to analyze the performance of uncoded IDMA and convolutional coded IDMA systems. The effect of channel coding scheme on IDMA systems is studied.
2．IDMA system with equal power constrains is optimized. The main contributions include: (1) Correlation among the messeges in uncoded IDMA systems is analyzed. A kind of interleavers, named by PEG interleavers is designed for uncoded IDMA system. (2) LDPC codes are used to multiple access channel. Two schemes, named by multiuser LDPC coding and LDPC-coded IDMA, respectively, are proposed and the corresponding message update rules for three kinds of nodes are designed. A Gaussian approximation method is designed these update rule. Differential evolution, combined with Gaussian approximation technology, is used to optimize the irregular LDPC codes for these schemes.
3．An IDMA based one step random access channel structure is designed for B3G systems. IDMA is used as the transportation mode for the resource request message part. The whole RACH channel structure, including preamble part and message part, is designed for one-step random access. The preamble detection algorithm is designed and analyzed. By inserting several bits in the message part as addition ID, the IDMA-based one step access scheme has lower collision probility than conventional schemes.
4．Three problems about iterative acquisition for m sequence are studied. The main contributions include: (1) Non-coherent differential iterative acquisition for m sequence. By using the differential property of m sequence, a differential iterative sum-product acquisition algorithm is designed. A simple method to find original sequence phase with known differential sequence phase is designed. (2) The problem of parallelized iterative acquisition for multiple access. By combining the low complexity multiuser detection algorithm for IDMA and the sum-product iterative acquisition algorithm for m sequences, a parallelized iterative acquisition algorithm is proposed for multiple m sequences. (3) The problem of iterative acquisition for m sequence with non-sparse generating polynomial. By using the sampling property and the phase difference constrains property of m sequenece, aided by the LDPC codes optimization theory, the factor graph representation of m sequenece with "non-sparse" generating polynomial is optimized and good acquisition performance is acquired.
1．对IDMA原理进行深入研究，包括：(1)运用因子图对交织分多址接入(IDMA)的迭代多用户检测问题进行分析，并与CDMA的因子图相比较，分析IDMA能够采用低复杂度迭代检测算法的原因，(2)用和积算法的一般准则推导IDMA检测算法，揭示IDMA低复杂度检测算法与因子图上和积算法的内在联系。(3)用EXIT图对未编码IDMA系统和卷积编码IDMA系统进行分析，研究信道编码方式对于IDMA系统性能的影响。
2．对等功率IDMA系统进行了优化设计，包括：(1)对未编码IDMA系统中消息之间的相关性进行分析，在此基础上设计了一种PEG交织器，改进未编码IDMA系统性能；(2)将LDPC码用于多址接入信道，设计了多用户LDPC编码和LDPC编码IDMA两种方案，设计了一种针对IDMA低复杂度检测算法的高斯近似密度进化方法，将这种方法与差分进化方法相结合对用于多址接入信道的非规则LDPC码进行优化。
3．设计了一种用于B3G系统的基于IDMA的单步随机接入信道。将IDMA用于B3G系统随机接入信道的资源请求数据传输。设计了完整的单步随机接入信道，包括前导码和资源请求数据，提出了一种基于峰均比检测的前导码检测算法并对其性能进行分析；通过在数据部分加入子标识的方法，使得基于IDMA的单步随机接入具有更低的碰撞概率。
4．研究了m序列迭代捕获有关的三个问题，包括：(1)非相干差分迭代捕获算法及序列还原：利用m序列的差分特性，设计了一种差分和积迭代捕获算法，并利用m序列的相差约束特性，设计了一种低复杂度的差分序列还原算法。(2)多个m序列的并行迭代捕获问题：将m序列的迭代捕获和LDPC多用户编码结合起来，设计了一种低复杂度的多个m序列并行迭代捕获算法。(3)生成多项式非“稀疏”的m序列并行迭代捕获的因子图优化问题：利用m序列的采样特性和相差约束特性，结合LDPC码因子图的优化设计理论，对生成多项式非“稀疏”的m序列因子图进行优化设计，获得了良好的迭代捕获性能。
Iterative receiver technology can improve the system performance dramatically. Factor graph is a powful tool to analyze and design iterative receiver. In this thesis, several iterative systems are analyzed intensively. The main topics include:
1．IDMA systems are studied intensively. The main contributions include: (l)The problem of iterative multiuser detection for IDMA system is analyzed by using factor graph. The factor graph representation of IDMA system is compared with that of CDMA system. The reason for that IDMA can use low complexity detection algorithm is analyzed. (2) The detection algorithm of IDMA system is derived by using the universal rule of sum-product algorithm and the inner relationship between the IDMA detection algorithm and the sum-product on factor graph is also discovered. (3) EXIT charts technology is used to analyze the performance of uncoded IDMA and convolutional coded IDMA systems. The effect of channel coding scheme on IDMA systems is studied.
2．IDMA system with equal power constrains is optimized. The main contributions include: (1) Correlation among the messeges in uncoded IDMA systems is analyzed. A kind of interleavers, named by PEG interleavers is designed for uncoded IDMA system. (2) LDPC codes are used to multiple access channel. Two schemes, named by multiuser LDPC coding and LDPC-coded IDMA, respectively, are proposed and the corresponding message update rules for three kinds of nodes are designed. A Gaussian approximation method is designed these update rule. Differential evolution, combined with Gaussian approximation technology, is used to optimize the irregular LDPC codes for these schemes.
3．An IDMA based one step random access channel structure is designed for B3G systems. IDMA is used as the transportation mode for the resource request message part. The whole RACH channel structure, including preamble part and message part, is designed for one-step random access. The preamble detection algorithm is designed and analyzed. By inserting several bits in the message part as addition ID, the IDMA-based one step access scheme has lower collision probility than conventional schemes.
4．Three problems about iterative acquisition for m sequence are studied. The main contributions include: (1) Non-coherent differential iterative acquisition for m sequence. By using the differential property of m sequence, a differential iterative sum-product acquisition algorithm is designed. A simple method to find original sequence phase with known differential sequence phase is designed. (2) The problem of parallelized iterative acquisition for multiple access. By combining the low complexity multiuser detection algorithm for IDMA and the sum-product iterative acquisition algorithm for m sequences, a parallelized iterative acquisition algorithm is proposed for multiple m sequences. (3) The problem of iterative acquisition for m sequence with non-sparse generating polynomial. By using the sampling property and the phase difference constrains property of m sequenece, aided by the LDPC codes optimization theory, the factor graph representation of m sequenece with "non-sparse" generating polynomial is optimized and good acquisition performance is acquired.
引文
[1] C. E. Shannon, "The Mathematical Theory of Communications." BSTJ, vol.27, July-Oct. 1948, pp379～423, 623～656
[2] Gallager, R. G., "Low density parity check codes", IRE Trans. Info. Theory, 1962, IT-8, pp 21-28.
[3] D. J. C. MacKay, R. M. Neal, "Near Shannon limit performance of low-density parity-check codes", IEE Electronics. Lett., vol.32, no 18, Aug. 1996, pp1645～1646
[4] D. Divsalar, H. Jin, and R. J. McEliece, "Coding .theorems for 'turbo-like' codes", in Proc. 36th Allerton Conf., Urbana, IL, Sept. 23-25, 1998, pp 201-210.
[5] P. Li, X.Huang, ENam, "Zigzag codes and concatenated zigzag codes", IEEE Trans. on Inform. Theory, Vol.47, No. 2, Feb. 2001, pp800～807
[6] R.M. Pyndiah, "Near optimum decoding of product codes: Block turbo codes", IEEE Trans. Comm., vol.46, Aug. 1998, pp 1003～1010
[7] M. Tuchler, R. Koener, and A. C. Singer, "Turbo equalization: principles and new results", IEEE Trans. on Commun., Vol.50, No. 5, May 2002, pp
[8] M. Sellathurai and S. Haykin, "Turbo-blast for wireless communications: theory and experiments" IEEE Trans. on Signal Processing, vol. 50, no. 10, pp. 2538-2546, Oct. 2002. pp
[9] X. Li and J.A. Ritcey. "Trellis-coded modulation with bit interleaving and iterative decoding". IEEE Journal on Selected Areas in Comm., Vol. 17, No.4, April 1999.
[10] N.Goerta. "On the iterative approximation of optimal joint source-channel decoding. IEEE Journal on selected Areas in Communications", Vol. 14, No.9 2001, 1662～1670
[11] X.Wang and H. V. Poor, "Iterative (turbo) soft interference cancellation and decoding for coded CDMA," IEEE Trans. Commun., vol. 47, pp. 1046-1061
[12] C. Komninakis and R. D. Wesel, "Iterative joint channel estimation and decoding in flat correlated Rayleigh fading," in Proc. 7th Int. Conf. Advances in Communications and Control, Athens, Greece, June 1999.1, July 1999.
[13] Burr, A. G. and Zhang, L., "Iterative joint synchronisation and turbo decoding," IEEE International Symposium on Information Theory, June. 2002. pp. 414
[14] T. Richardson, R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Trans. Inform. Theory, vol.47, Feb. 2001, pp599～618
[15] S.Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[16] H. El Gamal and A. R. Hammons, "Analyzing the turbo decoder using the Gaussian approximation," IEEE J. Select. Areas Commun., vol. 47, pp, 671-686, Feb. 2001.
[17] S.T.Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans. Communications, vol.49, No. 10, Oct.2001,1727～1736
[18] D. Divsalar, S. Dolinar, and F. Pollara, "Low complexity turbo-like codes," in Proc. 2nd Int. Symp. Turbo Codes, Sept. 2000, pp. 73-80.
[19] S. Y. Chung, G. D. Forney, T. Richardson, R. Urbanke,"On the design of low-density parity-check codes within 0.0045dB of the Shannon limit", IEEE Comm. Letters, vol.5, Feb. 2001, pp58～60
[20] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[21] J. Boutros, G. Caire "Iterative multiuser joint decoding: unified framework and asymptotic analysis", IEEE Trans.Info.Theory, Vol.48, July, 2002. ,pp. 1772-1793
[22] Hermosilla and Szczeciriski, "EXIT Charts for Turbo receiver in MIMO systems", pp.209-212
[23] Lee, Singer and Shanbhag, "Analysis of Linear Turbo Equalizer via EXIT Chart", Procdeeding of IEEE Globecom'03, Nov. 2003, pp. 2237-2242
[24] Kai Li, Xiaodong Wang, "EXIT chart analysis of turbo multiuser detection", IEEE Transactions on, Wireless Communications, Vol. 4, No.1, Jan. 2005 pp.300-311
[25] Kovintavewat, P. and Barry, J. R., "EXIT chart analysis for iterative timing recovery," Proc. of IEEE Globecom'04, Nov. 2004, pp.2435-2439
[26] Kschischang F R, Frey B J, and Loeliger H," Factor graphs and the sum-product algorithm", IEEE Trans. on Info. Theory, Vol.47, No.2. Feb. 2001, pp.498-519
[27] R.M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, Vol. 27, No. 9, Sept. 1981., pp. 533-547
[28] N.Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linkoping Univ., Linkoping, Sweden, 1996.
[29] Li Ping, K. Y. Wu, Lihai Liu and W. K. Leung, "A simple, unified approach to nearly optimal multiuser detection and space-time coding," Information Theory Workshop, ITW'02. Oct. 2002, pp. 53-56.
[30] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[31] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "On interleave-division multiple-access," Proc. of IEEE Intern. Conf. on Commun., ICC'04, pp. 2869-2873.
[32] Li Ping and Lihai Liu, "Analysis and design of IDMA systems based on SNR evolution and power allocation," in Proc. VTC'2004-Fall, Los Angeles, CA. Sept. 2004.
[33] R. L. Peterson, R. E. Ziemer, and D. E. Borth, Introduction to Spread-Spectrum Communications. Englewood Cliffs, Prentice-Hall, 1995.
[34] A. Polydoros and C. L. Weber, "A unified approach to serial search spread-spectrum code acquisition," IEEE Trans. Commun., vol. 32, no.5, pp. 542-560, May 1984.
[35] M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook. New York: McGraw-Hill, 1994.
[36] L. L. Yang and L. Hanzo, "Iterative soft sequential estimatition assisted acquisition of m-sequences," Electron. Lett., vol. 38,, Nov. 2002.pp. 1550-1551
[37] L. L. Yang and L. Hanzo, "Acquisition of m-sequences using recursive soft sequential estimation," IEEE Trans. Commun., Vol. 52, No. 2, Feb. 2004, pp. 199-204,
[38] L. L. Yang and L. Hanzo, "Differential Acquisition of m-Sequences Using Recursive Soft Sequential Estimation", IEEE Trans. Wireless Communications, Vol. 4, No. 1, Jan. 2005, pp. 128-136
[39] K. M. Chugg and M. Zhu, "A new approach to rapid PN code acquisition using iterative message passing techniques", IEEE J. on Sel. Areas in Commun., Vol.23, No.5, May2005, pp.884-895
[1] Li Ping, K. Y. Wu, Lihai Liu and W. K. Leung, "A simple, unified approach to nearly optimal multiuser detection and space-time coding," Information Theory Workshop, ITW'02. Oct. 2002, pp. 53-56.
[2] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[3] Li Ping, Lihai Liu, Keying Wu and W. K. Leung, "Approach the capacity of multiple access channels using interleaved low rate codes," IEEE International Symposium on Information Theory, ISIT'03, p. 311.
[4] Xiaodong Wang, H. Vincent Poor, Wireless Communication Systems: Advanced Techniques for Signal Reception, Prentice Hail, 2003
[5] Verdu, Multiuser detection, Cambridge University Press, New York,1998.
[6] A. J. Viterbi, "Very low rate convolutional codes for maximum theoretical performance of spread spectrum multiple-access channels," IEEE J. Select. Areas Commun., vol. 8, pp. 641-649, Aug. 1990.
[7] Kschischang F R, Frey B J, and Loeliger H," Factor graphs and the sum-product algorithm", IEEE Trans. on Info. Theory, Vol.47, No.2. Feb. 2001, pp.498-519
[8] L. Bahl, J. Cocke, F. Jeinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, Vol. 20, No.3, Mar. 1974., pp. 248-287
[9] Y. Kabashima, "A CDMA multiuser detection algorithm on the basis of belief propagation," J. Phys. A: Math. Gen., vol. 36, Oct. 2003. pp. 11111-11121
[10] Joseph Boutros and Giuseppe Caire,"Iterative Multiuser Joint Decoding: Unified Framework and Asymptotic Analysis",IEEE Trans. on Info. Theory, Vol. 48, No. 7, July 2002, pp. 1772-1793
[11] X.Wang and H. V. Poor, "Iterative (turbo) soft interference cancellation and decoding for coded CDMA," IEEE Trans. Commun., vol. 47, pp. 1046-1061
[12] F. Brannstrom, L. K. Rasmussen, and A. J. Grant, S.,"Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes", IEEE Trans. on Ifo. Theory, Vol.51, No.9, Sept.,2005 pp.3354-3364
[13] D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005.
[14] T. Cover, J.A. Thomas, Elements of Information Theory. Wiley, 1991
[15] J. Boutros, G. Caire "Iterative multiuser joint decoding: unified framework and asymptotic analysis", IEEE Trans.Info.Theory, Vol.48, July, 2002. ,pp. 1772-1793
[16] F. N. Brannstrom, T. M. Aulin, and L. K. Rasmussen, "Iterative decoders for trellis code multiple-access," IEEE Trans. Commun., vol. 50, Sept. 2002, pp.1478-1485
[17] P. Frenger, P. Orten, and T. Ottosson, "Code-spread CDMA using maximum free distance low-rate convolutional codes,"IEEE Trans. Commun., vol. 48, no. 1,, Jan. 2000, pp. 135-144.
[18] Hui Jin, "Analysis and design of Turbo-like Codes", Ph.d Disstertation, California Institute of Technology, May 2003
[19] Li Ping, Lihai Liu, "Approaching the Capacity of Multiple Access Channels Using Interleaved Low-Rate Codes", IEEE Commu. Letters, Vol. 8, No. 1, Jan. 2004, pp.4-5
[20] 李云洲，周世东，王 京，”IDMA．OFDM系统的频谱效率”，清华大学学报(自然科学版)，第45卷，第3期，2005年3月，pp341．343
[21] S. Zhou, Y. Li, M. Zhao, X. Xu, J.Wang, and Y. Yao, "Novel techniques to improve downlink multiple access capacity for B3G," IEEE Commun. Mag., vol. 43, pp.61-69, Jan. 2005.
[22] P. Wang, J.X iao and Li Ping, "Comparison of Orthogonal and Non-Orthogonal Approaches to Future Wireless Cellar Systems", IEEE Vehicular Technology Magazine, vol. 1, no. 3, Sept. 2006 pp. 4-11
[1] D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005.
[2] T. Cover, J. A. Thomas, Elements of Information Theory. Wiley, 1991
[3] T. Richardson, R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Trans. Inform. Theory, vol.47, Feb. 2001, pp599～618
[4] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[5] 盛骤，谢式千，潘承毅，概率论与数理统计，高等教育出版社，1989年8月
[6] S.Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[7] Ben Lu, Guosen Yue and Xiaodong Wang, "Performance Analysis and Design Optimization of LDPC-Coded MIMO OFDM Systems", IEEE Trans. on Signal Processing, Vol.52, No.2, Feb 2004, pp.348-361
[8] Amichai Sanderovich, Michael Peleg, and Shlomo Shamai (Shiz), "LDPC Coded MIMO Multiple Access With Iterative Joint Decoding", IEEE Trans. on Info.Theory, Vol. 51, No. 4, April. 2005, pp.1437-1450
[9] S.T.Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans. Communications, vol.49, No. 10, Oct.2001,1727-1736
[10] D. Divsalar, S. Dolinar, and F. Pollara, "Low complexity turbo-like codes," in Proc. 2nd Int. Symp. Turbo Codes, Sept. 2000, pp. 73-80.
[11] M. Tuchler and J. Hagenahuer, "EXIT charts of irregular codes," in 2002 Conf. on Information Sciences and Systems, March. 2002.
[12] Lee, Singer and Shanbhag, "Analysis of Linear Turbo Equalizer via EXIT Chart", Procdeeding of IEEE Globecom'03, Nov. 2003, pp. 2237-2242
[13] Hermosilla and Szczeciriski, "EXIT Charts for Turbo receiver in MIMO systems", pp.209-212
[14] Kai Li, Xiaodong Wang, "EXIT chart analysis of turbo multiuser detection", IEEE Transactions on, Wireless Communications, Vol. 4, No.1, Jan. 2005 pp.300-311
[23] H. El Gamal and A. R. Hammons, "Analyzing the turbo decoder using the Gaussian approximation," IEEE J. Select. Areas Commun., vol. 47, pp. 671-686, Feb. 2001.
[24] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[25] Li Ping and Lihai Liu, "Analysis and design of IDMA systems based on SNR evolution and power allocation," in Proc. VTC'2004-Fall, Los Angeles, CA. Sept. 2004.
[1] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[2] H. Wu, L. Ping and A. Perotti, "User-specific chip-level interleaver design for IDMA systems", Electronic Letters, Vol.42, No.4, pp21-22
[3] Ioachim Pupeza, Aleksandar Kavcic and Li Ping, "Efficient Generation of Interleavers for IDMA," IEEE ICC 2006 proceedings, June, 2006
[4] Alberto Tarable, Guido Montorsi, and Sergio Benedetto,"Analysis and Design of Interleavers for Iterative Multiuser Receivers in Coded CDMA Systems", IEEE Trans. on Info. Theory, Vol.51, No.5, May 2005, pp.1650-1656
[5] J. Proakis, Digital Communications 4th Edition, Newyork: MacGraw-Hill, 2001
[6] T. K. Moon, Error Correction coding: Mathmatical Methods and Algorithms, Wiley, 2005
[7] Jungpil Yu, M. L. Boucheret, R. Vallet, A. Duverdier, et. al., "Interleaver Design for Turbo Codes From Convergence Analysis", IEEE Trans. on Commun., Vol.54, No.4, April 2006, pp.619-624
[8] X. Hu, E. Eleftheriou, D.M.Arnold,"Progressive edge-growth Tanner graphs", Proceeding of IEEE Global Telecommunications Conference, 2001(GLOBECOM '01), Vol. 2, Nov.2001, pp.995-1001
[1] Li Ping, Lihai Liu, "Approaching the Capacity of Multiple Access Channels Using Interleaved Low-Rate Codes", IEEE Commu. Letters, Vol. 8, No. 1, Jan. 2004, pp.4-5
[2] Kai Li, Xiaodong Wang, Li Ping, "Analysis and optimization of Interleave-division Multiple-access Communication Systems", Proc.of ICASSP 2005, March 2005, pp.3-91-920
[3] R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
[4] D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, Mar. 1999.pp. 399-431
[5] S.Y. Chung, G. D. Forney, T. Richardson, R. Urbanke,"On the design of low-density parity-check codes within 0.0045dB of the Shannon limit", IEEE Comm. Letters, vol.5, Feb. 2001, pp58～60
[6] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[7] J. Hou, P. Siegel, and L. Milstein, "Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels," IEEE Journal on Selected Areas in Communications, vol. 19, no. 5, pp. 924-934, May 2001.
[8] Guosen Yue, Code Optimization and Analysis for Multiple-input and Multiple-output Communication Systems, Texas A&M University, Ph.D Dissertation, Aug.2004
[9] Ben Lu, Guosen Yue and Xiaodong Wang, "Performance Analysis and Design Optimization of LDPC-Coded MIMO OFDM Systems", IEEE Trans. on Signal Processing, Vol.52, No.2, Feb 2004, pp.348-361
[10] Guosen Yue, Xiaodong Wang,"IRA Code Design for MIMO System with Iterative Receivers", IEEE, pp567-570
[11] X. Wang, G. Yue, and K.R. Narayanan, "Optimization of LDPC-coded turbo CDMA systems," IEEE Transactions on Signal Processing, Vol.53, No.4, April 2005., pp.1500-1510
[12] Amichai Sanderovich, Michael Peleg, and Shlomo Shamai (Shiz), "LDPC Coded MIMO Multiple Access With Iterative Joint Decoding", IEEE Trans. on Info.Theory, Vol. 51, No. 4, April. 2005, pp.1437-1450
[13] Ravi Palanki, "Iterative Decoding for Wireless Networks", California Institute of Technology, Ph.d Dissertation, May, 2004
[14] Abdelaziz Amraouil, Sanket Dusad2, Rudiger Urbanke, "Achieving General Points in the 2-User Gaussian MAC Without Time-sharing or Rate-Splitting by Means of Iterative Coding", Proc. of IEEE ISIT 2003, Switzerland, June.2002, pp.334
[15] N.Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linkoping Univ., Link6ping, Sweden, 1996.
[16] S. Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[17] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[18] K. Price and R. Storn, "Differential evolution - a simple and effcient heuristic for global optimization over continuous spaces," Joumal of Global Optimization, Vol. 11, 1997., pp. 341-359
[19] X. Hu, E. Eleftheriou, D. M. Arnold, "Progressive edge-growth Tanner graphs", Proceeding of IEEE Global Telecommunications Conference, 2001(GLOBECOM '01), Vol. 2, Nov.2001, pp.995-1001
[1] 3GPP, TR 25.814, Physical Layer Aspects for Evolved uTRA , V7.1.0, [Online].Available: http://www.3gpp.org
[2] 3GPP, TR 25.913 V7.3.0, Requirements for Evolved UTRA (E-UTRA) and Evolved UTRAN (E-UTRAN), [Online]Available: http://www.3gpp.org
[3] 3GPP TSG RAN WG1, 3GPP R1-060226, Huawei, [Online]Available: http://www.3gpp.org
[4] Branislav M. Popovic, "Generalized Chirp-Like Polyphase Sequences with Optimum Correlation Properties", IEEE Trans. on Info. Theory, Vol. 38, No. 4, July 1992, pp1406-1409.
[5] D. C. Chu, "Polyphase Codes With Good Periodic Correlation Properties", IEEE Trans. on Info. Theory, July 1972, pp.531-532
[6] 牛凯，吴伟陵，“WCDMA系统下行链路CPICH信道捕获性能分析”，北京邮电大学学报，2003，Vol．26，No．1 pp．46-49．
[7] J. Proakis, Digital Communications 4th Edition, Newyork: MacGraw-Hill, 2001
[8] ITU-R M.1225, Guidelines for evaluation of radio transmission technologies for IMT-2000
[9] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[10] T. K. Moon, Error Correction coding:Mathmatical Methods and Algorithms, Wiley, 2005
[11] Koo Insoo, Shin Seokjoo, Kim Kiseon. "Performance analysis of random access channel in OFDMA systems", Proceedings of the 2005 Systems Communications, pp.128-133
[1] R. L. Peterson, R. E. Ziemer, and D. E. Borth, Introduction to Spread-Spectrum Communications. Englewood Cliffs, Prentice-Hall, 1995.
[2] A. Polydoros and C. L. Weber, "A unified approach to serial search spread-spectrum code acquisition," IEEE Trans. Commun., vol. 32, no.5, pp. 542-560, May 1984.
[3] M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook. New York: McGraw-Hill, 1994.
[4] L. L. Yang and L. Hanzo, "Iterative soft sequential estimatition assisted acquisition of m-sequences," Electron. Lett., vol. 38, ,Nov. 2002.pp. 1550-1551
[5] L. L. Yang and L. Hanzo, "Acquisition of m-sequences using recursive soft sequential estimation," IEEE Trans. Commun., Vol. 52, No. 2, Feb. 2004, pp. 199-204,
[6] L. L. Yang and L. Hanzo, "Differential Acquisition of m-Sequences Using Recursive Soft Sequential Estimation", IEEE Trans. Wireless Communications, Vol. 4, No. 1, Jan. 2005, pp. 128-136
[7] K. M. Chugg and M. Zhu, "A new approach to rapid PN code acquisition using iterative message passing techniques", IEEE J. on Sel. Areas in Commun., Vol.23, No.5, May 2005, pp.884-895
[8] 林雪红，吴伟陵，”LDPC码的并行译码算法”．北京邮电大学学报第28卷，第5期，2005年10月，pp．59-61
[9] J. Chen, M. P. C. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity check codes", IEEE Trans. on Commun, Vol.5, No.3, March 2002, pp.406-414.
[10] 林可翔，汪一飞，伪随机码的原理与应用，人民邮电出版社，1978年12月
[11] M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, "Analysis of low-density codes and improve designs using irregular graphs", Proc. 30th Annu. Symp. Theory of Computing, 1998, pp.249～258
[12] S. Y. Chung, G. D. Forney, T. Richardson, R. Urbanke,"On the design of low-density parity-check codes within 0.0045dB of the Shannon limit", IEEE Comm. Letters, vol.5, Feb. 2001, pp58～60
[13] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[14] K. Price and R. Stom, "Differential evolution - a simple and effcient heuristic for global optimization over continuous spaces," Journal of Global Optimization, Vol. 11, 1997., pp. 341-359
[15] S.Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[2] Gallager, R. G., "Low density parity check codes", IRE Trans. Info. Theory, 1962, IT-8, pp 21-28.
[3] D. J. C. MacKay, R. M. Neal, "Near Shannon limit performance of low-density parity-check codes", IEE Electronics. Lett., vol.32, no 18, Aug. 1996, pp1645～1646
[4] D. Divsalar, H. Jin, and R. J. McEliece, "Coding .theorems for 'turbo-like' codes", in Proc. 36th Allerton Conf., Urbana, IL, Sept. 23-25, 1998, pp 201-210.
[5] P. Li, X.Huang, ENam, "Zigzag codes and concatenated zigzag codes", IEEE Trans. on Inform. Theory, Vol.47, No. 2, Feb. 2001, pp800～807
[6] R.M. Pyndiah, "Near optimum decoding of product codes: Block turbo codes", IEEE Trans. Comm., vol.46, Aug. 1998, pp 1003～1010
[7] M. Tuchler, R. Koener, and A. C. Singer, "Turbo equalization: principles and new results", IEEE Trans. on Commun., Vol.50, No. 5, May 2002, pp
[8] M. Sellathurai and S. Haykin, "Turbo-blast for wireless communications: theory and experiments" IEEE Trans. on Signal Processing, vol. 50, no. 10, pp. 2538-2546, Oct. 2002. pp
[9] X. Li and J.A. Ritcey. "Trellis-coded modulation with bit interleaving and iterative decoding". IEEE Journal on Selected Areas in Comm., Vol. 17, No.4, April 1999.
[10] N.Goerta. "On the iterative approximation of optimal joint source-channel decoding. IEEE Journal on selected Areas in Communications", Vol. 14, No.9 2001, 1662～1670
[11] X.Wang and H. V. Poor, "Iterative (turbo) soft interference cancellation and decoding for coded CDMA," IEEE Trans. Commun., vol. 47, pp. 1046-1061
[12] C. Komninakis and R. D. Wesel, "Iterative joint channel estimation and decoding in flat correlated Rayleigh fading," in Proc. 7th Int. Conf. Advances in Communications and Control, Athens, Greece, June 1999.1, July 1999.
[13] Burr, A. G. and Zhang, L., "Iterative joint synchronisation and turbo decoding," IEEE International Symposium on Information Theory, June. 2002. pp. 414
[14] T. Richardson, R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Trans. Inform. Theory, vol.47, Feb. 2001, pp599～618
[15] S.Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[16] H. El Gamal and A. R. Hammons, "Analyzing the turbo decoder using the Gaussian approximation," IEEE J. Select. Areas Commun., vol. 47, pp, 671-686, Feb. 2001.
[17] S.T.Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans. Communications, vol.49, No. 10, Oct.2001,1727～1736
[18] D. Divsalar, S. Dolinar, and F. Pollara, "Low complexity turbo-like codes," in Proc. 2nd Int. Symp. Turbo Codes, Sept. 2000, pp. 73-80.
[19] S. Y. Chung, G. D. Forney, T. Richardson, R. Urbanke,"On the design of low-density parity-check codes within 0.0045dB of the Shannon limit", IEEE Comm. Letters, vol.5, Feb. 2001, pp58～60
[20] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[21] J. Boutros, G. Caire "Iterative multiuser joint decoding: unified framework and asymptotic analysis", IEEE Trans.Info.Theory, Vol.48, July, 2002. ,pp. 1772-1793
[22] Hermosilla and Szczeciriski, "EXIT Charts for Turbo receiver in MIMO systems", pp.209-212
[23] Lee, Singer and Shanbhag, "Analysis of Linear Turbo Equalizer via EXIT Chart", Procdeeding of IEEE Globecom'03, Nov. 2003, pp. 2237-2242
[24] Kai Li, Xiaodong Wang, "EXIT chart analysis of turbo multiuser detection", IEEE Transactions on, Wireless Communications, Vol. 4, No.1, Jan. 2005 pp.300-311
[25] Kovintavewat, P. and Barry, J. R., "EXIT chart analysis for iterative timing recovery," Proc. of IEEE Globecom'04, Nov. 2004, pp.2435-2439
[26] Kschischang F R, Frey B J, and Loeliger H," Factor graphs and the sum-product algorithm", IEEE Trans. on Info. Theory, Vol.47, No.2. Feb. 2001, pp.498-519
[27] R.M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, Vol. 27, No. 9, Sept. 1981., pp. 533-547
[28] N.Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linkoping Univ., Linkoping, Sweden, 1996.
[29] Li Ping, K. Y. Wu, Lihai Liu and W. K. Leung, "A simple, unified approach to nearly optimal multiuser detection and space-time coding," Information Theory Workshop, ITW'02. Oct. 2002, pp. 53-56.
[30] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[31] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "On interleave-division multiple-access," Proc. of IEEE Intern. Conf. on Commun., ICC'04, pp. 2869-2873.
[32] Li Ping and Lihai Liu, "Analysis and design of IDMA systems based on SNR evolution and power allocation," in Proc. VTC'2004-Fall, Los Angeles, CA. Sept. 2004.
[33] R. L. Peterson, R. E. Ziemer, and D. E. Borth, Introduction to Spread-Spectrum Communications. Englewood Cliffs, Prentice-Hall, 1995.
[34] A. Polydoros and C. L. Weber, "A unified approach to serial search spread-spectrum code acquisition," IEEE Trans. Commun., vol. 32, no.5, pp. 542-560, May 1984.
[35] M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook. New York: McGraw-Hill, 1994.
[36] L. L. Yang and L. Hanzo, "Iterative soft sequential estimatition assisted acquisition of m-sequences," Electron. Lett., vol. 38,, Nov. 2002.pp. 1550-1551
[37] L. L. Yang and L. Hanzo, "Acquisition of m-sequences using recursive soft sequential estimation," IEEE Trans. Commun., Vol. 52, No. 2, Feb. 2004, pp. 199-204,
[38] L. L. Yang and L. Hanzo, "Differential Acquisition of m-Sequences Using Recursive Soft Sequential Estimation", IEEE Trans. Wireless Communications, Vol. 4, No. 1, Jan. 2005, pp. 128-136
[39] K. M. Chugg and M. Zhu, "A new approach to rapid PN code acquisition using iterative message passing techniques", IEEE J. on Sel. Areas in Commun., Vol.23, No.5, May2005, pp.884-895
[1] Li Ping, K. Y. Wu, Lihai Liu and W. K. Leung, "A simple, unified approach to nearly optimal multiuser detection and space-time coding," Information Theory Workshop, ITW'02. Oct. 2002, pp. 53-56.
[2] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[3] Li Ping, Lihai Liu, Keying Wu and W. K. Leung, "Approach the capacity of multiple access channels using interleaved low rate codes," IEEE International Symposium on Information Theory, ISIT'03, p. 311.
[4] Xiaodong Wang, H. Vincent Poor, Wireless Communication Systems: Advanced Techniques for Signal Reception, Prentice Hail, 2003
[5] Verdu, Multiuser detection, Cambridge University Press, New York,1998.
[6] A. J. Viterbi, "Very low rate convolutional codes for maximum theoretical performance of spread spectrum multiple-access channels," IEEE J. Select. Areas Commun., vol. 8, pp. 641-649, Aug. 1990.
[7] Kschischang F R, Frey B J, and Loeliger H," Factor graphs and the sum-product algorithm", IEEE Trans. on Info. Theory, Vol.47, No.2. Feb. 2001, pp.498-519
[8] L. Bahl, J. Cocke, F. Jeinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, Vol. 20, No.3, Mar. 1974., pp. 248-287
[9] Y. Kabashima, "A CDMA multiuser detection algorithm on the basis of belief propagation," J. Phys. A: Math. Gen., vol. 36, Oct. 2003. pp. 11111-11121
[10] Joseph Boutros and Giuseppe Caire,"Iterative Multiuser Joint Decoding: Unified Framework and Asymptotic Analysis",IEEE Trans. on Info. Theory, Vol. 48, No. 7, July 2002, pp. 1772-1793
[11] X.Wang and H. V. Poor, "Iterative (turbo) soft interference cancellation and decoding for coded CDMA," IEEE Trans. Commun., vol. 47, pp. 1046-1061
[12] F. Brannstrom, L. K. Rasmussen, and A. J. Grant, S.,"Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes", IEEE Trans. on Ifo. Theory, Vol.51, No.9, Sept.,2005 pp.3354-3364
[13] D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005.
[14] T. Cover, J.A. Thomas, Elements of Information Theory. Wiley, 1991
[15] J. Boutros, G. Caire "Iterative multiuser joint decoding: unified framework and asymptotic analysis", IEEE Trans.Info.Theory, Vol.48, July, 2002. ,pp. 1772-1793
[16] F. N. Brannstrom, T. M. Aulin, and L. K. Rasmussen, "Iterative decoders for trellis code multiple-access," IEEE Trans. Commun., vol. 50, Sept. 2002, pp.1478-1485
[17] P. Frenger, P. Orten, and T. Ottosson, "Code-spread CDMA using maximum free distance low-rate convolutional codes,"IEEE Trans. Commun., vol. 48, no. 1,, Jan. 2000, pp. 135-144.
[18] Hui Jin, "Analysis and design of Turbo-like Codes", Ph.d Disstertation, California Institute of Technology, May 2003
[19] Li Ping, Lihai Liu, "Approaching the Capacity of Multiple Access Channels Using Interleaved Low-Rate Codes", IEEE Commu. Letters, Vol. 8, No. 1, Jan. 2004, pp.4-5
[20] 李云洲，周世东，王 京，”IDMA．OFDM系统的频谱效率”，清华大学学报(自然科学版)，第45卷，第3期，2005年3月，pp341．343
[21] S. Zhou, Y. Li, M. Zhao, X. Xu, J.Wang, and Y. Yao, "Novel techniques to improve downlink multiple access capacity for B3G," IEEE Commun. Mag., vol. 43, pp.61-69, Jan. 2005.
[22] P. Wang, J.X iao and Li Ping, "Comparison of Orthogonal and Non-Orthogonal Approaches to Future Wireless Cellar Systems", IEEE Vehicular Technology Magazine, vol. 1, no. 3, Sept. 2006 pp. 4-11
[1] D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005.
[2] T. Cover, J. A. Thomas, Elements of Information Theory. Wiley, 1991
[3] T. Richardson, R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Trans. Inform. Theory, vol.47, Feb. 2001, pp599～618
[4] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[5] 盛骤，谢式千，潘承毅，概率论与数理统计，高等教育出版社，1989年8月
[6] S.Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[7] Ben Lu, Guosen Yue and Xiaodong Wang, "Performance Analysis and Design Optimization of LDPC-Coded MIMO OFDM Systems", IEEE Trans. on Signal Processing, Vol.52, No.2, Feb 2004, pp.348-361
[8] Amichai Sanderovich, Michael Peleg, and Shlomo Shamai (Shiz), "LDPC Coded MIMO Multiple Access With Iterative Joint Decoding", IEEE Trans. on Info.Theory, Vol. 51, No. 4, April. 2005, pp.1437-1450
[9] S.T.Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Trans. Communications, vol.49, No. 10, Oct.2001,1727-1736
[10] D. Divsalar, S. Dolinar, and F. Pollara, "Low complexity turbo-like codes," in Proc. 2nd Int. Symp. Turbo Codes, Sept. 2000, pp. 73-80.
[11] M. Tuchler and J. Hagenahuer, "EXIT charts of irregular codes," in 2002 Conf. on Information Sciences and Systems, March. 2002.
[12] Lee, Singer and Shanbhag, "Analysis of Linear Turbo Equalizer via EXIT Chart", Procdeeding of IEEE Globecom'03, Nov. 2003, pp. 2237-2242
[13] Hermosilla and Szczeciriski, "EXIT Charts for Turbo receiver in MIMO systems", pp.209-212
[14] Kai Li, Xiaodong Wang, "EXIT chart analysis of turbo multiuser detection", IEEE Transactions on, Wireless Communications, Vol. 4, No.1, Jan. 2005 pp.300-311
[23] H. El Gamal and A. R. Hammons, "Analyzing the turbo decoder using the Gaussian approximation," IEEE J. Select. Areas Commun., vol. 47, pp. 671-686, Feb. 2001.
[24] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[25] Li Ping and Lihai Liu, "Analysis and design of IDMA systems based on SNR evolution and power allocation," in Proc. VTC'2004-Fall, Los Angeles, CA. Sept. 2004.
[1] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[2] H. Wu, L. Ping and A. Perotti, "User-specific chip-level interleaver design for IDMA systems", Electronic Letters, Vol.42, No.4, pp21-22
[3] Ioachim Pupeza, Aleksandar Kavcic and Li Ping, "Efficient Generation of Interleavers for IDMA," IEEE ICC 2006 proceedings, June, 2006
[4] Alberto Tarable, Guido Montorsi, and Sergio Benedetto,"Analysis and Design of Interleavers for Iterative Multiuser Receivers in Coded CDMA Systems", IEEE Trans. on Info. Theory, Vol.51, No.5, May 2005, pp.1650-1656
[5] J. Proakis, Digital Communications 4th Edition, Newyork: MacGraw-Hill, 2001
[6] T. K. Moon, Error Correction coding: Mathmatical Methods and Algorithms, Wiley, 2005
[7] Jungpil Yu, M. L. Boucheret, R. Vallet, A. Duverdier, et. al., "Interleaver Design for Turbo Codes From Convergence Analysis", IEEE Trans. on Commun., Vol.54, No.4, April 2006, pp.619-624
[8] X. Hu, E. Eleftheriou, D.M.Arnold,"Progressive edge-growth Tanner graphs", Proceeding of IEEE Global Telecommunications Conference, 2001(GLOBECOM '01), Vol. 2, Nov.2001, pp.995-1001
[1] Li Ping, Lihai Liu, "Approaching the Capacity of Multiple Access Channels Using Interleaved Low-Rate Codes", IEEE Commu. Letters, Vol. 8, No. 1, Jan. 2004, pp.4-5
[2] Kai Li, Xiaodong Wang, Li Ping, "Analysis and optimization of Interleave-division Multiple-access Communication Systems", Proc.of ICASSP 2005, March 2005, pp.3-91-920
[3] R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
[4] D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, Mar. 1999.pp. 399-431
[5] S.Y. Chung, G. D. Forney, T. Richardson, R. Urbanke,"On the design of low-density parity-check codes within 0.0045dB of the Shannon limit", IEEE Comm. Letters, vol.5, Feb. 2001, pp58～60
[6] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[7] J. Hou, P. Siegel, and L. Milstein, "Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels," IEEE Journal on Selected Areas in Communications, vol. 19, no. 5, pp. 924-934, May 2001.
[8] Guosen Yue, Code Optimization and Analysis for Multiple-input and Multiple-output Communication Systems, Texas A&M University, Ph.D Dissertation, Aug.2004
[9] Ben Lu, Guosen Yue and Xiaodong Wang, "Performance Analysis and Design Optimization of LDPC-Coded MIMO OFDM Systems", IEEE Trans. on Signal Processing, Vol.52, No.2, Feb 2004, pp.348-361
[10] Guosen Yue, Xiaodong Wang,"IRA Code Design for MIMO System with Iterative Receivers", IEEE, pp567-570
[11] X. Wang, G. Yue, and K.R. Narayanan, "Optimization of LDPC-coded turbo CDMA systems," IEEE Transactions on Signal Processing, Vol.53, No.4, April 2005., pp.1500-1510
[12] Amichai Sanderovich, Michael Peleg, and Shlomo Shamai (Shiz), "LDPC Coded MIMO Multiple Access With Iterative Joint Decoding", IEEE Trans. on Info.Theory, Vol. 51, No. 4, April. 2005, pp.1437-1450
[13] Ravi Palanki, "Iterative Decoding for Wireless Networks", California Institute of Technology, Ph.d Dissertation, May, 2004
[14] Abdelaziz Amraouil, Sanket Dusad2, Rudiger Urbanke, "Achieving General Points in the 2-User Gaussian MAC Without Time-sharing or Rate-Splitting by Means of Iterative Coding", Proc. of IEEE ISIT 2003, Switzerland, June.2002, pp.334
[15] N.Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linkoping Univ., Link6ping, Sweden, 1996.
[16] S. Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670
[17] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[18] K. Price and R. Storn, "Differential evolution - a simple and effcient heuristic for global optimization over continuous spaces," Joumal of Global Optimization, Vol. 11, 1997., pp. 341-359
[19] X. Hu, E. Eleftheriou, D. M. Arnold, "Progressive edge-growth Tanner graphs", Proceeding of IEEE Global Telecommunications Conference, 2001(GLOBECOM '01), Vol. 2, Nov.2001, pp.995-1001
[1] 3GPP, TR 25.814, Physical Layer Aspects for Evolved uTRA , V7.1.0, [Online].Available: http://www.3gpp.org
[2] 3GPP, TR 25.913 V7.3.0, Requirements for Evolved UTRA (E-UTRA) and Evolved UTRAN (E-UTRAN), [Online]Available: http://www.3gpp.org
[3] 3GPP TSG RAN WG1, 3GPP R1-060226, Huawei, [Online]Available: http://www.3gpp.org
[4] Branislav M. Popovic, "Generalized Chirp-Like Polyphase Sequences with Optimum Correlation Properties", IEEE Trans. on Info. Theory, Vol. 38, No. 4, July 1992, pp1406-1409.
[5] D. C. Chu, "Polyphase Codes With Good Periodic Correlation Properties", IEEE Trans. on Info. Theory, July 1972, pp.531-532
[6] 牛凯，吴伟陵，“WCDMA系统下行链路CPICH信道捕获性能分析”，北京邮电大学学报，2003，Vol．26，No．1 pp．46-49．
[7] J. Proakis, Digital Communications 4th Edition, Newyork: MacGraw-Hill, 2001
[8] ITU-R M.1225, Guidelines for evaluation of radio transmission technologies for IMT-2000
[9] Li Ping, Lihai Liu, K. Y. Wu and W. K. Leung, "Interleave-division multiple-access," IEEE Trans. On Wireless, Vol. 5, No.4, April 2006, pp.938-947
[10] T. K. Moon, Error Correction coding:Mathmatical Methods and Algorithms, Wiley, 2005
[11] Koo Insoo, Shin Seokjoo, Kim Kiseon. "Performance analysis of random access channel in OFDMA systems", Proceedings of the 2005 Systems Communications, pp.128-133
[1] R. L. Peterson, R. E. Ziemer, and D. E. Borth, Introduction to Spread-Spectrum Communications. Englewood Cliffs, Prentice-Hall, 1995.
[2] A. Polydoros and C. L. Weber, "A unified approach to serial search spread-spectrum code acquisition," IEEE Trans. Commun., vol. 32, no.5, pp. 542-560, May 1984.
[3] M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook. New York: McGraw-Hill, 1994.
[4] L. L. Yang and L. Hanzo, "Iterative soft sequential estimatition assisted acquisition of m-sequences," Electron. Lett., vol. 38, ,Nov. 2002.pp. 1550-1551
[5] L. L. Yang and L. Hanzo, "Acquisition of m-sequences using recursive soft sequential estimation," IEEE Trans. Commun., Vol. 52, No. 2, Feb. 2004, pp. 199-204,
[6] L. L. Yang and L. Hanzo, "Differential Acquisition of m-Sequences Using Recursive Soft Sequential Estimation", IEEE Trans. Wireless Communications, Vol. 4, No. 1, Jan. 2005, pp. 128-136
[7] K. M. Chugg and M. Zhu, "A new approach to rapid PN code acquisition using iterative message passing techniques", IEEE J. on Sel. Areas in Commun., Vol.23, No.5, May 2005, pp.884-895
[8] 林雪红，吴伟陵，”LDPC码的并行译码算法”．北京邮电大学学报第28卷，第5期，2005年10月，pp．59-61
[9] J. Chen, M. P. C. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity check codes", IEEE Trans. on Commun, Vol.5, No.3, March 2002, pp.406-414.
[10] 林可翔，汪一飞，伪随机码的原理与应用，人民邮电出版社，1978年12月
[11] M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, "Analysis of low-density codes and improve designs using irregular graphs", Proc. 30th Annu. Symp. Theory of Computing, 1998, pp.249～258
[12] S. Y. Chung, G. D. Forney, T. Richardson, R. Urbanke,"On the design of low-density parity-check codes within 0.0045dB of the Shannon limit", IEEE Comm. Letters, vol.5, Feb. 2001, pp58～60
[13] T. Richardson, A. Shokorollahi and R. Urbanke, "Design of capacity approaching irregular low density parity check codes" IEEE Transactions Information Theory, Vol. 47, Feb 2001, pp. 619-637
[14] K. Price and R. Stom, "Differential evolution - a simple and effcient heuristic for global optimization over continuous spaces," Journal of Global Optimization, Vol. 11, 1997., pp. 341-359
[15] S.Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001, pp. 657-670