Search Results - "Tal, Ido"
-
1
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes
Published in IEEE transactions on communications (01-07-2016)“…In this paper, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on…”
Get full text
Journal Article -
2
List Decoding of Polar Codes
Published in IEEE transactions on information theory (01-05-2015)“…We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the…”
Get full text
Journal Article -
3
How to Construct Polar Codes
Published in IEEE transactions on information theory (01-10-2013)“…A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is…”
Get full text
Journal Article -
4
A Simple Proof of Fast Polarization
Published in IEEE transactions on information theory (01-12-2017)“…Fast polarization is a key property of polar codes. It was proved for the binary polarizing 2 × 2 kernel by Arikan and Telatar. The proof was later adapted to…”
Get full text
Journal Article -
5
On the Construction of Polar Codes for Channels With Moderate Input Alphabet Sizes
Published in IEEE transactions on information theory (01-03-2017)“…Current deterministic algorithms for the construction of polar codes can only be argued to be practical for channels with small input alphabet sizes. In this…”
Get full text
Journal Article -
6
Fast Polarization for Processes With Memory
Published in IEEE transactions on information theory (01-04-2019)“…Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in…”
Get full text
Journal Article -
7
Channel Upgradation for Non-Binary Input Alphabets and MACs
Published in IEEE transactions on information theory (01-03-2017)“…Consider a single-user or multiple-access channel with a large output alphabet. A method to approximate the channel by an upgraded version having a smaller…”
Get full text
Journal Article -
8
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels
Published in IEEE transactions on information theory (01-04-2019)“…Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar…”
Get full text
Journal Article -
9
Polar Coding for Processes With Memory
Published in IEEE transactions on information theory (01-04-2019)“…We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a…”
Get full text
Journal Article -
10
An Upgrading Algorithm With Optimal Power Law
Published in IEEE transactions on information theory (01-12-2021)“…Consider a channel <inline-formula> <tex-math notation="LaTeX">W </tex-math></inline-formula> along with a given input distribution <inline-formula> <tex-math…”
Get full text
Journal Article -
11
Greedy-Merge Degrading has Optimal Power-Law
Published in IEEE transactions on information theory (01-02-2019)“…Consider a channel with a given input alphabet size and input distribution. Our aim is to degrade or upgrade it to a channel with at most <inline-formula>…”
Get full text
Journal Article -
12
Polar Codes for the Deletion Channel: Weak and Strong Polarization
Published in IEEE transactions on information theory (01-04-2022)“…This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A…”
Get full text
Journal Article -
13
Hardware architectures for successive cancellation decoding of polar codes
Published in 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (01-05-2011)“…The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under…”
Get full text
Conference Proceeding -
14
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes
Published in Journal of signal processing systems (01-12-2012)“…The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless…”
Get full text
Journal Article -
15
Strong Polarization for Shortened and Punctured Polar Codes
Published in 2024 IEEE International Symposium on Information Theory (ISIT) (07-07-2024)“…Polar codes were originally specified for codelengths that are powers of two. In many applications, it is desired to have a code that is not restricted to such…”
Get full text
Conference Proceeding -
16
Strong Polarization for Shortened and Punctured Polar Codes
Published 30-01-2024“…Polar codes were originally specified for codelengths that are powers of two. In many applications, it is desired to have a code that is not restricted to such…”
Get full text
Journal Article -
17
Dimensions of Channel Coding: From Theory to Algorithms to Applications
Published in IEEE journal on selected areas in information theory (2023)“…This special issue of the IEEE Journal on Selected Areas in Information Theory is dedicated to the memory of Alexander Vardy, a pioneer in the theory and…”
Get full text
Journal Article -
18
Stronger Polarization for the Deletion Channel
Published 17-05-2023“…In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like $2^{-\sqrt{\Lambda}}$, where…”
Get full text
Journal Article -
19
List decoding of polar codes
Published in 2011 IEEE International Symposium on Information Theory Proceedings (01-07-2011)“…We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arikan. In the…”
Get full text
Conference Proceeding -
20
Bounds on the Rate of 2-D Bit-Stuffing Encoders
Published in IEEE transactions on information theory (01-06-2010)“…A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related…”
Get full text
Journal Article