Invention Grant
- Patent Title: Branch processing of search tree in a sphere decoder
- Patent Title (中): 搜索树在球体解码器中的分支处理
-
Application No.: US13518437Application Date: 2010-12-30
-
Publication No.: US09124459B2Publication Date: 2015-09-01
- Inventor: Özgün Paker , Sebastian Eckert , Sebastien Mouy
- Applicant: Özgün Paker , Sebastian Eckert , Sebastien Mouy
- Applicant Address: SE Stockholm
- Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
- Current Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
- Current Assignee Address: SE Stockholm
- Agency: Patent Portfolio Builders PLLC
- Priority: EP09180937 20091230
- International Application: PCT/EP2010/070946 WO 20101230
- International Announcement: WO2011/080326 WO 20110707
- Main IPC: H04L27/06
- IPC: H04L27/06 ; H04L25/03

Abstract:
Sphere decoding of signals for MIMO detection involves a first distance processor arranged to determine a distance between symbols of a received symbol vector and possible transmit symbols, in a search sequence according to a search tree. A line from root to leaf of the search tree represents a possible transmit symbol vector and the sequence of processing root level symbols can be ordered with respect to increasing distance without explicit sorting of the root level symbols based on distance calculations. A next symbol in the sequence is determined, based on a symbol currently being processed by the first distance processor, and a second distance processor determines the distance in respect of the next symbol in the search sequence for the same possible transmit symbol vector, in parallel with the determining of the distance in respect of the current symbol by the first distance processor.
Public/Granted literature
- US20120269303A1 Branch Processing of Search Tree in a Sphere Decoder Public/Granted day:2012-10-25
Information query