首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 375 毫秒
1.
针对在湍流信道下空间脉冲位置调制(SPPM)系统误码性能较差的问题,文章将空时分组码与空间调制技术结合,提出了基于比特补码正交空时分组码的空间脉冲位置调制(BCOSTBC-SPPM),利用空时编码增加信息冗余度以改善系统误码性能.同时基于最大似然(ML)检测推导了系统的理论误比特率上界,并通过蒙特卡洛仿真对理论上界进行...  相似文献   

2.
阐述了空时分组码的编译码算法并进行性能分析,就其编码能提供分集增益但不能提供编码增益的特点,给出空时分组码级联LDPC(low density parity check code,低密度奇偶校验码)的系统模型。最后利用Matlab对级联LDPC的空时分组码进行仿真,结果表明:级联LDPC码的空时分组码能有效提高编码性能。  相似文献   

3.
该文研究了级联空时编码系统在编码增益,分集增益和传输能量效率的限定下最大化传输速率的问题,提出了一种在保留TCM编码方法校验位冗余的同时,还可获得满速率串行级联空时分组TCM编码方法。新方法通过引入具有不同功率分集因子的正交发射码字矩阵,并给出新的译码算法,从而使得新的编码方法在获得满速率的同时还可以获得满分集增益。分析和MATLAB仿真结果表明,在相同的编码状态数下,新方法在编码增益上比现有的满速率超正交空时分组编码方法提高1dB左右。  相似文献   

4.
空时分组码能够实现MIMO系统的完全发射分集,但不能实现任何的编码增益.对此,提出了线性分组码与空时分组码级联的MIMO系统,该系统能够同时实现完全发射分集和编码增益.仿真结果表明,在比特误码率为10-5时,与未进行前向纠错的空时分组码系统相比,该系统能提供了大约2.7dB的编码增益.  相似文献   

5.
本文提出了一种通过调整非编码信息量,并与信号映射相结合来改变编码、调制模式的自适应Turbo TCM编码调制方案,称之为基于非编码信息匹配的自适应Turbo TCM编码调制方案.由于将Turbo码和TCM编码调制技术相结合得到的Turbo TCM编码调制方案的带宽效率高,所以,在慢时变无线衰落信道中,自适应Turbo TCM编码调制的平均频谱效率也将很高.给出了该方案的工作原理、设计方法,并通过蒙特卡洛(Monte Carlo)仿真研究了该方案的性能.与现有编码调制方案相比,该方案具有频谱效率高、易于设计和实现的优点.  相似文献   

6.
介绍了空时编码,阐述了正交空时分组编码的编解码过程及其与网格编码调制相结合的系统,并对空时分组编码、空时格栅编码、网格编码调制和空时分组编码级联这三者在相同的发送功率、相同的信息速率和相同的频带利用率的条件下的BER(误比特率)性能进行了比较,得出简单的网格编码调制和空时分组编码级联后的系统,可以比同复杂度甚至更高复杂度的空时格栅编码系统节省SNR(信噪比)。结论是针对两根发送天线和一根接收天线的,但对于更多天线的无线系统同样适用。  相似文献   

7.
卢小峰  朱光喜  韦耿 《通信学报》2006,27(12):116-121
基于OFDM(正交频分复用)系统,提出了一种新的空频时三维编码,将网格编码调制和差分空时分组码进行组合链接设计。在信道状态信息很难获取的情况下,它可以很好地工作在频率选择性信道中。进一步分析并推导了非相干检测下该编码的性能。仿真结果表明,这种新的编码方案可以获得编码增益以及满的空间域和频域分集增益,很好地支持了理论分析。  相似文献   

8.
针对分层结构的空时分组码LSTBC,提出一种以网格编码调制TCM为外部编码的TCM-LSTBC方案.在接收端,利用数据特点构造出一种无需矩阵求逆的组干扰抑制方法.由于该TCM-LSTBC方案和组干扰抑制方法能有效分离各层发射信号,并且新形成的信道矩阵为Alamouti矩阵,故降低了译码复杂性.仿真结果验证了方案的有效性.  相似文献   

9.
空时分组码能够实现MIMO系统的完全发射分集,但不能实现任何的编码增益。对此,提出了线性分组码与空时分组码级联的MIMO系统,该系统能够同时实现完全发射分集和编码增益。仿真结果表明,在比特误码率为10^-5时,与未进行前向纠错的空时分组码系统相比,该系统能提供了大约2.7dB的编码增益。  相似文献   

10.
为了克服多天线信道相关性的影响,提出一种新的自适应发送方案。应用空时分组码特征波束成型技术和格形编码调制(TCM)来获得分集增益和编码增益。针对采用和不采用交织器两种情况,基于成对差错概率(PEP)准则。分析了系统的统计性能,分别得到了使系统编码增益和分集增益最大化的TCM设计准则。根据注水法则和Lagrange乘子法求得波束间功率分配算法最优解。此外,码距作为优化功率加载算法中的权重因子,有效降低了获取波束成形分集的信噪比门限。分析和实验结果表明此方案复杂度低。能有效克服相关衰落。  相似文献   

11.
Trellis coded modulation (TCM) is a bandwidth efficient transmission scheme that can achieve high coding gain by integrating coding and modulation. This paper presents an analytical expression for the error event probability of concatenated space-time block coding with TCM which reveals some dominant factors affecting the system performance over slow fading channels when perfect interleavers are used. This leads to establishing the design criteria for constructing the optimal trellis codes of such a concatenated system over slow flat fading channels. Through simulation, significant performance improvement is shown to be obtained by concatenating the interleaved streams of these codes with space-time block codes over fading channels. Simulation results also demonstrate that these trellis codes have better error performance than traditional codes designed for single-antenna Gaussian or fading channels. Performance results over quasi-static fading channels without interleaving are also compared in this paper. Furthermore, it is shown that concatenated space-time block coding with TCM (with/without interleaving) outperforms space-time trellis codes under the same spectral efficiency, trellis complexity, and signal constellation.  相似文献   

12.
In this letter, concatenation of trellis-coded modulation (TCM) with differential space-time block codes (DSTBC) is considered under frequency-flat Rayleigh-fading channels with and without perfect interleaver. It is shown that the design criteria of TCM concatenated with DSTBC are exactly the same as that of TCM concatenated with space-time block codes (STBC) in perfectly known channels. They are effective code length over span two symbol intervals and minimum product-sum distance over span two symbol intervals. Based on the design criteria, several new rate-2/3 systematic Ungerboeck's TCM schemes have been found by computer search. They outperform existing optimal TCM schemes designed for additive white Gaussian noise or flat fading channels.  相似文献   

13.
The feasibility of the non-full rank space-time trellis codes (NFR-STTCs) for the serially concatenated system is described carefully in this letter and a QPSK-based NFR-STTC suitable for the system is proposed. As the simulation results show, over the flat block Rayleigh fading channels, a concatenated system with the proposed NFR-STTC inner code can achieve full diversity, and improve the coding gains compared with other concatenated systems adopting full-rank space-time trellis codes (FR-STTCs) of the same complexity. The introduction of the NFR-STTC to serial concatenation space-time (SCST) system provides a new research community of SCST.  相似文献   

14.
基于水声信道的级联TCM编码技术研究   总被引:1,自引:0,他引:1  
本文论述了应用于水声信道的级联TCM编码方案,并在水声信道模型中对其进行了性能仿真。通过与各种状态下TCM的比较,证明级联TCM编码方案在同一水声信道模型下能获得相对较大的编码增益,对水声通信系统的纠错性能有较大改善。  相似文献   

15.
赵黎  朱彤  霍杰  张峰 《红外与激光工程》2019,48(3):322002-0322002(6)
可见光多输入多输出(MIMO)通信中空时分组编码能够获得较高的分集增益,但是其有效性较差,空间调制编码能够提高系统的频谱利用率但其可靠性较差。因此结合空时分组编码和空间调制编码的优势设计出空时分组-空间调制(STBC-SM)级联编码应用到可见光MIMO通信系统中,根据朗伯光源衰减特性建立了可见光室内传输信道模型,并对系统有效性及可靠性进行了仿真验证。结果表明在确保原有效性和相同误码率前提下,STBC-SM级联编码的可靠性较SM提高了5~8 dB,在确保原可靠性的前提下,STBC-SM级联编码的有效性较STBC提高了。表明文中设计的级联编码可有效的解决通信系统中有效性与可靠性的矛盾问题,为研究室内可见光MIMO通信提供了很好的理论意义。  相似文献   

16.
柯熙政  谌娟  陈丹 《红外与激光工程》2013,42(10):2765-2771
级联编码是一种提高系统纠错能力以逼近香农限的高效编码方式。当信道编码与空时编码结合使用时性能会大大提升,因此级联空时码研究成为空时编码研究的重要方向之一。笔者介绍了RS 码、LDPC 码与空时码的级联方案,以及在不同大气湍流条件下的误码率特性,并对其进行了仿真分析。结果表明:级联空时码可以极大地改善大气激光通信系统的性能,抑制大气湍流效应,有利于获得编码增益,进一步改善系统的误码性能。  相似文献   

17.
Encoding and decoding schemes for concatenated multilevel block codes are presented. By one of these structures, a real coding gain of 5.6-7.4 dB for the bit error range of 10-6 to 10-9 is achieved for transmission through the additive white Gaussian noise channel. Also, a rather large asymptotic coding gain is obtained. The new coding schemes have very low decoding complexity and increased coding gain in comparison with the conventional block and trellis coded modulation structures. A few design rules for concatenated (single and) multilevel block codes with large coding gain are also provided  相似文献   

18.
Following a brief historical perspective on channel coding, an introduction to space-time block codes is given. The various space-time codes considered are then concatenated with a range of channel codecs, such as convolutional and block-based turbo codes as well as conventional and turbo trellis codes. The associated estimated complexity issues and memory requirements are also considered. These discussions are followed by a performance study of various space-time and channel-coded transceivers. Our aim is first to identify a space-time code/channel code combination constituting a good engineering tradeoff in terms of its effective throughput, bit-error-rate performance, and estimated complexity. Specifically, the issue of bit-to-symbol mapping is addressed in the context of convolutional codes (CCs) and convolutional coding as well as Bose-Chaudhuri-Hocquenghem coding-based turbo codes in conjunction with an attractive unity-rate space-time code and multilevel modulation is detailed. It is concluded that over the nondispersive or narrow-band fading channels, the best performance versus complexity tradeoff is constituted by Alamouti's twin-antenna block space-time code concatenated with turbo convolutional codes. Further comparisons with space-time trellis codes result in similar conclusions  相似文献   

19.
The BER performance of a turbo product code (TPC) based space-time block coding (STBC) wireless system has been investigated. With the proposed system, both the good error correcting capability of TPC and the concurrent large diversity gain characteristic of STBC can be achieved. The BER upper bound has been derived taking BPSK modulation as an example. The simulation results show that the proposed system with the concatenated codes outperforms the one with only TPC or STBC and other reported schemes that concatenate STBC with convolutional Turbo codes or trellis codes.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号