Now showing items 1-20 of 23

    • Access pattern-based code compression for memory-constrained systems 

      Ozturk, O.; Kandemir, M.; Chen, G. (Association for Computing Machinery, 2008-09)
      As compared to a large spectrum of performance optimizations, relatively less effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, ...
    • Analysis of an Adaptive Modulation and Coding scheme with HARQ for TCP traffic 

      Ozturk O.; Akar, N. (IEEE Computer Society, 2015)
      In this paper, we analyze the aggregate TCP throughput performance of a wireless link utilizing Active Queue Management (AQM) and an Adaptive Modulation and Coding (AMC) scheme with Hybrid ARQ (HARQ) based on the probability ...
    • Blind data detection in the presence of PLL phase noise by sequential Monte Carlo method 

      Panayirci, E.; Çirpan H.A.; Moeneclaey, M.; Noels, N. (2006)
      In this paper, based on a sequential Monte Carlo method, a computationally efficient algorithm is presented for blind data detection in the presence of residual phase noise generated at the output the phase tracking loop ...
    • A Bound on the zero-error list coding capacity 

      Arikan, E. (Publ by IEEE, Piscataway, NJ, United States, 1993)
      We present a new bound on the zero-error list coding capacity, and using which, show that the list-of-3 capacity of the 4/3 channel is at most 6/19 bits, improving the best previously known bound of 3/8. The relation of ...
    • 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 

      Arikan, E. (2008)
      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 I(W) is the ...
    • Code design for binary energy harvesting channel 

      Dabirnia M.; Duman, T. M. (Institute of Electrical and Electronics Engineers Inc., 2017)
      We consider a binary energy harvesting communication system with a finite battery transmitter over a noisy channel, and design explicit and implementable codes based on concatenation of a nonlinear trellis code (NLTC) with ...
    • A comparison of epidemic algorithms in wireless sensor networks 

      Akdere, M.; Bilgin, C. C.; Gerdaneri, O.; Korpeoglu, I.; Ulusoy, O.; Çetintemel, U. (Elsevier BV, 2006-08-21)
      We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, ...
    • Design of trellis waveform coders with near-optimum structure 

      Kuruoglu, E.E.; Ayanoglu, E. (IET, 1992)
      In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the optimisation of the trellis structure of the next-state map of the decoder finite-state machine in trellis waveform coding. ...
    • Fibre products of superelliptic curves and codes therefrom 

      Stepanov, S. A.; Özbudak, F. (IEEE, Piscataway, NJ, United States, 1997)
      A method of constructing long geometric Goppa codes coming from fiber products of superelliptic curves is presented. A family of smooth projective curves with a lot of Fq-rational points are needed to produce a family of ...
    • Generalized approximate message-passing decoder for universal sparse superposition codes 

      Biyik, E.; Barbier, J.; Dia, M. (Institute of Electrical and Electronics Engineers Inc., 2017)
      Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are ...
    • Implementing the Han-Kobayashi scheme using low density parity check codes over Gaussian interference channels 

      Sharifi S.; Tanc, A. K.; Duman, T. M. (Institute of Electrical and Electronics Engineers Inc., 2015)
      We focus on Gaussian interference channels (GICs) and study the Han-Kobayashi coding strategy for the two-user case with the objective of designing implementable (explicit) channel codes. Specifically, low-density parity-check ...
    • Model-driven transformations for mapping parallel algorithms on parallel computing platforms 

      Arkin, E.; Tekinerdogan, B. (CEUR-WS, 2013)
      One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. ...
    • On capacity and coding for segmented deletion channels 

      Wang F.; Aktas, D.; Duman, T. M. (2011)
      We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each ...
    • On LDPC codes for Gaussian interference channels 

      Sharifi, S.; Tanc, A.K.; Duman, T.M. (Institute of Electrical and Electronics Engineers Inc., 2014)
      In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization ...
    • Performance analysis of code-multiplexed transmitted-reference ultra-wideband systems 

      Tutay, M.E.; Gezici, S.; Poor H.V. (2011)
      In code-multiplexed transmitted-reference (CM-TR) ultra-wideband (UWB) systems, data signals and reference signals are transmitted using two distinct orthogonal codes. In this way, performance improvements and/or implementation ...
    • Performance analysis of turbo codes over Rician fading channels with impulsive noise 

      Ali, S.A.; Ince, E.A. (2007)
      The statistical characteristics of impulsive noise differ greatly from those of Gaussian noise. Hence, the performance of conventional decoders, optimized for additive white Gaussian noise (AWGN) channels is not promising ...
    • Rate-distortion optimized layered stereoscopic video streaming with raptor codes 

      Tan, A.S.; Aksay, A.; Bilen, C.; Akar G.B.; Arikan, E. (2007)
      A near optimal streaming system for stereoscopic video is proposed. Initially, the stereoscopic video is separated into three layers and the approximate analytical model of the Rate-Distortion (RD) curve of each layer is ...
    • Source polarization 

      Arikan, E. (2010)
      The notion of source polarization is introduced and investigated. This complements the earlier work on channel polarization. An application to Slepian-Wolf coding is also considered. The paper is restricted to the case of ...
    • Stereoscopic video streaming with end-to-end modeling 

      Tan, A.S.; Aksay, A.; Akar G.B.; Arikan, E. (2008)
      In this work, we propose a stereoscopic video streaming system that uses rateless codes (Raptor codes) as the error protection scheme. Initially, we model the rate-distortion (RD) curve of video encoder and performance of ...