首页> 外文学位 >Advanced coding and modulation for ultra-wideband and impulsive noises.
【24h】

Advanced coding and modulation for ultra-wideband and impulsive noises.

机译:针对超宽带和脉冲噪声的高级编码和调制。

获取原文
获取原文并翻译 | 示例

摘要

The ever-growing demand for higher quality and faster multimedia content delivery over short distances in home environments drives the quest for higher data rates in wireless personal area networks (WPANs). One of the candidate IEEE 802.15.3a WPAN proposals support data rates up to 480 Mbps by using punctured convolutional codes with quadrature phase shift keying (QPSK) modulation for a multi-band orthogonal frequency-division multiplexing (MB-OFDM) system over ultra wideband (UWB) channels. In the first part of this dissertation, we combine more powerful near-Shannon-limit turbo codes with bandwidth efficient trellis coded modulation, i.e., turbo trellis coded modulation (TTCM), to further improve the data rates up to 1.2 Gbps. A modified iterative decoder for this TTCM coded MB-OFDM system is proposed and its bit error rate performance under various impulsive noises over both Gaussian and UWB channel is extensively investigated, especially in mismatched scenarios. A robust decoder which is immune to noise mismatch is provided based on comparison of impulsive noises in time domain and frequency domain.;The accurate estimation of the dynamic noise model could be very difficult or impossible at the receiver, thus a significant performance degradation may occur due to noise mismatch. In the second part of this dissertation, we prove that the minimax decoder in [38], which instead of minimizing the average bit error probability aims at minimizing the worst bit error probability, is optimal and robust to certain noise model with unknown prior probabilities in two and higher dimensions.;Besides turbo codes, another kind of error correcting codes which approach the Shannon capacity is low-density parity-check (LDPC) codes. In the last part of this dissertation, we extend the density evolution method for sum-product decoding using mismatched noises. We will prove that as long as the true noise type and the estimated noise type used in the decoder are both binary-input memoryless output symmetric channels, the output from mismatched log-likelihood ratio (LLR) computation is also symmetric. We will show the Shannon capacity can be evaluated for mismatched LLR computation and it can be reduced if the mismatched LLR computation is not an one-to-one mapping function. We will derive the Shannon capacity, threshold and stable condition of LDPC codes for mismatched BI-AWGN and BIL noise types. The results show that the noise variance estimation errors will not affect the Shannon capacity and stable condition, but the errors do reduce the threshold. The mismatch in noise type will only reduce Shannon capacity when LLR computation is based on BIL.
机译:对家庭环境中短距离上更高质量和更快的多媒体内容交付的不断增长的需求推动了对无线个人区域网(WPAN)中更高数据速率的追求。 IEEE 802.15.3a WPAN候选提案之一是通过对超宽带上的多频带正交频分复用(MB-OFDM)系统使用带有正交相移键控(QPSK)调制的穿孔卷积码来支持高达480 Mbps的数据速率(UWB)频道。在本文的第一部分,我们将更强大的近香农极限Turbo码与带宽有效的网格编码调制(即Turbo网格编码调制(TTCM))相结合,以进一步提高数据速率,最高可达1.2 Gbps。提出了一种针对该TTCM编码MB-OFDM系统的改进的迭代解码器,并对其在高斯和UWB信道上各种脉冲噪声下的误码率性能进行了广泛研究,尤其是在失配情况下。通过在时域和频域中比较脉冲噪声,提供了一种不受噪声失配影响的鲁棒解码器。动态噪声模型的准确估计在接收机上可能非常困难或不可能,因此可能会导致性能显着下降由于噪声不匹配。在本文的第二部分,我们证明[38]中的minimax解码器不是最小化最差的误码率,而是最小化最坏的误码率,而是对先验概率未知的某些噪声模型具有最佳的鲁棒性。二维和更高维;除了turbo码,接近香农容量的另一种纠错码是低密度奇偶校验(LDPC)码。在本文的最后部分,我们扩展了密度演化方法,用于使用不匹配噪声的和积解码。我们将证明,只要解码器中使用的真实噪声类型和估计噪声类型都是二进制输入的无记忆输出对称通道,对数不匹配对数似然比(LLR)计算的输出也是对称的。我们将显示可以针对不匹配的LLR计算评估香农容量,并且如果不匹配的LLR计算不是一对一的映射函数,则可以降低香农容量。对于不匹配的BI-AWGN和BIL噪声类型,我们将得出LDPC码的Shannon容量,阈值和稳定条件。结果表明,噪声方差估计误差不会影响香农容量和稳定状态,但误差确实会降低阈值。仅当基于BIL的LLR计算时,噪声类型的不匹配才会降低Shannon容量。

著录项

  • 作者

    Yang, Libo.;

  • 作者单位

    University of Central Florida.;

  • 授予单位 University of Central Florida.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 159 p.
  • 总页数 159
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号