High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based...High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based multiple access scheme, grouped spread IDMA （GSIDMA）, is proposed. In a GSIDMA system, lower complexity and latency for mobile stations can be achieved by appropriately dividing active users into different groups. The system model of GSIDMA is constructed and followed by analysing on its system capacity, complexity and latency, and bit error rate （BER） performance. The extrinsic information transfer （EXIT） chart is used to analyze the convergence behavior of the iteration process. The grouping method and interleavers-reuse issue for GSIDMA are also discussed preliminarily. The analyses and simulation results indicate that the complexity and latency of the proposed scheme are much lower than those of IDMA, whereas its BER performance is close to the latter. The properties of low complexity and low latency make it more feasible for the practical implementation.展开更多
基金supported by the National Natural Science Foundation of China (61171180)the National Basic Resaearch Program (923 Program) (2007CB31(0606))the Natural Sientific Research Innovation Foundation in Harbin Institute of Technology (HIT. NSRIF20011117)
文摘High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based multiple access scheme, grouped spread IDMA （GSIDMA）, is proposed. In a GSIDMA system, lower complexity and latency for mobile stations can be achieved by appropriately dividing active users into different groups. The system model of GSIDMA is constructed and followed by analysing on its system capacity, complexity and latency, and bit error rate （BER） performance. The extrinsic information transfer （EXIT） chart is used to analyze the convergence behavior of the iteration process. The grouping method and interleavers-reuse issue for GSIDMA are also discussed preliminarily. The analyses and simulation results indicate that the complexity and latency of the proposed scheme are much lower than those of IDMA, whereas its BER performance is close to the latter. The properties of low complexity and low latency make it more feasible for the practical implementation.
