By Topic

Optimum and reduced complexity multiuser detectors for asynchronous CPM signaling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Murphy, P.A. ; Intel Corp., Santa Clara, CA ; Golanbari, M. ; Ford, G.E. ; Ready, M.J.

Maximum likelihood detector algorithms are developed for the matrix of transmitted symbols in a multiuser system in which the received signal is the sum of K cochannel continuous phase modulated (CPM) signals and additive white Gaussian noise. We illustrate that the maximum likelihood matrix detector, which provides optimum detector performance, consists of K sets of front-end matched filters followed by a Viterbi algorithm. We also derive two reduced complexity receivers, demonstrating through simulation that they perform within 1-2 dB of the optimal while substantially reducing complexity. The paper demonstrates how performance can be traded off against complexity, giving particular attention to cochannel Gaussian minimum shift keyed (GMSK) signals

Published in:

Wireless Communications, IEEE Transactions on  (Volume:5 ,  Issue: 8 )