Now showing items 1-20 of 30

    • Challenges and some new directions in channel coding 

      Arikan, E.; Ul Hassan, N.; Lentmaier, M.; Montorsi, G.; Sayir, J. (Korean Institute of Communication Sciences, 2015)
      Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: Spatially coupled low-density parity-check (LDPC) codes, nonbinary LDPC codes, and polar coding.
    • Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels 

      Arikan, E. (IEEE, 2009)
      A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity is the highest ...
    • An FPGA implementation architecture for decoding of polar codes 

      Pamuk, Alptekin (IEEE, 2011)
      Polar codes are a class of codes versatile enough to achieve the Shannon bound in a large array of source and channel coding problems. For that reason it is important to have efficient implementation architectures for polar ...
    • An fpga implementation of successive cancellation list decoding for polar codes 

      Süral, Altuğ (Bilkent University, 2016-01)
      Polar Codes are the rst asymptotically provably capacity achieving error correction codes under low complexity successive cancellation (SC) decoding for binary discrete memoryless symmetric channels. Although SC is a ...
    • High throughput decoding methods and architectures for polar codes with high energy-efficiency and low latency 

      Dizdar, Onur (Bilkent University, 2017-11)
      Polar coding is a low-complexity channel coding method that can provably achieve Shannon’s channel capacity for any binary-input discrete memoryless channels (B-DMC). Apart from the theoretical interest in the subject, ...
    • A high-throughput energy-efficient implementation of successive cancellation decoder for polar codes using combinational logic 

      Dizdar, O.; Arıkan, E. (Institute of Electrical and Electronics Engineers Inc., 2016)
      This paper proposes a high-throughput energy-efficient Successive Cancellation (SC) decoder architecture for polar codes based on combinational logic. The proposed combinational architecture operates at relatively low clock ...
    • Kutupsal kodlar ile asimetrik ve asimetrik olmayan Slepian-Wolf kodlama 

      Önay, Saygun (IEEE, 2012)
      Bu bildiride, düzgün marjinal dağılıma sahip kaynaklar için Slepian–Wolf (SW) hız egrisindeki herhangi bir noktaya ulaşabilen Gehrig tarafından bulunmuş bir asimetrik olmayan dağıtık kaynak kodlama (DKK) tasarımını ele ...
    • Lossless data compression with polar codes 

      Çaycı, Semih (Bilkent University, 2013)
      In this study, lossless polar compression schemes are proposed for finite source alphabets in the noiseless setting. In the first part, lossless polar source coding scheme for binary memoryless sources introduced by ...
    • On polarization adjusted convolutional codes over fading and additive white Gaussian noise channels 

      Seyedmasoumian Charandabi, Seyed Sadra (Bilkent University, 2022-05)
      Ultra-reliable and low-latency communications (URLLC), which focuses on delay sensitive applications and services, is one of the three main pillars of 5G New Radio (NR) network architecture. URLLC's physical layer design ...
    • On the origin of polar coding 

      Arıkan, E. (Institute of Electrical and Electronics Engineers Inc., 2016)
      Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a ...
    • Performance and computational analysis of polarization-adjusted convolutional (PAC) codes 

      Moradi, Mohsen (Bilkent University, 2022-06)
      We study the performance of sequential decoding of polarization-adjusted con- volutional (PAC) codes. We present a metric function that employs bit-channel mutual information and cutoff rate values as the bias values and ...
    • A performance comparison of polar codes and reed-muller codes 

      Arıkan, E. (Institute of Electrical and Electronics Engineers, 2008)
      Polar coding is a code construction method that can be used to construct capacity-achieving codes for binary-input channels with certain symmetries. Polar coding may be considered as a generalization of Reed-Muller (RM) ...
    • Polar code construction for non-binary source alphabets 

      Çaycı, Semih; Arıkan, Orhan; Arıkan, Erdal (IEEE, 2012)
      In this paper, approximation methods for binary polar code construction proposed by Tal and Vardy are extended to non-binary source alphabets. Additionally, a new approximation method that enables accurate polar code ...
    • Polar codes for distributed source coding 

      Önay, S. (The Institution of Engineering and Technology, 2013)
      A polar coding method to construct a distributed source coding scheme which can achieve any point on the dominant face of the Slepian-Wolf rate region for sources with uniform marginals is proposed. Source encoding and ...
    • Polar codes for distributed source coding 

      Önay, Saygun (Bilkent University, 2014)
      Polar codes were invented by Arıkan as the first “capacity achieving” codes for binary-input discrete memoryless symmetric channels with low encoding and decoding complexity. The “polarization phenomenon”, which is the ...
    • Polar codes for optical communications 

      Ahmad, Tufail (Bilkent University, 2016-05)
      Optical communication systems have become the backbone of long distance communication networks due to their ability to transport data at high rates. A typical modern optical communication system should be capable to achieve ...
    • Polar coding for the Slepian-Wolf problem based on monotone chain rules 

      Arıkan, Erdal (IEEE, 2012)
      We give a polar coding scheme that achieves the full admissible rate region in the Slepian-Wolf problem without time-sharing. The method is based on a source polarization result using monotone chain rule expansions. © 2012 IEEE.
    • Polar compressive sampling: A novel technique using polar codes 

      Pilancı, Mert; Arıkan, Orhan; Arıkan, Erdal (IEEE, 2010)
      Recently introduced Polar coding is the first practical coding technique that can be proven to achieve the Shannon capacity for a multitude of communication channels. Polar codes are close to Reed-Muller codes except the ...
    • Polar Reed-Solomon concatenated codes for optical communications 

      Ertuğrul, Yiğit (Bilkent University, 2020-07)
      A concatenated forward error correcting (FEC) code is developed by targeting optical communications. Polar and product Reed-Solomon (RS) codes are used as inner and outer codes, respectively. An interleaver block is designed ...
    • Polarization for arbitrary discrete memoryless channels 

      Şaşoǧlu, E.; Telatar, E.; Arıkan, Erdal (IEEE, 2009)
      Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar ...