期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
降低线性分组码网格复杂度的研究 认领 引用 被引量:1
1
作者 王喜凤 王广正 +1 位作者 谢振飞 周建钦 《计算机工程与应用》 北大核心 2010年第1期95-98,共4页
首先介绍线性分组码的传统网格和BCJR传统网格,然后给出一种新的降低线性分组码网格复杂度方法——校验矩阵置换法。该方法是通过置换校验矩阵列向量的适当位置,从而使网格图的状态复杂度降低。最后给出方法证明、算法思想、具体的算法... 首先介绍线性分组码的传统网格和BCJR传统网格,然后给出一种新的降低线性分组码网格复杂度方法——校验矩阵置换法。该方法是通过置换校验矩阵列向量的适当位置,从而使网格图的状态复杂度降低。最后给出方法证明、算法思想、具体的算法描述和实验结论等。 展开更多
关键词 线性分组码 最小网格 网格复杂度 校验矩阵置换
暂未订购 下载PDF
Comparative Study of Different Space-Time Coding Schemes for MC-CDMA Systems 认领 引用
2
作者 Lokesh Kumar Bansal Aditya Trivedi 《International Journal of Communications, Network and System Sciences》 2010年第4期418-424,共7页
In this paper, performance of space-time trellis-code (STTC), space-time block code (STBC), and space-time trellis-code concatenated with space-time block code (STTC-STBC) for multi-carrier code-division multiple-acce... In this paper, performance of space-time trellis-code (STTC), space-time block code (STBC), and space-time trellis-code concatenated with space-time block code (STTC-STBC) for multi-carrier code-division multiple-access (MC-CDMA) system are studied. These schemes are considered by employing different detection techniques with various multi input multi output (MIMO) antenna diversity for different number of states in multi-path fading channel. The corresponding bit error rate (BER) is obtained using simulation for minimum mean-square error (MMSE), maximum-ratio combining (MRC), and equal-gain combining (EGC) receivers employing Viterbi decoder. The simulation results show that the STTC-STBC MC-CDMA system perform better compared to other schemes considered in this paper using MMSE detection and it is also observed that the performance can also be enhanced by increasing diversity using more transmitter and receiver antennas. However, this improvement in performance comes at the cost of increased computational complexity, which is calculated for different transmitting and receiving antennas. 展开更多
关键词 Space-Time Code Space-Time Trellis-Code (STTC) Space-Time Block-Code (STBC) MIMO MMSE Multi-Path Channel
暂未订购 下载PDF
Performance Study of the Association TCM-UGM/STBC to Reduce Transmission Errors of JPEG Images 认领 引用
3
作者 Mohamed Benaissa Abdesselam Bassou +1 位作者 Mohammed Beladgham Abdelmounaim Moulay Lakhdar 《International Journal of Communications, Network and System Sciences》 2011年第6期388-394,共7页
The purpose of this work is to associate the channel encoder called ‘trellis-coded modulation with Ungerboeck-Gray mapping’ (TCM-UGM) to ‘space–time block code’ (STBC), in order to study its performance to correc... The purpose of this work is to associate the channel encoder called ‘trellis-coded modulation with Ungerboeck-Gray mapping’ (TCM-UGM) to ‘space–time block code’ (STBC), in order to study its performance to correct the transmission errors of a JPEG image. The performance of the proposed scheme is evaluated in senses of bit error rate (BER), frame error rate (FER) and peak signal-to-noise ratio (PSNR) of the reconstructed image. Compared to the association TCM/STBC for a throughput of 2 bits/s/Hz, TCM-UGM/STBC permits to obtain a PSNR gain up to 2 dB. 展开更多
关键词 Trellis-Coded Modulation Trellis Coded Modulation With Ungerboeck-Gary Mapping Logarithm of Maximum a Posteriori Space-Time Block Code JPEG
暂未订购 下载PDF
A NEW SCHEME FOR THE CODED SSMA SYSTEM 认领 引用
4
作者 张清 毕光国 《Journal of Southeast University(English Edition)》 CAS 1994年第2期51-58,共8页
ANEWSCHEMEFORTHECODEDSSMASYSTEMZhangQing(张清)BiGuangguo(毕光国)(DepartmentofRadioEngineering)ANEWSCHEMEFORTHECODEDSSMASYSTEM¥Zhan...
关键词 Trellis-coded modulation frequency/phase modulation spreadspectrum multiple access
暂未订购 下载PDF
A Note on Characteristic Generators of a Free Cyclic Code and Its Dual 认领 引用
5
作者 YANG Qinqin QIN Zhongping 《Wuhan University Journal of Natural Sciences》 CAS 2009年第1期14-18,共5页
Let C be a free cyclic code over Zp^a and dim pC = k. In the paper, we prove that if the k characteristic generators of C are p-linearly independent then the corresponding nα- k characteristic generators of C^⊥ are ... Let C be a free cyclic code over Zp^a and dim pC = k. In the paper, we prove that if the k characteristic generators of C are p-linearly independent then the corresponding nα- k characteristic generators of C^⊥ are p-linearly independent. We then show that to any trellis that can be constructed from k p-linearly independent characteristic generators of C, there exists a trellis for C^⊥ with the same state-complexity profile, which generalizes the conjecture of Koetter and Vardy to a free cyclic code over Zpo. 展开更多
关键词 Hensel lift cyclic codes characteristic generators trellises state-complexity profile
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈