• DocumentCode
    1846680
  • Title

    Optimum joint detection using soft decision combined with maximum gradient search

  • Author

    Al Murrani, K.

  • Author_Institution
    Dept. of Electr. & Electron., Univ. of Nottingham, Semenyih, Malaysia
  • fYear
    2009
  • fDate
    7-10 Sept. 2009
  • Firstpage
    638
  • Lastpage
    641
  • Abstract
    The number of computations required by the optimum maximum likelihood receiver to make a decision on the received signal vector grows exponentially with the number of users in a multiuser CDMA environment which makes it too complex to implement practically. In this paper we suggest a modification in the approach of this receiver to arrive at the maximum likelihood decision. Instead of comparing the received vector for all possible combinations of the transmitted data vector, we use the gradient method to scale the surface of the decision metric in the direction of the optimum maximizing point. Combining this with soft decision by restricting the movement by one dimension at a time after making a decision along the respective axis, we can arrive at the maximum likelihood decision with a number of computations that increases quadratically rather than exponentially with the number of users. Results show that the performance of the optimum receiver using this approach is virtually indistinguishable from the standard computationally intensive approach.
  • Keywords
    code division multiple access; gradient methods; maximum likelihood detection; radio receivers; gradient method; maximum likelihood receiver; multiuser CDMA environment; optimum joint detection; Bit error rate; Correlators; Decorrelation; Gradient methods; Iterative algorithms; Maximum likelihood decoding; Maximum likelihood detection; Multiaccess communication; Multiple access interference; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communication Systems, 2009. ISWCS 2009. 6th International Symposium on
  • Conference_Location
    Tuscany
  • Print_ISBN
    978-1-4244-3584-5
  • Electronic_ISBN
    978-1-4244-3584-5
  • Type

    conf

  • DOI
    10.1109/ISWCS.2009.5285221
  • Filename
    5285221