%0 Conference Paper %1 wang2018gaussian %A Wang, Xiaojie %A Cammerer, Sebastian %A ten Brink, Stephan %B 2018 IEEE 10th International Symposium on Turbo Codes Iterative Information Processing (ISTC) %D 2018 %K %R 10.1109/ISTC.2018.8625311 %T Near Gaussian Multiple Access Channel Capacity Detection and Decoding %X We consider the design of low-density parity-check (LDPC) codes with close-to-capacity performance for interleave division multiple access (IDMA). The degree profile of the LDPC code is optimized using extrinsic information transfer (EXIT) charts to match an IDMA low complexity multiuser detector. Analytical EXIT functions for the IDMA system are derived while verifying that the Gaussian approximation stays valid for a sufficiently large number of users. The resulting LDPC codes are of rather low-rate (e.g., Rc = 0.03 for 32 users) and thus, the practical design of such codes is quite challenging and may, due to the low code-rate, not even yield a performance close to the Gaussian multiple access channel (GMAC) capacity. Adding a serial concatenation with a simple repetition code allows to design matching LDPC codes with a higher rate and, this way, achieving closer to GMAC capacity. This makes IDMA an attractive multiple access scheme for future wireless communication systems. %@ 978-1-5386-7048-4 and 978-1-5386-7047-7 and 978-1-5386-7049-1

@inproceedings{wang2018gaussian, abstract = {We consider the design of low-density parity-check (LDPC) codes with close-to-capacity performance for interleave division multiple access (IDMA). The degree profile of the LDPC code is optimized using extrinsic information transfer (EXIT) charts to match an IDMA low complexity multiuser detector. Analytical EXIT functions for the IDMA system are derived while verifying that the Gaussian approximation stays valid for a sufficiently large number of users. The resulting LDPC codes are of rather low-rate (e.g., Rc = 0.03 for 32 users) and thus, the practical design of such codes is quite challenging and may, due to the low code-rate, not even yield a performance close to the Gaussian multiple access channel (GMAC) capacity. Adding a serial concatenation with a simple repetition code allows to design matching LDPC codes with a higher rate and, this way, achieving closer to GMAC capacity. This makes IDMA an attractive multiple access scheme for future wireless communication systems.}, added-at = {2023-08-31T15:17:13.000+0200}, author = {Wang, Xiaojie and Cammerer, Sebastian and ten Brink, Stephan}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2ce1126366ad6e158e75c1c2a08e29cc1/puma-wartung}, booktitle = {2018 IEEE 10th International Symposium on Turbo Codes Iterative Information Processing (ISTC)}, doi = {10.1109/ISTC.2018.8625311}, eventdate = {2018-12-03/2018-12-07}, eventtitle = {2018 IEEE 10th International Symposium on Turbo Codes Iterative Information Processing (ISTC)}, interhash = {5ab5a74e7a6b574cfd5954d368d1c0c6}, intrahash = {ce1126366ad6e158e75c1c2a08e29cc1}, isbn = {{978-1-5386-7048-4} and {978-1-5386-7047-7} and {978-1-5386-7049-1}}, keywords = {}, language = {eng}, timestamp = {2023-08-31T13:17:13.000+0200}, title = {Near Gaussian Multiple Access Channel Capacity Detection and Decoding}, venue = {Hong Kong}, year = 2018 }