{"title":"AWGN上q位PSK调制线性码的最小伪距离下界","authors":"Vitaly Skachek, M. Flanagan","doi":"10.1109/TURBOCODING.2008.4658737","DOIUrl":null,"url":null,"abstract":"We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum ldquopseudodistancerdquo) for coded modulation systems using linear codes with q-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The minimum pseudodistance may serve as a first-order measure of error-correcting performance for both linear-programming and message-passing based receivers. In the case of a linear-programming based receiver, the minimum pseudodistance may be used to form an exact bound on the codeword error rate of the system.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Lower bounds on the minimum pseudodistance for linear codes with q-ary PSK modulation over AWGN\",\"authors\":\"Vitaly Skachek, M. Flanagan\",\"doi\":\"10.1109/TURBOCODING.2008.4658737\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum ldquopseudodistancerdquo) for coded modulation systems using linear codes with q-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The minimum pseudodistance may serve as a first-order measure of error-correcting performance for both linear-programming and message-passing based receivers. In the case of a linear-programming based receiver, the minimum pseudodistance may be used to form an exact bound on the codeword error rate of the system.\",\"PeriodicalId\":284046,\"journal\":{\"name\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TURBOCODING.2008.4658737\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th International Symposium on Turbo Codes and Related Topics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TURBOCODING.2008.4658737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Lower bounds on the minimum pseudodistance for linear codes with q-ary PSK modulation over AWGN
We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum ldquopseudodistancerdquo) for coded modulation systems using linear codes with q-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The minimum pseudodistance may serve as a first-order measure of error-correcting performance for both linear-programming and message-passing based receivers. In the case of a linear-programming based receiver, the minimum pseudodistance may be used to form an exact bound on the codeword error rate of the system.