A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform

Sharfer, I.; Hero, Alfred O.

doi:10.1109/78.747786

Cited by 17 publications

(21 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solving the dual optimization problem and using the resulting solution for heuristics involves a high level of computational complexity, making this approach ill-suited to an adaptive solution. Therefore, we describe the single coordinate ascent algorithm [7] as an adaptive solution. Simulation results show that both the SLM settings generated by the computationally intensive heuristics and by single coordinate ascent very nearly achieve the performance upper bound.…”

Section: Ook Modulatormentioning

confidence: 99%

See 1 more Smart Citation

Equalization of modal dispersion in multimode fiber using spatial light modulators

Alon

Stojanović

Kahn

et al.

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

-Intersymbol interference (ISI) due to modal dispersion is the dominant limitation to the bit rate-distance product in multimode fiber-optic communication systems. If the light launched into the fiber excites only the desired principal modes, modal dispersion can be eliminated. We can achieve this by using spatial light modulators (SLMs) to perform adaptive spatial filtering on the electric fields of the light. In this paper, we develop an optimization framework for setting the SLMs to obtain an upper bound on the achievable performance and develop heuristics that nearly reach this upper bound. Using this framework, we show that both a sophisticated semidefinite programming-based algorithm and a simple adaptive algorithm achieve performance close to the upper bound. Performance and system complexity tradeoff curves are constructed, showing that a 20×20 array of SLM pixels with binary phase control performs within 15% of more complex implementations. Finally, we extend the framework and present preliminary results showing the promise of further increases in the capabilities of multimode fiber by using the fiber as a multiple-input, multiple-output (MIMO) transmission medium.

show abstract

Section: Ook Modulatormentioning

confidence: 99%

“…One of the simplest optimization algorithms (both in terms of computational complexity and hardware implementation) is single coordinate ascent (SCA) [7]. At each step of the SCA algorithm, all of the variables in the problem are fixed except for one.…”

Section: B Single Coordinate Ascentmentioning

confidence: 99%

Equalization of modal dispersion in multimode fiber using spatial light modulators

Alon

Stojanović

Kahn

et al.

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

show abstract

“…(31) it is necessary to convert (31) to a real-valued SDP following the standard formulation in (23). Let Re and Im define the real and imaginary parts of .…”

Section: B Interior-point Algorithm For Sdrmentioning

confidence: 99%

Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems

Ching

Ding

2004

IEEE Trans. Signal Process.

101

View full text Add to dashboard Cite

Because of the powerful symbol error performance of multiuser maximum-likelihood (ML) detection, recently, there has been much interest in seeking effective ways of approximating multiuser ML detection (MLD) with affordable computational costs. It has been illustrated that for the synchronous code division multiple access (CDMA) scenario, the so-called semidefinite relaxation (SDR) algorithm can accurately and efficiently approximate multiuser MLD. This SDR-MLD algorithm, however, can only handle binary and quadratic phase shift keying (PSK) symbol constellations. In this sequel, we propose an extended SDR algorithm for MLD with -ary PSK (MPSK) constellations. For the synchronous CDMA scenario, the proposed SDR algorithm provides an attractive polynomial-time complexity order of 3 5 , where is the number of users. Simulation results indicate that the proposed detector provides improved symbol error performance compared with several commonly used multiuser detectors.Index Terms-M-ary phase shift keying, maximum likelihood detection, multiuser detection, relaxation methods, semidefinite programming.

show abstract

“…A review on these early proposed classes of detector can be found in [4]. A tree search method [5] and a coordinate descent algorithm [6] have been proposed to perform an incomplete search for a solution to the problem (1) with limited complexity, however, the performances of these methods strongly depend on the initialization. In [3,7], a detection strategy based on a semidefinite relaxation of the CDMA maximum likelihood problem is investigated.…”

Section: Introductionmentioning

confidence: 99%

A Second-Order Cone Programming Method for Multiuser Detection Problem

Zhang

2010

Wireless Pers Commun

View full text Add to dashboard Cite

Based on the binary quadratic programming model of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the second-order cone programming method is presented. The proposed method relaxes the binary quadratic programming model as a second-order cone programming model. Coupled with the sign function, a suboptimal solution is obtained for the multiuser detection problem. Comparing with the reported semidefinite programming method, simulations demonstrate that the second-order cone programming method often yields the similar bit error rate (BER) performances for the multiuser detection problem, but the average CPU time of this method is significantly reduced.

show abstract

A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform

Cited by 17 publications

References 39 publications

Equalization of modal dispersion in multimode fiber using spatial light modulators

Equalization of modal dispersion in multimode fiber using spatial light modulators

Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems

A Second-Order Cone Programming Method for Multiuser Detection Problem

Contact Info

Product

Resources

About