DocumentCode
3541632
Title
Branch and bound algorithm for code spread OFDM
Author
Elghariani, Ali ; Zoltowski, Michael D.
Author_Institution
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
fYear
2012
fDate
5-8 Aug. 2012
Firstpage
844
Lastpage
847
Abstract
In this paper we introduce Integer Quadratic Programming approach based on the Branch and Bound (BB) algorithm to Code Spread OFDM (CSOFDM) system. Moreover, we propose three simple modifications to the BB algorithm based on the initial Minimum Mean Square Error (MMSE) solution that greatly reduce the complexity of BB and help realizing the near optimal detection of CSOFDM with large number of subcarriers.
Keywords
OFDM modulation; integer programming; mean square error methods; quadratic programming; tree searching; BB algorithm; BB complexity; CSOFDM system; MMSE solution; branch and bound algorithm; code spread OFDM; integer quadratic programming; minimum mean square error; near optimal detection; orthogonal frequency division multiplexing; Bit error rate; Complexity theory; OFDM; Quadratic programming; Standards; Upper bound; Vectors; Branch and Bound; CSOFDM; MMSE; Quadratic Programming; root node;
fLanguage
English
Publisher
ieee
Conference_Titel
Statistical Signal Processing Workshop (SSP), 2012 IEEE
Conference_Location
Ann Arbor, MI
ISSN
pending
Print_ISBN
978-1-4673-0182-4
Electronic_ISBN
pending
Type
conf
DOI
10.1109/SSP.2012.6319838
Filename
6319838
Link To Document