5,962 research outputs found
Fast-SSC-Flip Decoding of Polar Codes
Polar codes are widely considered as one of the most exciting recent
discoveries in channel coding. For short to moderate block lengths, their
error-correction performance under list decoding can outperform that of other
modern error-correcting codes. However, high-speed list-based decoders with
moderate complexity are challenging to implement. Successive-cancellation
(SC)-flip decoding was shown to be capable of a competitive error-correction
performance compared to that of list decoding with a small list size, at a
fraction of the complexity, but suffers from a variable execution time and a
higher worst-case latency. In this work, we show how to modify the
state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip
ideas. The algorithmic improvements are presented as well as average
execution-time results tailored to a hardware implementation. The results show
that the proposed fast-SSC-flip algorithm has a decoding speed close to an
order of magnitude better than the previous works while retaining a comparable
error-correction performance.Comment: 5 pages, 3 figures, appeared at IEEE Wireless Commun. and Netw. Conf.
(WCNC) 201
Efficient Interpolation in the Guruswami-Sudan Algorithm
A novel algorithm is proposed for the interpolation step of the
Guruswami-Sudan list decoding algorithm. The proposed method is based on the
binary exponentiation algorithm, and can be considered as an extension of the
Lee-O'Sullivan algorithm. The algorithm is shown to achieve both asymptotical
and practical performance gain compared to the case of iterative interpolation
algorithm. Further complexity reduction is achieved by integrating the proposed
method with re-encoding. The key contribution of the paper, which enables the
complexity reduction, is a novel randomized ideal multiplication algorithm.Comment: Submitted to IEEE Transactions on Information Theor
Space-Time Signal Design for Multilevel Polar Coding in Slow Fading Broadcast Channels
Slow fading broadcast channels can model a wide range of applications in
wireless networks. Due to delay requirements and the unavailability of the
channel state information at the transmitter (CSIT), these channels for many
applications are non-ergodic. The appropriate measure for designing signals in
non-ergodic channels is the outage probability. In this paper, we provide a
method to optimize STBCs based on the outage probability at moderate SNRs.
Multilevel polar coded-modulation is a new class of coded-modulation techniques
that benefits from low complexity decoders and simple rate matching. In this
paper, we derive the outage optimality condition for multistage decoding and
propose a rule for determining component code rates. We also derive an upper
bound on the outage probability of STBCs for designing the
set-partitioning-based labelling. Finally, due to the optimality of the
outage-minimized STBCs for long codes, we introduce a novel method for the
joint optimization of short-to-moderate length polar codes and STBCs
Efficient Decoding of Topological Color Codes
Color codes are a class of topological quantum codes with a high error
threshold and large set of transversal encoded gates, and are thus suitable for
fault tolerant quantum computation in two-dimensional architectures. Recently,
computationally efficient decoders for the color codes were proposed. We
describe an alternate efficient iterative decoder for topological color codes,
and apply it to the color code on hexagonal lattice embedded on a torus. In
numerical simulations, we find an error threshold of 7.8% for independent
dephasing and spin flip errors.Comment: 7 pages, LaTe
- …