最佳(F,K,1)光正交码的构造算法研究

(F ,K ,1)光正交码 (OOC’s)是适合于光码分多址 (OCDMA)通信的最佳地址码 ,但成功构造最佳 (F ,K ,1)光正交码十分困难。针对该问题 ,研究了一种构造算法 ,给出了构造该光正交码的具体算法及相应的计算机辅助设计方法。通过该方法可以容易地构造出最佳 (F ,K ,1)光正交码。     

基于相关滤波和哈达玛变换的帧同步码识别

为从侦收到的信息中得到帧同步码,提出了基于相关滤波及哈达玛变换的识别方法。该方法先利用二次相关滤波区分信息码和帧同步码,然后利用哈达玛变换压缩数据处理量识别出帧长,最后通过模糊匹配法进一步识别出同步码的同步起始位和码型。仿真结果表明:在较高误码率的影响下,该方法可以利用较少的数据量快速准确地建立帧同步,并具有较好的识别效果。     

Turbo码中迭代译码的迭代终止准则研究

本文介绍了Turbo码中迭代译码的两种新的迭代终止准则,并通过仿真研究了这两种迭代终止准则的性能。这两种迭代终止准则都是基于互熵（CE）的概念,但是后一种比CE准则更简单,具有更低的计算复杂度。     

一种新的OVSF码快速生成分配算法研究

本文利用复制方法提出一种新的OVSF码复制生成算法,并在此基础上,研究了非可重排和可重排两种情况下的OVSF码快速分配问题.利用复制生成的OVSF码字具有明显的异前置性特点,从而可以提高码字分配效率和减小硬件实现复杂度和降低呼叫阻塞率.     

Implementation Issues in Turbo Decoding for 3GPP FDD Receiver

In the Frequency Division Duplex (FDD) mode of the Third Generation Partnership Project (3GPP) standard, implementation of the turbo decoder, especially for the mobile equipments, faces design decisions related to computational complexity, power efficiency, and memory requirements. In this paper we compare different approaches of low complexity implementation of the turbo decoder, with emphasis on the issues of signal scaling and quantization, the sliding window operation for memory size reduction and the iteration stopping algorithms. The demodulated signal at the output of the RAKE receiver may have a wide dynamic range and it may require many bits of precision. In order to overcome the numerical precision problem and to prevent Log Likelihood ratio (LLR) metric overflow, a scaling algorithm must be used. Our simulation results indicate that the Average Absolute (AA) algorithm using dynamic scaling outperforms other scaling schemes and it is less sensitive to the channel conditions. One of the major challenges in the implementation of a practical turbo decoder is optimization of memory requirements. In this paper we evaluate the performance of the sliding window algorithm using different main and guard window sizes. We show that the bit and block error rate performance of the sliding window scheme mainly depend on the guard window size rather than the main window size. The simulation results indicate that small guard window sizes can significantly decrease the iteration gain for large frames in fast fading channels. Iteration stopping algorithms reduce the power consumption and the latency of the decoder and help to dedicate more resources to other functions of the receiver. The block error distribution in the fading channels makes it even more essential to use an iteration stopping rule. Our simulations conclude that a rule called the minimum absolute value appears to be a very effective, low complexity and robust algorithm. Mohamadreza Marandian Hagh was born in Tabriz, Iran on January 1974. He received the B.S. and the M.S. degrees in electrical engineering from Tehran University with honors in 1996 and 1999, respectively. He is pursuing the Ph.D. degree in electrical engineering at Northeastern University, Boston. His research interests includes information theory, channel coding and iterative techniques for wireless communication systems. His current research is focused on low complexity designs for iterative receivers using Space-Time coding in time-dispersive channels. He is also interested in Exit-Chart analysis of iterative receivers. From 1996 to 1999, he was with Sana Pro Inc. as a system engineer, developing simulation tools for OFDM, WCDMA, CDMA2000. He is currently with Airvana Inc. in Chelmsford, MA and working on 1xEVDO wireless systems. Masoud Salehi received BS degree (Summa Cum Laude) from Tehran University and MS and Ph.D. degrees from Stanford University all in Electrical Engineering. Before joining Northeastern, he was with the Departments of Electrical and Computer Engineering, Isfahan University of Technology and Tehran University. From February 1988 to May 1989 Dr. Salehi was a visiting professor at the Information Theory Research Group, Department of Electrical Engineering, Eindhoven University of Technology, The Netherlands, where he did research in network information theory and coding for storage media.In 1989 Dr. Salehi joined Department of Electrical and Computer Engineering, Northeastern University. Professor Salehi is a member of the CDSP (Communication and Digital Signal Processing) Center. His main areas of research interest are network information theory, source-channel matching problems in single and multiple user systems, data compression, turbo coding, coding for fading channels, and digital watermarking. Professor Salehi’s research has been supported by research grants from the National Science Foundation (NSF), GTE, NUWC, CenSSIS, and Analog Devices. Professor Salehi has also done consulting to the industry including Teleco Oilfield Services and AT&T. Professor Salehi is currently a member of the Editorial Board of The International Journal of Electronics and Communications.Professor Salehi is the coauthor of the textbooks “Communication Systems Engineering”, Prentice-Hall 1994, 2002, “Contemporary Communication Systems Using MATLAB and Simulink” Thomson 1998, 2000, 2004, and “Fundamentals of Communication Systems”, Prentice-Hall 2005. Abhay Sharma received B.E. (Hons) Electrical and Electronics Engineering degree from Birla Institute of Technology and Science, Pilani, India in 1996 and M.S. Electrical Engineering degree from Ohio State University, Columbus in 2000. From 2000 to 2005 he was working with Analog Devices, RF and Wireless Systems Group, Wilmington, USA, where he was working on design and implementation of algorithms for the emerging cellular communication standards. Currently he is working with Allgo Embedded Systems, Bangalore, India, in the area of wireless networks and systems based on the emerging W-PAN wireless technologies. Zoran Zvonar received the Dipl. Ing. degree in 1986 and the M.S. degree in 1989, both from the Department of Electrical Engineering, University of Belgrade, Yugoslavia, and the Ph.D. degree in Electrical Engineering from the Northeastern University, Boston, in 1993.From 1986 to 1989 he was with the Department of Electrical Engineering, University of Belgrade, Belgrade, Yugoslavia, where he conducted research in the area of telecommunications. 1993 to 1994 he was a Post-Doctoral investigator at the Woods Hole Oceanographic Institution, Woods Hole, MA, anconducted research on multiple-access communications for underwater acoustic networks. Since 1994 he has been with the Analog Devices, Communications Division, Wilmington, USA. He is the Manager of the Systems Engineering Group focusing on the design of algorithms and architectures for wireless communications, with emphasis on integrated solutions and real-time software.He was a Guest Editor of the IEEE Transactions on Vehicular Technology, the International Journal of Wireless Information Networks and the ACM/Baltzer Wireless Networks, Associate Editor of the IEEE Communications Letters and a co-editor of the books GSM: Evolution Towards Third Generation Systems, Kluwer Academic Publishers, 1998, Wireless Multimedia Networks Technologies, Kluwer Academic Publishers, 1999 and Software Radio Technologies: Selected Reading, IEEE Press, 2001. Dr. Zvonar is currently Co-Editor of the Radio Communication Series in the IEEE Communications Magazine.     

基于可分组设计的部分重复码研究

针对最小带宽再生情形下的有效修复问题,提出了一种新型部分重复(FR,fractional repetition)码设计。该设计由外部最大距离可分(MDS,maximum distance separable)码和内部重复码组成,称为GDDBFR(group divisible design based FR)码,可以达到随机访问模式下的系统存储容量,并且能够在很大范围内选择构造参数。理论分析指出,尽管GDDBFR码采用基于表格的修复方式,但通常具有大量的节点修复选择方案。此外,实验结果表明,与传统的RS(Reed-Solomon)码和再生码相比,GDDBFR码可以显著地减少失效修复时间。     

基于LDPC码的数字音频水印算法研究

论文提出了一种基于低密度奇偶校验(LDPC)码的音频水印算法,对水印进行编码预处理后,采用时域去直流的方法并动态改变水印幅度嵌入水印,其中利用了人耳听觉系统的感知特性,把水印加在人耳感知极限下方。通过仿真实验结果表明,该算法具有较强的鲁棒性和不可感知性,而且在水印检测时不需要原始音频信号。     

LDPC码及其应用

先在阐述几种LDPC编码的基础上分析了多进制LDPC编码优点;接着介绍作为解释LDPC码和积译码算法的因子图;最后分析了LDPC码的优势以及它在通信领域中应用的可行性。     

低差错平底特性的非规则LDPC码的设计

介绍了非规则LDPC码的发展并给出了其优势及缺点，重点论述用ACE算法来构造非规则LDPC码从而降低其差错平底特性。对降低非规则LDPC码的差错平底特性的其它方法提出了展望。     

关于Goppa码、BCH码的广义Hamming重量

本文研究了Goppa码、BCH码的广义Hamming重量,给出了Goppa码的广义Hamming重量的一个下界以及求该下界的一个算法;对于本原、狭义BCH码,给出了后面一些广义Hamming重量的确切值。