Near ML decoding method based on metric-first search and branch length threshold

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 299
  • Download : 0
In this invention, we propose a near maximum likelihood (ML) method for the decoding of multiple input multiple output systems. By employing the metric-first search method, Schnorr-Euchner enumeration, and branch length thresholds in a single frame systematically, the proposed technique provides a higher efficiency than other conventional near ML decoding schemes. From simulation results, it is confirmed that the proposed method has lower computational complexity than other near ML decoders while maintaining the bit error rate (BER) very close to the ML performance. The proposed method in addition possesses the capability of allowing flexible tradeoffs between the computational complexity and BER performance.
Assignee
KAIST
Country
US (United States)
Issue Date
2011-09-13
Application Date
2009-05-19
Application Number
12468569
Registration Date
2011-09-13
Registration Number
8018828
URI
http://hdl.handle.net/10203/236767
Appears in Collection
EE-Patent(특허)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0