{"title":"多用户多电平FSK的迭代译码界","authors":"M. Sharma, J. Portugheis","doi":"10.1109/SPAWC.2008.4641583","DOIUrl":null,"url":null,"abstract":"In this work we study joint multiuser detection using factor graphs for an N frequency T user noisy multiple access channel. This channel may model a frequency hopped code division multiple access system. The system is separated in two parts: multiuser detector and a code. We present a factor graph for the multiuser detector and obtain from it extrinsic information transfer (EXIT) curves. Paired with the EXIT curves of low density parity check and repeat accumulate codes, we obtain values for the signal to noise ratio (SNR) that bound the systempsilas performance. The EXIT curves for the codes are presented from the detectors perspective. The results show that rates close to the sum capacity are achievable.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Iterative decoding bounds for multiuser multilevel FSK\",\"authors\":\"M. Sharma, J. Portugheis\",\"doi\":\"10.1109/SPAWC.2008.4641583\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we study joint multiuser detection using factor graphs for an N frequency T user noisy multiple access channel. This channel may model a frequency hopped code division multiple access system. The system is separated in two parts: multiuser detector and a code. We present a factor graph for the multiuser detector and obtain from it extrinsic information transfer (EXIT) curves. Paired with the EXIT curves of low density parity check and repeat accumulate codes, we obtain values for the signal to noise ratio (SNR) that bound the systempsilas performance. The EXIT curves for the codes are presented from the detectors perspective. The results show that rates close to the sum capacity are achievable.\",\"PeriodicalId\":197154,\"journal\":{\"name\":\"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2008.4641583\",\"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 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative decoding bounds for multiuser multilevel FSK
In this work we study joint multiuser detection using factor graphs for an N frequency T user noisy multiple access channel. This channel may model a frequency hopped code division multiple access system. The system is separated in two parts: multiuser detector and a code. We present a factor graph for the multiuser detector and obtain from it extrinsic information transfer (EXIT) curves. Paired with the EXIT curves of low density parity check and repeat accumulate codes, we obtain values for the signal to noise ratio (SNR) that bound the systempsilas performance. The EXIT curves for the codes are presented from the detectors perspective. The results show that rates close to the sum capacity are achievable.