Skip to Main content Skip to Navigation

A geometrical approach detector for solving the combinatorial optimisation problem: Application to wireless communication systems.

Abstract : The demand for mobile communication systems with high data rates and improved link quality for a variety of applications has dramatically increased in recent years. New concepts and methods are necessary in order to cover this huge demand, which counteract or take advantage of the impairments of the mobile communication channel and optimally exploit the limited resources such as bandwidth and power.
The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficients and given vector are comprised of real numbers, arise in many applications: communications, cryptography, MCCDMA, MIMO, to name a few.
The Maximum Likelihood (ML) decoding is equivalent to finding the closest lattice point in an n-dimensional real space. In general, this problem is known to be non deterministic NP hard. In this thesis, a polynomial-time approximation method called Geometrical Intersection and Selection Detector (GISD) is applied to the MLD problem. Moreover, the proposed approach is based on two complementary "real time" operational research methods: intensification and diversification.
Our approach has three important characteristics that make it very attractive for for VLSI implementation. First, It will be shown that the performance of GISD receiver is superior as compared to other sub-optimal detection methods and it provides a good approximation to the optimal detector. Second, the inherent parallel structure of the proposed method leads to a very suitable hardware implementation. Finaly, The GISD allows a near optimal performance with constant polynomial-time, O(n3), computational complexity (unlike the sphere decoding that has exponential-time complexity for low SNR). The proposed Detector can be efficiently employed in most wireless communications systems: MIMO, MC-CDMA, MIMO-CDMA etc...
Complete list of metadatas

Cited literature [78 references]  Display  Hide  Download
Contributor : Emmanuel Boutillon <>
Submitted on : Wednesday, October 18, 2006 - 10:33:15 AM
Last modification on : Thursday, October 11, 2018 - 11:52:05 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:51:39 PM


  • HAL Id : tel-00106708, version 1



Amor Nafkha. A geometrical approach detector for solving the combinatorial optimisation problem: Application to wireless communication systems.. Modélisation et simulation. Université de Bretagne Sud, 2006. Français. ⟨tel-00106708⟩



Record views


Files downloads