DC Field | Value | Language |
---|---|---|
dc.contributor.author | 송익호 | ko |
dc.date.accessioned | 2017-12-20T13:00:57Z | - |
dc.date.available | 2017-12-20T13:00:57Z | - |
dc.date.issued | 2011-09-13 | - |
dc.identifier.uri | http://hdl.handle.net/10203/236767 | - |
dc.description.abstract | 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. | - |
dc.title | Near ML decoding method based on metric-first search and branch length threshold | - |
dc.type | Patent | - |
dc.type.rims | PAT | - |
dc.contributor.localauthor | 송익호 | - |
dc.contributor.assignee | KAIST | - |
dc.identifier.iprsType | 특허 | - |
dc.identifier.patentApplicationNumber | 12468569 | - |
dc.identifier.patentRegistrationNumber | 8018828 | - |
dc.date.application | 2009-05-19 | - |
dc.date.registration | 2011-09-13 | - |
dc.publisher.country | US | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.