Browsing by Keywords "Decoding"
Now showing items 120 of 26

Adaptive routing framework for network on chip architectures
(Association for Computing Machinery, 2016)In this paper we suggest and demonstrate the idea of applying multiple routing algorithms during the execution of a real application mapped on a NetworkonChip (NoC). Traffic pattern of a real application may change during ... 
Channel polarization: a method for constructing capacityachieving codes for symmetric binaryinput memoryless channels
(IEEE, 2009)A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binaryinput discrete memoryless channel (BDMC) W. The symmetric capacity is the highest ... 
Code design for binary energy harvesting channel
(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 ... 
Decoding strategies at the relay with physicallayer network coding
(Institute of Electrical and Electronics Engineers, 2012)A twoway relay channel is considered where two users exchange information via a common relay in two transmission phases using physicallayer network coding (PNC). We consider an optimal decoding strategy at the relay to ... 
Design of LDPC codes for twoway relay systems with physicallayer network coding
(IEEE, 2013)This letter presents lowdensity paritycheck (LDPC) code design for twoway relay (TWR) systems employing physicallayer network coding (PLNC). We focus on relay decoding, and propose an empirical density evolution method ... 
Design of trellis waveform coders with nearoptimum structure
(IET, 1992)In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the optimisation of the trellis structure of the nextstate map of the decoder finitestate machine in trellis waveform coding. ... 
An efficient computation model for coarse grained reconfigurable architectures and its applications to a reconfigurable computer
(2010)The mapping of high level applications onto the coarse grained reconfigurable architectures (CGRA) are usually performed manually by using graphical tools or when automatic compilation is used, some restrictions are imposed ... 
Exact expression and tight bound on pairwise error probability for performance analysis of turbo codes over Nakagamim fading channels
(IEEE, 2007)This letter presents derivation for an exact and efficient expression on pairwise error probability over fully interleaved Nakagamim fading channels under ideal channel state information at the decoder. As an outcome, ... 
Fibre products of superelliptic curves and codes therefrom
(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 Fqrational points are needed to produce a family of ... 
An FPGA implementation architecture for decoding of polar codes
(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 ... 
Generalized approximate messagepassing decoder for universal sparse superposition codes
(Institute of Electrical and Electronics Engineers Inc., 2017)Sparse superposition (SS) codes were originally proposed as a capacityachieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are ... 
Guessing with lies
(2002)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 ... 
Implementing the HanKobayashi scheme using low density parity check codes over Gaussian interference channels
(Institute of Electrical and Electronics Engineers Inc., 2015)We focus on Gaussian interference channels (GICs) and study the HanKobayashi coding strategy for the twouser case with the objective of designing implementable (explicit) channel codes. Specifically, lowdensity paritycheck ... 
An inequality on guessing and its application to sequential decoding
(IEEE, Piscataway, NJ, United States, 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 inequality on guessing and its application to sequential decoding
(Institute of Electrical and Electronics Engineers, 199601)Let (X,Y) be a pair of discrete random variables with X taking one of M possible values, 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 ... 
Joint detection and decoding in the presence of prior information with uncertainty
(Institute of Electrical and Electronics Engineers Inc., 2016)An optimal decision framework is proposed for joint detection and decoding when the prior information is available with some uncertainty. The proposed framework provides tradeoffs between the average inclusive error ... 
Joint sourcechannel coding and guessing with application to sequential decoding
(Institute of Electrical and Electronics Engineers, 199809)We extend our earlier work on guessing subject to distortion to the joint sourcechannel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct ... 
JPEG hardware accelerator design for FPGA
(2007)A fully pipelined JPEG hardware accelerator that runs on FPGA is presented. The accelerator is designed interactively in a simulation environment, using a DSP hardware design automation tool chain. The encoder part of the ... 
Large deviations of probability rank
(2000)Consider a pair of random variables (X,Y) with distribution P. The probability rank function is defined so that G(xy) = 1 for the most probable outcome x conditional on Y = y, G(xy) = 2 for the second most probable ... 
On the reliability exponent of the exponential timing channel
(IEEE, 2002)We determine the reliability exponent E(R) of the AnantharamVerdú exponential server timing channel with service rate μ for all rates R between a critical rate R c = (μ/4) log 2 and the channel capacity C = e 1μ. For ...