Abstract
In this paper we introduce Integer Quadratic Programming (IQP) approach to detect QPSK Code Spread OFDM (CSOFDM) signal 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 preprocessing procedures that can be applied prior to BB so that the computational complexity of the optimum receiver is reduced. The basic idea of the proposed preprocessing is to introduce a good choice of upper bound for the BB search tree and/or reduce the search space of the BB problem. Performance and complexity computations of these preprocessing are investigated. Simulation results show that the proposed preprocessing when applied prior to BB provides optimal or near 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
