Paper
3 May 2012 Detection of code spread OFDM based on 0-1 integer quadratic programming
Author Affiliations +
Abstract
In this paper we introduce Integer Quadratic Programming (MIQP) approach to optimally detect QPSK Code Spread OFDM (CS-OFDM) by formulating the problem as a combinatorial optimization problem. The Branch and Bound (BB) algorithm is utilized to solve this integer quadratic programming problem. Furthermore, we propose combined preprocessing steps that can be applied prior to BB so that the computational complexity of the optimum receiver is reduced. The first step in this combination is to detect as much as possible symbols using procedures presented in [9], which is basically based on the gradient of quadratic function. The second step detects the undetected symbols from the first step using MMSE estimator. The result of the latter step will be used to predict the initial upper bound of the BB algorithm. Simulation results show that the proposed preprocessing combination when applied prior to BB provides optimal performance with a significantly reduced computational complexity.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ali Elghariani and Michael D. Zoltowski "Detection of code spread OFDM based on 0-1 integer quadratic programming", Proc. SPIE 8404, Wireless Sensing, Localization, and Processing VII, 840409 (3 May 2012); https://doi.org/10.1117/12.918978
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Orthogonal frequency division multiplexing

Computer programming

Sensors

Computer simulations

Detection and tracking algorithms

Data modeling

Optimization (mathematics)

RELATED CONTENT


Back to Top