重叠复用技术的理论分析与应用
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
重叠复用技术是基于重叠复用理论的多种技术的总称。从编码角度讲有重叠码分复用(OVCDM)和重叠时分复用(OVTDM)等等,从多址角度讲有重叠码分多址(OVCDMA)。本文主要研究两种广义并行传输技术(OVCDM、OVTDM)和重叠多址技术(OVCDMA)的检测算法以及它们如何与编码配合两个核心问题。
     OVCDM编码摆脱了有限域的束缚,将编码和调制统一起来,可以在低阶调制情况下获得高频谱效率。但是随着编码约束长度的增加,OVCDM译码复杂度大幅提高,需要采用次优或者快速算法来进行译码。论文中给出了多种简化和快速算法检测OVCDM的性能,包括Fano算法、Stack算法和并行检测算法。此外,文中还给出了一种不同于以前的实抽头系数的并行级联结构和性能情况分析。
     OVTDM是在时间域的符号重叠,也可以说是符号域的卷积编码关系,通过主动引人符号间干扰,可以在不扩展频谱前提下,在相同的时段内传送更多的信息比特。在研究了OVTDM在各种信道下的性能之后,又研究了MMSE-FDE和Stack算法解决OVTDM译码复杂度过高的问题。同时,为了进一步提高OVTDM的性能,着重研究了加编码的OVTDM的性能。
     OVCDMA采用扩展广义正交互补码组网,完全抑制了小区间干扰,将检测的压力转移到了小区内,并有包括扩展矩阵和分数级码片移位等多种方式增加码字利用率,可以等效的认为是OVCDM和OVTDM的结合。分数级码片移位、多码联合检测以及高阶调制导致复杂度过高的问题需要用快速算法来解决,诸如Fano算法、Stack算法和串行干扰抵消等算法检测OVCDMA的性能被——列出。而对于TD-OVCDMA,则主要研究了其天线是四发一收情况下,经过ITU-UrbanMacro信道时如何与编码配合获得分集增益的问题。在采用EXIT Chart图分析了ITU-UrbanMacro信道的特征曲线后,指出来Turbo均衡未获得迭代增益的原因。
Overlapped multiplexing technologies is general term of several kinds of technologies which are based on overlapped theory. From the angle of coding, there are overlapped code division multiplexing (OVCDM) and overlapped time division multiplexing (OVTDM). Overlapped code division multiple access (OVCDMA) is the technology from the angle of multiple access. The detection algorithms and coded overlapped techniques are main topics which have been discussed in paper.
     OVCDM can achieve higher spectral efficiency with low order modulation because of its coding out of Galois field and combining coding and modulation together. But detection complexity of OVCDM grows rapidly with constrain length increasing, which results in finding sub-optimal or fast algorithms to deal with that problem. Simplified and fast algorithms, such as Fano algorithm, stack algorithm and parallel detection algorithm, are introduced in the paper. Meanwhile, analysis of a real coefficient parallel concatenated code structure which is different with the previous parallel concatenated is given at the end of the chapter.
     OVTDM is a kind of symbols overlapped in time domain and forms a convolution relationship among symbols. Comparing with traditional time division multiplexing, it can transmit more bits within same time slot without spreading spectrum through introducing inter-symbol interference intentionally. In order to reduce the complexity of detection, MMSE-SIC and stack algorithms are adopted in decoding OVTDM after the OVTDM's performance in some typical channels being introduced. Performance of coded OVTDM is studied for the purpose of improving the performance of OVTDM.
     OVCDMA can eliminate inter-cell interference through using expanded generalized complementary orthogonal code groups in network designing. Although there are several ways to improve the efficiency of signature sequence, the complexity problem brought by factional chip shift, joint detection of multi signature sequences and high order modulation should be solved by fast algorithms. The performance of fast detection algorithms in OVCDMA, such as Fano algorithm, stack algorithm and serial interference cancellation, are discussed in the paper. Researches about TD-OVCDMA are focused on how to obtain diversity gain under the conditions of four transmitting antennas and one receiving antenna TD-SCDMA system in ITU-UrbanMacro channel. In that research, the reason of turbo equalization not obtaining iteration gain is given after analyzing the characteristic curve of ITU-UrbanMacro channel trough EXIT chart.
引文
[1]C. E. Shannon. "A mathematical theory of communication", Bell System Technical Journal,1948,379-427.
    [2]李道本. LAS-CDMA在3G及后3G中的应用前景,移动通信, No.7, pp.52-56, 2003.
    [3]韦惠民,李国民,暴宇.移动通信技术,北京:人民邮电出版社,第1章,2006.
    [4]Blake R.著,周金萍,唐伶俐译.无线通信技术,北京:科学出版社,2004.
    [5]Local and Metropolitan Area Networks—Part 16, "Air Interface for Fixed Broadband Wireless Access Systems", IEEE Standard IEEE 802.16e.
    [6]Weinstein S, Ebert P. "Data transmission by frequency-division multiplexing using the discrete Fourier transform", IEEE Transactions on Communications, 19(5),1971:628-634.
    [7]Bingham J A. "Multicarrier modulation for data transmission:an idea whose time has come", IEEE Communications Magazine,28(5),1990:5-14.
    [8]Nee R, Prasad R. OFDM for wireless multimedia communications, Boston: Artech House Publishers,2000.
    [9]Van Ouderaa E, Schoukens J, Renneboog J. "Peak factor minimization of input and output signals of linear systems", IEEE Transactions on Instrumentation and Measurement,37(2).1988:207-212.
    [10]Chen Q., Sousa E.S., and Pasupathy S.. "Performance of a coded multi-carrier DS-CDMA system in multi-path fading channels", Wireless Personal Communications,1995.
    [11JIEEE, Channel and propagation models for wireless system design I and II, IEEE JSAC,20(3,6), Apr./Aug.2002.
    [12]Abdi A., and Kaveh M.. "A space-time correlation model for multi-element antenna system in mobile fading channels", IEEE JSAC, Apr.2002.
    [13]Shiu D., Foshini J. G., and Gans M. J.. "Fading correlation and its effect on the capacity of multi-element antenna systems", IEEE Trans. Commua, Mar.2000.
    [14]Chuah C-N., Tse D. N., and Kahn J.. "Capacity scaling in MIMO wireless systems under correlated fading", IEEE Trans. Inform. Theory, Mar.2002.
    [15]Chizhik D., Foschini G. J., Gans M. J., and Kahn J. M.. "Keyholes, correlations, and capacities of multi-element transmit and receive antennas", IEEE Trans. Wireless Commun., Apr.2002.
    [16]Biglier E., Proakis J., and Shamai S.. "Fading Channels:Information theoretic and communication aspects", IEEE Trans. Inform. Theory, Oct.1998.
    [17]Li L. and Goldsmith A.. "Capacity and optimal resource allocation for fading broadcast channels-part I:Ergodic capacity", IEEE Trans. Inform. Theory, Mar. 2001.
    [18]Li L. and Goldsmith A.. "Capacity and optimal resource allocation for fading broadcast channels-part II:Outage capacity", IEEE Trans. Inform. Theory, Mar. 2001.
    [19]Hochwald M. and Marzetta T. L.. "Systematic design of unitary space-time constellations", IEEE Trans. Infom. Theory, Sept.2002.
    [20]Catreux S., Erceg V., and Gesbert D.. "Adaptive modulation and MIMO coding for broadband wireless data networks", IEEE Communication Magazine,.Jun. 2002.
    [21]Al-Dhair N.. "Overview and comparison of equalization schemes for space-time-coded signals with application to edge," IEEE Trans. Signal Processing, Oct.2002.
    [22]Foschini G. J.. "Layered Space-time architecture for wireless communication in fading environment when using multi-element antennas," Bell Labs. Tech. Journ., vol.1, Nov.1996.
    [23]Zelst A. v. and Tim Schenk C. W.. "Implementation of a MIMO OFDM-based wireless LAN system," IEEE Trans. Signal Processing, vol.52, no.2, Feb.2004.
    [24]Stuber G. L., Barry J. R., and McLauqhlin S. W.. "Broadband MIMO-OFDM wireless communication", IEEE Proceedings, vol.92, no.2, Feb.2004.
    [25]GALLAGER R. "Low-density parity-check codes [J]", IEEE Trans Inform Theory,1962,8(1):21-28.
    [26]C.Berrou, A.Glavieux, and P.Thitimajshima. "Near Shannon limit error-correcting coding and decoding:Turbo-codes (1)", in Proc.ICC'93, May 1993, pp.1064-1070.
    [27]李道本.重叠高斯编码多址(OVGMA),内部文件,2010.10.
    [28]沈嘉,索士强,全海洋等.3GPP长期演进(LTE)技术原理与系统设计,人民邮电出版社,2008.
    [29]3GPP TR 25.814 V7.1.0.Physical layer aspects for evolved Universal Terrestrial Radio Access (UTRA) (Release 7).
    [30]李道本.信号的统计检测与估计理论,科学出版社,2004.
    [31]李道本.一种时间分割复用方法和系统,PCT/CN2006/001585.
    [32]李道本.一种频分复用的方法和系统,PCT/CN2006/002012.
    [33]李道本.一种分组时间、空间、频率多址编码方法,PCT/CN2006/000947.
    [34]李道本.重叠复用广义互补码组在同频组网系统中的应用,内部文件,2008.
    [1]Kobayashi H.. "Correlative level coding and maximum-likelihood decoding" IEEE Trans. Inf. Theory, Vol.17, Sep.1971, pp.586-594.
    [2]李道本.信号的统计检测与估计理论,科学出版社,2004.
    [3]李道本.高频谱效率OVCDM宽带无线移动通信系统白皮书,内部文件,2008.1.
    [4]周炯磐,吴伟陵等.通信原理,北京邮电大学,2005.11.
    [5]Bernard Sklar. Digital Communications Fundamentals and Applications 2thEd, 2006.
    [6]Viterbi A. J., Omura J. K.. Principle of Digital Communication & Coding, McGraw Hill,1979.
    [7]G. D. Forney Jr.. "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference", IEEE Transactions Information Theory, Vol. IT-18,1972, pp.363-378.
    [8]Bahl L., Cocke J., Jelinek F., et al. "Optimal decoding of linear codes for minimizing symbol error rate", IEEE Transactions on Information Theory,20(2), 1974, pp.284-287.
    [9]Ryan W. E.. Concatenated convolutional codes and iterative decoding, In Proakis J. G., Wiley Encyclopedia of Telecommunications, New York:John Wiley and Sons,2003.
    [10]Berrou C., Glavieux A., Thitimajshima P.. "Near Shannon limit error-correcting coding and decoding:Turbo-codes", In Proc. IEEE International Conference on Communication (ICC), Geneva, Switzerland,1993, pp.1064-1070.
    [11]Bauch G., Khorram H., Hagenauer J.. "Iterative equalization and decoding in mobile communications systems", In Proc. European Personal Mobile Communications Conference (EPMCC), Bonn, Germany,1997, pp.307-312.
    [12]李道本.重叠编码复用OVCDM与重叠编码多址概论.内部文件,2009.08.
    [13]王键,莫勇.OVCDM串行级联编码与快速迭代译码算法,内部文件,2007.6.
    [14]李道本.高频谱效率的阵列Turbo-OVCDM,内部文件,2008.2.
    [15]Dan Raphaeli, Yoram Zarai. "Combined Turbo Equalization and Turbo Decoding", IEEE Communications, Letters, Vol.2, No.4, April,1998.
    [16]Qinghua Li, Xiaodong Wang, and Costas N. Georghiades. "Turbo Multiuser Detection for Turbo-Coded CDMA in Multipath Fading Channels", IEEE Transactions on Vehicular Technology, Vol.51, No.5, Sep.2002.
    [17]杨讯,工键,莫勇.级联OVCDM性能分析(2),内部文件,2007.8.
    [18]Xuesong Wang, Peijian Zhang, et al. "A fast detection algorithm for concatenated overlapped code division multiplexing system", Network Infrastructure and Digital Content(IC-NIDC),2010, pp.348-353.
    [19]R. M. Fano. "A heuristic discussion of probabilistic decoding", IEEE Trans. Inform. Theory, IT-9, Apr.1963, pp.64-74,.
    [20]Shu Lin, D. J. Costello Jr.. Error control coding (2nd edition), Prentice Hall,2004.
    [21]Y. S. Han. "A generalization of Fano Metric and its effect on sequential decoding using a stack", ISIT 2002, Lausanne, Switzerland,2002.5.
    [22]C. WeiB. "Sequential decoding using a prior information", Electronic letters (20th), Vol.32, No.13,1996.6.
    [23]Y. S. Han. "A maximum-likelyhood soft-decision sequential decoding algorithm for binary convolutional codes", IEEE Trans, on Comm., Vol.50, No.2,2002.2.
    [24]J. L. Messy. "Variable-length Codes and Fano Metric", IEEE Trans. Inform. Theory, Vol. IT-18,1972.1, pp.196-198.
    [25]J. Haugenauer. "Iterative decoding of binary block and convolutional codes", IEEE Trans. Inform. Theory, Vol.42, No.2,1996.3.
    [26]J. M. Geist. "Search properties of some sequential decoding algorithm", IEEE Trans. Inform. Theory, Vol. IT-19,1973.7, pp.519-26.
    [27]F. Jelinek. "A fast sequential decoding algorithm using a stack", IBM J. Res. Dev., 13:675-85,1969.12.
    [28]D. Haccoun, M. J. Ferguson. "Generalized stack algorithms for decoding convolutional codes", IEEE Trans. Inform. Theory, Vol. IT-21, No.6,1975.11.
    [29]P. R. Chevillat, D. J. Costello Jr.. "A multiple stack algorithm for erasure free decoding of convolutional codes", IEEE Trans. Comm., Vol. COM-25,1975.11, pp.638-651.
    [30]张曦林.高频谱效率的重叠复用技术研究,博士学位论文,2008.
    [31]莫勇.高谱效率广义并行传输的关键技术研究,博士学位论文,2008.
    [1]H. Jiang, D. b. Li. "A New Time Division Multiplexing Technique", IEEE International Conference on Wireless Communications, Networking and Mobile Computing, pp.771-774,2007.
    [2]H. Jiang, D. b. Li, W. d. Li. "Performance Analysis of Overlapped Multiplexing Techniques", IEEE 3rd International Workshop on Signal Design and its Applications in Communications, pp.233-237,2007.
    [3]李道本.信号的统计检测与估计理论,第二版.北京:科学出版社,2003.
    [4]J. G. Proakis, Digital communication,4th Ed. New York:McGraw Hill,2001.
    [5]Kretzmer E. R., "Generalization of a technique for binary data communication,' IEEE Trans. Commun. Tech., vol. COM-14, Feb.1966, pp.67-68.
    [6]G. D. Forney, JR, "Maximum-likelihood sequence estimation of digital sequence in the presence of intersymbol interfence", IEEE Trans, on Inf. Theory, vol. IT-18, No.5, May 1972.
    [7]李道本.一种时间分割复用方法和系统.国际专利号:PCT/CN2006/001585.
    [8]Rusek F., "Partial Response and Faster-than-Nyquist Signaling", [Dissertation], Lund, Sweden:Lund University, Sep.2007.
    [9]严士健,刘秀芳.测度与概率,第二版.北京:北京师范大学出版社,2009.
    [10]白自权,李道本.一种符合干扰信道中的最优传输方式[J].北京邮电大学学报,2005,28(6):84-87.
    [11]郑君里,应启珩,杨为理.信号与系统[M].北京:高等教育出版社,2000,362-365.
    [12]杨讯.多径信道下的OvTDM,内部文件.2007.4.
    [13]Patzold M., "Mobile Fading Channels", Chichester, England:John Wiley& Sons, Ltd,2002.
    [14]ITU-R Document 5D/09-E. Proposal guideline for the channel modeling work of IMT_EVAL.1st meeting of working party 5D, Gevena,2008.1.
    [15]G. D. Forney, Jr., "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans.Inform. Theory, vol.18, no.2, pp.363-378, May 1972.
    [16]Xia Zhang, Peijian Zhang. Daoben Li. "Overlapped Time Division Multiplexing System Using Turbo Product Code", Wireless Communications Networking and Mobile Computing (WiCOM),2010.
    [17]Berrou C, Glavieux A. Thitimajshima P. "Near Shannon limit error-correcting coding and decoding:Turbo codes", IEEE ICC,1993,2:1064-1070.
    [18]Pyndiah R, Glavieux, Picart A. "Near optimum decoding of product codes". IEEE GLOBECOM,1994,1:339-343.
    [19]P. Elias, Error-free coding, IRE Trans. Inform. Theory, Sept.1954, IT-4:29-37.
    [20]Juing Fang, et al,"Turbo Product Code:A well suitable solution to wireless packet transmission for very low error rates", The 2nd international symposium on Turbo Codes-Brest-Frace-2000.
    [21]Xia Zhang, Peijian Zhang, Wei Jiang, Daoben Li. "The analysis of coded overlapped time division multiplexing system". Broadband Network & Multimedia Technology(IC-BNMT),2010.
    [22]C. Berrou and A. Glavieux, "Near Optimum Error Correcting Coding and Decoding:Turbo-codes", IEEE Trans. Commun, vol.44, no.10, pp.1261-1271, Oct,1996.
    [23]J. Sun and O. Y. Takeshita, "Interleavrs for Turbo Codes Using Per-mutation Polynomials",2002.
    [24]J. Ryu, O. Y. Takeshita. "On Quadratic Inverses for Quadratic Permutation Polynomials Over Integer Rings", IEEE Trans. Inform. Theory, vol.52, No.3, Mar,2006.
    [25]S. Benedetto, D. Divsalar, G. Montorsi. "Serial Concatenation of Interleaved Codes:Performance Analysis, Design, and Iterative Decoding", IEEE Trans. Inform. Theory, vol.44, no.3, May,1998.
    [1]李道本.重叠编码复用OVCDM和重叠编码多址OVCDMA概论,内部文件,2009.8.
    [2]J.G. Proakis. Digital Communications,4th ed, New York:Macgraw Hill,2001.
    [3]D. B. Li, "The perspectives of large area synchronous CDMA technology for the fourth-generation mobile radio", IEEE Communication Magazine, vol.43, pp. 114-118, March,2003.
    [4]L. R. Welch. "Lower bounds on the maximum cross-correlation of signals", IEEE Trans information. Theory, vol.20, pp.397-399, May.1974.
    [5]S. Verdu. Multi-User Detection. London:Cambrige University Press.1998.
    [6]H. Harada and R. Prasad. Simulation and Software Radio for Mobile Communications, Universal Personal Communication Press,2002.
    [7]D. V. Sarwate. "Bounds on crosscorrelation and autocorrelation of sequences" IEEE Trans. Inform. Theory, vol.25, pp.720-724,1979.
    [8]李道本.广义互补正交码组的重叠复用及其在同频组网系统中的应用,内部文件,2008.9.
    [9]Peijian Zhang, Li Fang, Xing Yang, et al. "Eliminating adjacent cell interference by perfect complementary codes", Network Infrastructure and Digital Content(IC-NIDC), p.819-822,2009.
    [10]W. Jiang, D. B. Li and X. P. Mao. "Convolutional multiplexing for multicarrier systems," in IEEE WCNC 2007, Hong Kong,2007.
    [11]J. Forney. G. "Maximum Likelihood Sequence Estimation of Digital Sequences in the presence of intersymbol interference", IEEE Trans. Information Theory, vol 18, no.3, p.363-378,1972.
    [12]G. Ungerboeck. "Adaptive maximum-receiver for carrier modulated data transmission systems," IEEE Trans. Communication, Vol.22, no.5, p.624-636, 1974.
    [13]G D. Forney, Jr.. "Maximum-likelihood sequence estimation of digitalsequences in the presence of intersymbol interference", IEEE Trans.Inform. Theory, vol.18, no.2, p.363-378, May 1972.
    [14]王雪松等. OVCDMA算法仿真报告,内部文件,2009.
    [15]Verdu, S.. Muliuser Detection,2nd ed. Cambridge, U.K.:Cambridge University Press,1998.
    [16]Bohnke, R., Wubben, D., Kuhn, V., et al. "Reduced complexity MMSE detection for BLAST architectures", Global Telecom-munications Conference,2003. GLOBECOM'03. IEEE, vol. A, p.2258-2262,1-5 Dec.2003.
    [17]Wolniansky, P. W., Foschini, G.1., Golden, G. D., et al. "V-BLAST:an architecture for realizing very high data rates over the rich-scattering wireless channel", Signals, Systems, and Electronics,1998. ISSSE 98. p.295-300, 29.Sep-2 Oct 1998.
    [18]Hassibi, B.. "An efficient square-root algorithm for BLAST", Acoustics, Speech, and Signal Processing,2000. ICASSP'00. Proceedings, vol.2, pp.737-740 vol.2, 2000.
    [19]Wubben, D., Bohnke. R.. Kuhn, V., et al. "Near maximum likelihood detection of MIMO systems using MMSE-based lattice reduction", Communications,2004 IEEE International Conference on. vol.2, pp.798-802,20-24 June 2004.
    [20]Lenstra, A. K., Lenstra, H. W., Lovasz, L.. "Factoring Polynomials withRational Coefficients", Math. Ann, vol.261, p.515-534,1982.
    [21]B. P. Schweitzer Generalized Complementary Code Sets. Ph.D.Thesis University of California, Los Angeles,1971.
    [22]胡广书.数字信号处理,第二版.北京:清华大学出版社,2003.
    [23]Long Term Evolution Document:3GPP TS36.212 V8.6.0 Mar,2009.
    [24]Ashikhmin A., Kramer G., and Brink S. ten. "Extrinsic information transfer functions:model and erasure channel properties", IEEE Trans. Inform. Theory, vol.50, no.11, p.2657-2673, Nov.2004.
    [25]Brink S. ten. "Convergence of iterative decoding", Electronics Letters, vol.35, no. 10, p.806-808, May.1999.
    [26]Brink S. ten. "Iterative decoding trajectories of parallel concatenated codes", in Proc.3rd IEEE/ITG Conf. Source Channel Coding, Munich, Germany, pp.75-80, Jan.2000.
    [27]Brink S. ten. "Designing iterative decoding schemes with the extrinsic information transfer chart", AEU Arch. Elektron. Ubertragung., vol.54, no.6, pp. 389-398, Dec.2000.
    [28]Brink S. ten. "A rate one-half code for approaching the Shannon limit by 0.1 dB", IEE Electron. Lett., vol.36, no.36, no.15, p.1293-1294, July 2000.
    [29]Brink S. ten. "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol.49, no.10, p.1727-1737, Oct.2001.
    [30]Brannstrom F., Rasmussen L. K., Grant A. J.. "Convergence analysis and optimal sechduling for multiple concatenated codes", IEEE Trans. Inform. Theory, vol.51, no.9, p.3354-3364, Sep.2005.
    [31]Grant A. J.. "Convergence of non-binary iterative decoding", in Proc. IEEE Global Telecommun. Conf., San Antonio TX, USA, p.1058-1062, Nov.2001.
    [32]Land I., Hoeher P. A., Huettinger S., et al. "Bounds on information combining", in Proc.3rd Int. Symp. Turbo Codes, Brest, France, p.39-42, 1-5Sept.2003.
    [33]Lehmann F., Maggio G. M.. "Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation", IEEE Trans. Inform. Theory, vol.49, p.2993-3000, Nov.2003.
    [34]Brink S. ten, Kramer G., Ashikhmin A.. "Design of low-density parity-check codes for modulation and detection", IEEE Trans. Commun., vol.52, p.670-678, Apr.2004.
    [35]Huettinger S., Brink S. ten, Huber J.."Turbo-like representation of RA-codes and DRS-codes for reduced complexity decoding", in Proc.2001 Conf. Information Science and Systems,21-23Mar.2001.
    [36]Wiberg N.. Codes and decoding on general graphs, [Dissertation], Linkoping Univ., Sweden,1996.
    [37]Cover T. M. and Thomas J. A., Elements of Information Theory. New York:Wiley, 1991.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700