{"title":"卷积码在伯努利-高斯脉冲噪声信道上的性能分析","authors":"Hassan Hamad, G. Kraidy","doi":"10.1109/CWIT.2017.7994817","DOIUrl":null,"url":null,"abstract":"This paper investigates the performance of convolutional codes with quadrature amplitude modulation transmitted over the Bernoulli-Gaussian impulsive noise channel. First, the performance superiority of blanking over clipping of the symbols affected by noise pulses is proved through the computation of a lower bound on the bit error rate. Next, lower and upper bounds on the bit error rate performance are derived. Finally, bit error rate curves based on Monte Carlo simulations are shown together with the proposed bounds.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Performance analysis of convolutional codes over the Bernoulli-Gaussian impulsive noise channel\",\"authors\":\"Hassan Hamad, G. Kraidy\",\"doi\":\"10.1109/CWIT.2017.7994817\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the performance of convolutional codes with quadrature amplitude modulation transmitted over the Bernoulli-Gaussian impulsive noise channel. First, the performance superiority of blanking over clipping of the symbols affected by noise pulses is proved through the computation of a lower bound on the bit error rate. Next, lower and upper bounds on the bit error rate performance are derived. Finally, bit error rate curves based on Monte Carlo simulations are shown together with the proposed bounds.\",\"PeriodicalId\":247812,\"journal\":{\"name\":\"2017 15th Canadian Workshop on Information Theory (CWIT)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 15th Canadian Workshop on Information Theory (CWIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2017.7994817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th Canadian Workshop on Information Theory (CWIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2017.7994817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance analysis of convolutional codes over the Bernoulli-Gaussian impulsive noise channel
This paper investigates the performance of convolutional codes with quadrature amplitude modulation transmitted over the Bernoulli-Gaussian impulsive noise channel. First, the performance superiority of blanking over clipping of the symbols affected by noise pulses is proved through the computation of a lower bound on the bit error rate. Next, lower and upper bounds on the bit error rate performance are derived. Finally, bit error rate curves based on Monte Carlo simulations are shown together with the proposed bounds.