Reduced Latency ML Polar Decoding via Multiple Sphere-Decoding Tree Searches
نویسندگان
چکیده
منابع مشابه
Revisited Design Criteria For STBCs With Reduced Complexity ML Decoding
The design of linear STBCs offering a low-complexity ML decoding using the well known Sphere Decoder (SD) has been extensively studied in last years. The first considered approach to derive design criteria for the construction of such codes is based on the Hurwitz-Radon (HR) Theory for mutual orthogonality between the weight matrices defining the linear code. This appproach served to construct ...
متن کاملSoft-Input Soft-Output Single Tree-Search Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context of multiple-input multiple-output (MIMO) wireless communication systems. In this paper, we present a low-complexity SISO sphere-decoding algorithm, based on...
متن کاملA Low-complexity Near-ML Decoding Via Reduced Dimension Maximum Likelihood Search
In this paper, we consider a low-complexity ML detection technique referred to as reduced dimension ML search (RD-MLS). RD-MLS directly refers the division of symbols into two groups viz. strong and weak group for searching over vector space with strong symbols instead of whole symbols. The inevitable performance loss, due to the exclusion of weak symbols, is compensated by 1) the list tree sea...
متن کاملLow ML Decoding Complexity STBCs via Codes over GF(4)
In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field F4. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over F4, for number of transmit antennas N = 2m, ...
متن کاملReduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes
Cyclic redundancy check (CRC) aided polar codes are capable of achieving better performance than low-density parity-check (LDPC) codes under the successive cancelation list (SCL) decoding scheme. However, the SCL decoding scheme suffers from very high space and time complexities. Especially, the high space complexity is a major concern for adopting polar codes in modern mobile communication sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2018
ISSN: 0018-9545,1939-9359
DOI: 10.1109/tvt.2017.2761262