40,878 research outputs found
Scalable Successive-Cancellation Hardware Decoder for Polar Codes
Polar codes, discovered by Ar{\i}kan, are the first error-correcting codes
with an explicit construction to provably achieve channel capacity,
asymptotically. However, their error-correction performance at finite lengths
tends to be lower than existing capacity-approaching schemes. Using the
successive-cancellation algorithm, polar decoders can be designed for very long
codes, with low hardware complexity, leveraging the regular structure of such
codes. We present an architecture and an implementation of a scalable hardware
decoder based on this algorithm. This design is shown to scale to code lengths
of up to N = 2^20 on an Altera Stratix IV FPGA, limited almost exclusively by
the amount of available SRAM
Low-Complexity Puncturing and Shortening of Polar Codes
In this work, we address the low-complexity construction of shortened and
punctured polar codes from a unified view. While several independent puncturing
and shortening designs were attempted in the literature, our goal is a unique,
low-complexity construction encompassing both techniques in order to achieve
any code length and rate. We observe that our solution significantly reduces
the construction complexity as compared to state-of-the-art solutions while
providing a block error rate performance comparable to constructions that are
highly optimized for specific lengths and rates. This makes the constructed
polar codes highly suitable for practical application in future communication
systems requiring a large set of polar codes with different lengths and rates.Comment: to appear in WCNC 2017 - "Polar Coding in Wireless Communications:
Theory and Implementation" Worksho
Rewriting Flash Memories by Message Passing
This paper constructs WOM codes that combine rewriting and error correction
for mitigating the reliability and the endurance problems in flash memory. We
consider a rewriting model that is of practical interest to flash applications
where only the second write uses WOM codes. Our WOM code construction is based
on binary erasure quantization with LDGM codes, where the rewriting uses
message passing and has potential to share the efficient hardware
implementations with LDPC codes in practice. We show that the coding scheme
achieves the capacity of the rewriting model. Extensive simulations show that
the rewriting performance of our scheme compares favorably with that of polar
WOM code in the rate region where high rewriting success probability is
desired. We further augment our coding schemes with error correction
capability. By drawing a connection to the conjugate code pairs studied in the
context of quantum error correction, we develop a general framework for
constructing error-correction WOM codes. Under this framework, we give an
explicit construction of WOM codes whose codewords are contained in BCH codes.Comment: Submitted to ISIT 201
A Novel Interleaving Scheme for Polar Codes
It's known that the bit errors of polar codes with successive cancellation
(SC) decoding are coupled. We call the coupled information bits the correlated
bits. In this paper, concatenation schemes are studied for polar codes (as
inner codes) and LDPC codes (as outer codes). In a conventional concatenation
scheme, to achieve a better BER performance, one can divide all bits in a
LDPC block into polar blocks to completely de-correlate the possible
coupled errors. In this paper, we propose a novel interleaving scheme between a
LDPC code and a polar code which breaks the correlation of the errors among the
correlated bits. This interleaving scheme still keeps the simple SC decoding of
polar codes while achieves a comparable BER performance at a much smaller delay
compared with a -block delay scheme
Questions and responses in Lao
This paper surveys the structure of questions and their responses in Lao, a Southwestern Tai language spoken in Laos, Thailand, and Cambodia. Data are from video-recordings of naturally occurring conversation in Vientiane, Laos. An outline of the lexico-grammatical options for formulating questions describes content (‘WH’) questions and polar (‘yes/no’) questions. The content question forms are from a set of indefinite pronouns. The WHAT, WHERE, and WHO categories have higher token frequency than the other categories. Polar questions are mostly formed by the addition of different turn-final markers, with different meanings. ‘Declarative questions’ (i.e., polar questions which are formally identical to statements) are common. An examination of the interactional functions of questions in the data show asymmetries between polar and content questions, with content questions used mostly for requesting information, while polar questions are also widely used for requesting confirmation, among other things. There is discussion of the kinds of responses that are appropriate or preferred given certain types of question. Alongside discussion of numerous examples, the paper provides quantitative data on the frequencies of various patterns in questions and responses. These data form part of a large-scale, ten-language coding study
- …