In TD-SCDMA systems, multiuser detection (MUD) algorithms are adopted at the base station to reduce multiple access (MAI) and inter-symbol interference (ISI). MMSE MUD algorithms solve a linear problem where the system matrix has a block Toeplitz shape. While exact inversion techniques impose an intolerable computational load, reduced complexity algorithms may be efficiently employed. In this paper we will introduce a novel detector scheme that uses the block Bareiss algorithm and compare it in terms of complexity, performance figures and HW feasibility issues with respect to well know algorithms found in literature. Finally, the most effective algorithm will be implemented using standard VHDL (VHSIC Hardware Description Language) techniques and a FPGA (Field Programmable Gate Array) device will be presented.
Low Complexity Multiuser Detectors for TD-SCDMA Systems: Design and Implementation
V Rampa
2004
Abstract
In TD-SCDMA systems, multiuser detection (MUD) algorithms are adopted at the base station to reduce multiple access (MAI) and inter-symbol interference (ISI). MMSE MUD algorithms solve a linear problem where the system matrix has a block Toeplitz shape. While exact inversion techniques impose an intolerable computational load, reduced complexity algorithms may be efficiently employed. In this paper we will introduce a novel detector scheme that uses the block Bareiss algorithm and compare it in terms of complexity, performance figures and HW feasibility issues with respect to well know algorithms found in literature. Finally, the most effective algorithm will be implemented using standard VHDL (VHSIC Hardware Description Language) techniques and a FPGA (Field Programmable Gate Array) device will be presented.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.