Now showing items 1-20 of 40

    • An approach to manage connectionless services in connection-oriented networks 

      Abdelatı, Muhammed; Arıkan, Erdal (IEEE, 1996)
      In this work we propose a pricing scheme which serves as an instrument for managing connectionless services in connection-oriented communication networks. The scheme is able to allocate network bandwidth in a Pareto-optimal ...
    • A bound on the zero-error list coding capacity 

      Arıkan, Erdal (IEEE, 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 ...
    • Capacity bounds for an ultra-wideband channel model 

      Arıkan, Erdal (IEEE, 2004-10)
      There is an ongoing effort by the IEEE 802.15.3a subcommittee to reach a UWB personal area network standard. We estimate the achievable rates for such networks using a channel model specified by the same group. The analysis ...
    • Channel polarization: A method for constructing capacity-achieving codes 

      Arıkan, Erdal (IEEE, 2008-07)
      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 ...
    • Coding method for discrete noiseless channels with input constraints 

      Arıkan, Erdal (IEEE, 1988)
      Summary form only given. Two coding algorithms for discrete noiseless channels with input constraints have been analyzed. The first algorithm, which requires infinite-precision arithmetic and is mainly of theoretical ...
    • Design of application specific processors for the cached FFT algorithm 

      Atak, Oğuzhan; Atalar, Abdullah; Arıkan, Erdal; Ishebabi, H.; Kammler, D.; Ascheid, G.; Meyr, H.; Nicola, M.; Masera, G. (IEEE, 2006-05)
      Orthogonal frequency division multiplexing (OFDM) is a data transmission technique which is used in wired and wireless digital communication systems. In this technique, fast Fourier transformation (FFT) and inverse FFT ...
    • An efficient parallelization technique for high throughput FFT-ASIPs 

      Ishebabi H.; Ascheid G.; Meyr H.; Atak, Oğuzhan; Atalar, Abdullah; Arıkan, Erdal (IEEE, 2006)
      Fast Fourier Transformation (FFT) and it's inverse (IFFT) are used in Orthogonal Frequency Division Multiplexing (OFDM) systems for data (de)modulation. The transformations are the kernel tasks in an OFDM implementation, ...
    • Entropy polarization in butterfly transforms 

      Arıkan, Erdal (Academic Press, 2021-12)
      In signal processing, it is common to employ various transforms for analyzing or compressing real- or complex-valued signals. If the transform is chosen suitably, certain characteristics of the signal, such as spectral ...
    • Error resilient layered stereoscopic video streaming 

      Tan, Ahmet Serdar; Aksay, A.; Bilen, Ç.; Bozdağı-Akar, G.; Arıkan, Erdal (IEEE, 2007)
      In this paper, error resilient stereoscopic video streaming problem is addressed. Two different Forward Error Correction (FEC) codes namely Systematic LT and RS codes are utilized to protect the stereoscopic video data ...
    • Guessing with lies 

      Arıkan, Erdal; Boztaş, S. (IEEE, 2002-06-07)
      A practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in ...
    • An improved graph-entropy bound for perfect hashing 

      Arıkan, Erdal (IEEE, 1994-06-07)
      Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances.
    • An inequality on guessing and its application to sequential decoding 

      Arıkan, Erdal (IEEE, 1995)
      Let (X,Y) be a pair of discrete random variables with X taking values from a finite set. Suppose the value of X is to be determined, given the value of Y, by asking questions of the form 'is X equal to x?' until the answer ...
    • An information-theoretic analysis of Grover's algorithm 

      Arıkan, Erdal (IEEE, 2003-06-07)
      Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately 1r/4VN queries to a quantum oracle. For classical search using a classical oracle, the ...
    • Joint source-channel coding and guessing 

      Arıkan, Erdal; Merhav, N. (IEEE, 1997-06-07)
      We consider the joint source-channel guessing problem, define measures of optimum performance, and give single-letter characterizations. As an application, sequential decoding is considered.
    • Language evolution and information theory 

      Ahlswede, R.; Arıkan, Erdal; Bäumer, L.; Deppe, C. (IEEE, 2004-06-07)
      The use of Nowak's model to study the language evolution and to settle a conjecture by Nowak was discussed. These models explained the ways by which natural selection can lead to the gradual emergence of human language. ...
    • Large deviations of probability rank 

      Arıkan, Erdal (IEEE, 2000)
      Consider a pair of random variables (X,Y) with distribution P. The probability rank function is defined so that G(x|y) = 1 for the most probable outcome x conditional on Y = y, G(x|y) = 2 for the second most probable ...
    • Lower bounds to moments of list size 

      Arıkan, Erdal (IEEE, 1990)
      Summary form only given. The list-size random variable L for a block code is defined as the number of incorrect messages that appear to a maximum-likelihood decoder to be at least as likely as the true message. Lower bounds ...
    • Markov modulated periodic arrival process offered to an ATM multiplexer 

      Akar, Nail; Arıkan, Erdal (IEEE, 1993-11-12)
      When a superposition of on/off sources is offered to a deterministic server, a particular queueing system arises whose analysis has a significant role in ATM based networks. Periodic cell generation during active times is ...
    • Measurement strategies for input estimation in linear systems 

      Özçelikkale, Ayça; Özaktaş, Haldun M.; Arıkan, Erdal (IEEE, 2007)
      In this work, we present a mathematical approach for some of the measurement problems arising in optics, which is also applicable to other contexts. We see the measurement problem as the problem of determining the best ...
    • A note on polarization martingales 

      Arıkan, Erdal (IEEE, 2014)
      Polarization results rely on martingales of mutual information and entropy functions. In this note an alternative formulation is considered where martingales are constructed on sample functions of the entropy function.