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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
