Zobrazeno 1 - 10
of 181
pro vyhledávání: '"Thibeault, Claude"'
Autor:
Giard, Pascal, Balatsoukas-Stimming, Alexios, Müller, Thomas Christoph, Bonetti, Andrea, Thibeault, Claude, Gross, Warren J., Flatresse, Philippe, Burg, Andreas
Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an e
Externí odkaz:
http://arxiv.org/abs/1708.09603
Autor:
Giard, Pascal, Balatsoukas-Stimming, Alexios, Müller, Thomas Christoph, Burg, Andreas, Thibeault, Claude, Gross, Warren J.
Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex succes
Externí odkaz:
http://arxiv.org/abs/1702.00938
Autor:
Giard, Pascal, Sarkis, Gabi, Balatsoukas-Stimming, Alexios, Fan, YouZhe, Tsui, Chi-ying, Burg, Andreas, Thibeault, Claude, Gross, Warren J.
Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction pe
Externí odkaz:
http://arxiv.org/abs/1606.00737
Autor:
Giard, Pascal, Balatsoukas-Stimming, Alexios, Sarkis, Gabi, Thibeault, Claude, Gross, Warren J.
Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better acc
Externí odkaz:
http://arxiv.org/abs/1603.05273
Autor:
Hashemi, Seyyed Ali, Balatsoukas-Stimming, Alexios, Giard, Pascal, Thibeault, Claude, Gross, Warren J.
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this pa
Externí odkaz:
http://arxiv.org/abs/1512.03128
In this work, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on polar codes of any length less than a maximum and of any rate. We describe the low-complexity,
Externí odkaz:
http://arxiv.org/abs/1507.03614
In this work, we present a family of architectures for polar decoders using a reduced-complexity successive-cancellation decoding algorithm that employs unrolling to achieve extremely high throughput values while retaining moderate implementation com
Externí odkaz:
http://arxiv.org/abs/1505.01459
Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as
Externí odkaz:
http://arxiv.org/abs/1505.01466
Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where computational
Externí odkaz:
http://arxiv.org/abs/1504.00353
This paper presents a novel circuit level model that explains and confirms the extra combinational delays in a SRAM-FPGA (Virtex-5) due to radiation, which matches the experimental results by proton irradiation at TRIUMF.
Comment: 2014 IEEE Nucl
Comment: 2014 IEEE Nucl
Externí odkaz:
http://arxiv.org/abs/1502.03057