{"title":"Adaptive error control based on type-I hybrid-ARQ protocols","authors":"M. Rice, S. Wicker","doi":"10.1109/ITS.1990.175593","DOIUrl":null,"url":null,"abstract":"An adaptive error control technique based on the use of type-I hybrid-ARQ protocols is presented. Nonstationary channels are modeled as finite-state Markov chains. The system counts the number of retransmission requests during an observation interval called a frame and, together with knowledge of the code in use and a set of thresholds, estimates the state of the channel. The code which maximizes throughput while maintaining a minimum level of reliability is chosen for use in the next frame. The optimal code for each state is determined a priori by varying both the rate and the number of errors corrected by a family of fixed-length codes. The procedure is demonstrated using Reed-Solomon codes.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"437 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SBT/IEEE International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.1990.175593","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
An adaptive error control technique based on the use of type-I hybrid-ARQ protocols is presented. Nonstationary channels are modeled as finite-state Markov chains. The system counts the number of retransmission requests during an observation interval called a frame and, together with knowledge of the code in use and a set of thresholds, estimates the state of the channel. The code which maximizes throughput while maintaining a minimum level of reliability is chosen for use in the next frame. The optimal code for each state is determined a priori by varying both the rate and the number of errors corrected by a family of fixed-length codes. The procedure is demonstrated using Reed-Solomon codes.<>