Skip to Main Content
Joint detection (JD) is a key technology in 3rd generation mobile communication systems like UTRA-TDD; it can be used to eliminate the intracell multiple access interference (MAI) and intersymbol interference (ISI). However, high complexity blocks its commercial application. The bottleneck can be generalized into one problem, to calculate the matrix inversion. A new method is proposed to reduce the complexity of the joint detection algorithm, and the simulation results indicate that the performance is acceptable in practical applications. The algorithm complexity is reduced 18 times, based on simulation duration, compared with a traditional Cholesky method. Even if compared with approximate Cholesky decomposition, the complexity is reduced by 6 percent, based on the complex multiplication times.
Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE (Volume:4 )
Date of Conference: 1-5 Dec. 2003