{"title":"Dynamic channel resource allocation in frequency hopped wireless communication systems","authors":"C.C. Wang, G. Pottie","doi":"10.1109/ISIT.1994.394739","DOIUrl":null,"url":null,"abstract":"In a conventional TDMA wireless system, the blocking probability is affected by the worst case interference statistics. Modifying the system to a frequency-hopped CDMA (CDMA-FH) system can change the blocking probability to be determined by average statistics. Hopping patterns can be implemented easily using Latin squares. A system using Latin squares of size n guarantees no users in the same cell share any slots and a user and all users in different cells share only one out of every n slots. Channel coding over hops then suppresses the worst interference. Further improvements may be obtained by allowing users to occupy M out of N slots where M/spl les/N. Centralized and distributed dynamic channel allocation (DCA) algorithms which allow users to have different SIR requirements have been developed to maximize the capacity of the system under a desired blocking probability.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394739","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In a conventional TDMA wireless system, the blocking probability is affected by the worst case interference statistics. Modifying the system to a frequency-hopped CDMA (CDMA-FH) system can change the blocking probability to be determined by average statistics. Hopping patterns can be implemented easily using Latin squares. A system using Latin squares of size n guarantees no users in the same cell share any slots and a user and all users in different cells share only one out of every n slots. Channel coding over hops then suppresses the worst interference. Further improvements may be obtained by allowing users to occupy M out of N slots where M/spl les/N. Centralized and distributed dynamic channel allocation (DCA) algorithms which allow users to have different SIR requirements have been developed to maximize the capacity of the system under a desired blocking probability.<>