Abstract

This paper presents a memory-efficient receiver architecture for interleave division multiple access (IDMA). For the iterative multiuser detection, existing IDMA architectures first store all log-likelihood ratios (LLRs) into a memory in an iteration, and then despread them in the following iteration. To store new LLRs in the following iteration without overwriting the previous ones to be despread, the memory needs to be duplicated. The proposed architecture, on the other hand, despreads the LLRs on-the-fly while storing them by immediately processing one LLR per cycle. As a result, the architecture finishes despreading within one iteration and is free of the duplicate memory. Since the hardware complexity and the power consumption of an IDMA receiver are dominated by the memory usage, the proposed architecture is particularly effective in alleviating such measures. Moreover, the proposed architecture mitigates the overall latency slightly, as it is exempted from the additional cycles required to despread in the last iteration. Implementation results demonstrate that the IDMA receivers based on the proposed architecture require 57% bits in memories, occupy only 39% silicon area, and consume only 30% power on average, compared to the latest low-latency architecture.

Full Text
Published version (Free)

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 call