Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Low-Complexity Sphere Decoding of Polar Codes based on Optimum Path
  Metric   Sphere decoding (SD) of polar codes is an efficient method to achieve the
error performance of maximum likelihood (ML) decoding. But the complexity of
the conventional sphere decoder is still high, where the candidates in a target
sphere are enumerated and the radius is decreased gradually until no available
candidate is in the sphere. In order to reduce the complexity of SD, a stack SD
(SSD) algorithm with an efficient enumeration is proposed in this paper. Based
on a novel path metric, SSD can effectively narrow the search range when
enumerating the candidates within a sphere. The proposed metric follows an
exact ML rule and takes the full usage of the whole received sequence.
Furthermore, another very simple metric is provided as an approximation of the
ML metric in the high signal-to-noise ratio regime. For short polar codes,
simulation results over the additive white Gaussian noise channels show that
the complexity of SSD based on the proposed metrics is up to 100 times lower
than that of the conventional SD.

4
The categories of this paper are: cond-mat
20
The categories of this paper are: acc-phys
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph