{"title":"Fano和stack算法解码器误码率的统计评估","authors":"K. Muhammad, K. B. Letaief","doi":"10.1109/ICCS.1992.255138","DOIUrl":null,"url":null,"abstract":"The estimation of the bit error probability is fundamental to the performance evaluation of today's complex digital communication systems. Unfortunately, from a computational point of view the conventional Monte Carlo (MC) approach proves to be extremely difficult, if not impossible, for simulating such systems. As a result, it is highly desirable to devise MC methods which retain the ability to simulate complex systems, yet require substantially fewer simulation runs to estimate small probabilities. A new quick MC technique for estimating the bit error rate (BER) of sequential decoders is presented. It is shown that the new technique is extremely efficient from a computational point of view and can be used to accurately estimate the BER for specific time invariant convolutional codes.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Statistical evaluation of the error rate of the Fano and stack algorithm decoders\",\"authors\":\"K. Muhammad, K. B. Letaief\",\"doi\":\"10.1109/ICCS.1992.255138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The estimation of the bit error probability is fundamental to the performance evaluation of today's complex digital communication systems. Unfortunately, from a computational point of view the conventional Monte Carlo (MC) approach proves to be extremely difficult, if not impossible, for simulating such systems. As a result, it is highly desirable to devise MC methods which retain the ability to simulate complex systems, yet require substantially fewer simulation runs to estimate small probabilities. A new quick MC technique for estimating the bit error rate (BER) of sequential decoders is presented. It is shown that the new technique is extremely efficient from a computational point of view and can be used to accurately estimate the BER for specific time invariant convolutional codes.<<ETX>>\",\"PeriodicalId\":223769,\"journal\":{\"name\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1992.255138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.255138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Statistical evaluation of the error rate of the Fano and stack algorithm decoders
The estimation of the bit error probability is fundamental to the performance evaluation of today's complex digital communication systems. Unfortunately, from a computational point of view the conventional Monte Carlo (MC) approach proves to be extremely difficult, if not impossible, for simulating such systems. As a result, it is highly desirable to devise MC methods which retain the ability to simulate complex systems, yet require substantially fewer simulation runs to estimate small probabilities. A new quick MC technique for estimating the bit error rate (BER) of sequential decoders is presented. It is shown that the new technique is extremely efficient from a computational point of view and can be used to accurately estimate the BER for specific time invariant convolutional codes.<>