Abstract
This paper presents a low-complexity address generation unit (AGU) for multiuser detectors in interleave division multiple access (IDMA) systems. To this end, for the first time, all possible options for designing AGUs are first analyzed in detail. Subsequently, a complexity reduction technique is applied to each of those architectures. More specifically, some components in AGUs are relocated to make them shareable and removable without affecting the functionality. The complete transparency of such renovation makes it applicable to any existing multiuser detector without tailoring the interfacing components therein. Measuring the hardware complexity, all the resulting AGUs are compared with each other, and a new architecture simpler than the state-of-the-art one is developed. Implementation results in a 65 nm CMOS process, demonstrating that the proposed AGU can alleviate the equivalent gate count and the power consumption of the prior process by 13% and 31%, respectively.
Highlights
IntroductionNonorthogonal multiple access (NOMA) is an emerging class of multiple-access technologies in
Nonorthogonal multiple access (NOMA) is an emerging class of multiple-access technologies in candidate for the forthcoming applications [3].Recent works in the literature have pioneered sophisticated multiuser detector architectures for interleave division multiple access (IDMA) systems [4,5,6,7,8,9,10,11]
Recent works in the literature have pioneered sophisticated multiuser detector architectures for IDMA systems [4,5,6,7,8,9,10,11]
Summary
Nonorthogonal multiple access (NOMA) is an emerging class of multiple-access technologies in. All the resulting AGUs are compared with each other, and a new architecture simpler than the state-of-the-art one is developed. In a multiuser detector receiving the chips with interference, ESE are evaluated and discussed along with the implementation results. In a multiuser detector receiving the chips with interference, the ESE first s=0 distributes lu(πu(j)) to UPBu for u = 1, 2, ..., U, where lu(πu(j)) is the log-likelihood ratio (LLR) of the jth du (pufrom (j)) is called despread. The state-of-the-art scheme to calculate (1), which is called on-the-fly despreading [5], has dominantly been employed by the latest UPBs [5,6,7,8] It comprises two phases: 1) reception and 2) response.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have