Abstract
It is shown that the encoding/decoding problem for any asynchronous M-user memoryless multiple-access channel (MAC) can be reduced to corresponding problems for at most 2M-1 single-user memoryless channels. This is done via a method called generalized time sharing that is closely related to a previously developed method called rate-splitting multiple access. These methods reduce the seemingly hard task of finding good multiple-access codes and implementable decoders for such codes to the much better understood task of finding codes and decoders for single-user channels. As a by-product, some interesting properties of the capacity region of M-user asynchronous discrete memoryless channels are derived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
