Share Email Print

Proceedings Paper

Detection of code spread OFDM based on 0-1 integer quadratic programming
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 3 May 2012
PDF: 9 pages
Proc. SPIE 8404, Wireless Sensing, Localization, and Processing VII, 840409 (3 May 2012); doi: 10.1117/12.918978
Show Author Affiliations
Ali Elghariani, Purdue Univ. (United States)
Michael D. Zoltowski, Purdue Univ. (United States)

Published in SPIE Proceedings Vol. 8404:
Wireless Sensing, Localization, and Processing VII
Sohail A. Dianat; Michael David Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?