All posts under category "Computer Science / Information Theory"
This paper focuses on the cross-layer issue of resource allocation for energy efficiency in the uplink of a multiuser MIMO wireless communication system. Assuming that all of the transmitters and the uplink receiver are equipped with multiple antennas, the situation considered is that in which each
The Baum-Welsh algorithm together with its derivatives and variations has been the main technique for learning Hidden Markov Models (HMM) from observational data. We present an HMM learning algorithm based on the non-negative matrix factorization (NMF) of higher order Markovian statistics that is st
We study the problem of reconstructing a sparse signal from a limited number of its linear projections when a part of its support is known, although the known part may contain some errors. The ``known' part of the support, denoted T, may be available from prior knowledge. Alternatively, in a problem
Suppose that local characteristics of several independent compound Poisson and Wiener processes change suddenly and simultaneously at some unobservable disorder time. The problem is to detect the disorder time as quickly as possible after it happens and minimize the rate of false alarms at the same
The problem of side-information scalable (SI-scalable) source coding is considered in this work, where the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bitstream and reconstruct in the rate distortion sense, whil
In this paper, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decision process (MDP) and systematically unravel the structural properties (e.g. concavity in the state-value function and monot
This article reviews some recent promising approaches to make mobile power closer to reality. In contrast with articles commonly published by the microwave community and the communication/signal processing community that separately emphasize RF, circuit and antenna solutions for WPT on one hand and
It is generally accepted that human vision is an extremely powerful information processing system that facilitates our interaction with the surrounding world. However, despite extended and extensive research efforts, which encompass many exploration fields, the underlying fundamentals and operationa
We address the problems of estimating the computer efficiency and the computer capacity. We define the computer efficiency and capacity and suggest a method for their estimation, based on the analysis of processor instructions and kinds of accessible memory. It is shown how the suggested method can
We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004). This is the natural extension to the public s
In this paper we suggest a new algorithm for determination of signal-to-noise ratio (SNR). SNR is a quantitative measure widely used in science and engineering. Generally, methods for determination of SNR are based on using of experimentally defined power of noise level, or some conditional noise cr
This paper will design non-linear frequency modulation (NLFM) signal for Chebyshev, Kaiser, Taylor, and raised-cosine power spectral densities (PSDs). Then, the variation of peak sidelobe level with regard to mainlobe width for these four different window functions are analyzed. It has been demonstr
This paper presents a method of universal coding based on the Narayana series. The rules necessary to make such coding possible have been found and the length of the resulting code has been determined to follow the Narayana count.
Today we design wireless networks using mathematical models that govern communication in different propagation environments. We rely on measurement campaigns to deliver parametrized propagation models, and on the 3GPP standards process to optimize model-based performance, but as wireless networks be
In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph C_m $cup$ P_m
The paper presents new clustering algorithm. The proposed algorithm gives less distortion as compared to well known Linde Buzo Gray (LBG) algorithm and Kekre's Proportionate Error (KPE) Algorithm. Constant error is added every time to split the clusters in LBG, resulting in formation of cluster in o
We consider the relations between well-known Fourier transform algorithms.
In this paper we consider tandem error control coding and cryptography in the setting of the {em wiretap channel} due to Wyner. In a typical communications system a cryptographic application is run at a layer above the physical layer and assumes the channel is error free. However, in any real applic
In a previous paper, we derived a recursive formula determining the weight distributions of the [n=(q^m-1)/(q-1)] Hamming code H(m,q), when (m,q-1)=1. Here q is a prime power. We note here that the formula actually holds for any positive integer m and any prime power q, without the restriction (m, q
Proving the quantum Hamming bound for degenerate nonbinary stabilizer codes has been an open problem for a decade. In this note, I prove this bound for double error-correcting degenerate stabilizer codes. Also, I compute the maximum length of single and double error-correcting MDS stabilizer codes o
A simple algorithm for decoding both errors and erasures of Reed-Solomon codes is described.
A simple lower bound to the capacity of the discrete-time Poisson channel with average energy $es$ is derived. The rate ${1/2}log(1+es)$ is shown to be the generalized mutual information of a modified minimum-distance decoder, when the input follows a gamma distribution of parameter 1/2 and mean $es
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'. We discuss the extent to which Kolmogorov's and Shannon's information theory have a common purpose, and where they are
In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an upper bound on the volume of the union of multiple balls with
In many channel measurement applications, one needs to estimate some characteristics of the channels based on a limited set of measurements. This is mainly due to the highly time varying characteristics of the channel. In this contribution, it will be shown how free probability can be used for chann
Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce difference triangle sets whose scopes are t
This paper addresses the problem of forbidden states for safe Petri net modeling discrete event systems. We present an efficient method to construct a controller. A set of linear constraints allow forbidding the reachability of specific states. The number of these so-called forbidden states and cons
The problem of decentralized sequential detection with conditionally independent observations is studied. The sensors form a star topology with a central node called fusion center as the hub. The sensors make noisy observations of a parameter that changes from an initial state to a final state at a
We introduce S-DUDE, a new algorithm for denoising DMC-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Universal DEnoiser) of Weissman et al., aims to compete with a genie that has access, in addition to the noisy data, also to the underlying clean data, and c
Near optimal decoding of good error control codes is generally a difficult task. However, for a certain type of (sufficiently) good codes an efficient decoding algorithm with near optimal performance exists. These codes are defined via a combination of constituent codes with low complexity trellis r
Protection of the sensitive content is crucial for extensive information sharing. We present a technique of information concealing, based on introduction and maintenance of families of repeats. Repeats in DNA constitute a basic obstacle for its reconstruction by hybridization.
We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Cald
In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct $k geq 5$ errors is to avoid cycles of length up to $2k$ in its Tanner graph. As a consequence of t
Current approaches to the practical implementation of network coding are batch-based, and often do not use feedback, except possibly to signal completion of a file download. In this paper, the various benefits of using feedback in a network coded system are studied. It is shown that network coding c
This paper provides a tutorial overview of game theoretic techniques used for communication over frequency selective interference channels. We discuss both competitive and cooperative techniques. Keywords: Game theory, competitive games, cooperative games, Nash Equilibrium, Nash bargaining solutio
The rank minimization problem is to find the lowest-rank matrix in a given set. Nuclear norm minimization has been proposed as an convex relaxation of rank minimization. Recht, Fazel, and Parrilo have shown that nuclear norm minimization subject to an affine constraint is equivalent to rank minimiza
Within the framework of linear vector Gaussian channels with arbitrary signaling, closed-form expressions for the Jacobian of the minimum mean square error and Fisher information matrices with respect to arbitrary parameters of the system are calculated in this paper. Capitalizing on prior research
Given a general source with countably infinite source alphabet and a general channel with arbitrary abstract channel input/channel output alphabets, we study the joint source-channel coding problem from the information-spectrum point of view. First, we generalize Feinstein's lemma (direct part) and
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery prop
In this paper, the capacity and energy efficiency of training-based communication schemes employed for transmission over a-priori unknown Rayleigh block fading channels are studied. In these schemes, periodically transmitted training symbols are used at the receiver to obtain the minimum mean-square
Monotonicity criteria are established for the generalized Marcum Q-function, $emph{Q}_{M}$, the standard Nuttall Q-function, $emph{Q}_{M,N}$, and the normalized Nuttall Q-function, $mathcal{Q}_{M,N}$, with respect to their real order indices M,N. Besides, closed-form expressions are derived for the
Performance analysis of optimal signal detection using quantized received signals of a linear vector channel, which is an extension of code-division multiple-access (CDMA) or multiple-input multiple-output (MIMO) channels, in the large system limit, is presented in this paper. Here the dimensions of
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a successive decoding
The central design challenge in next generation wireless systems is to have these systems operate at high bandwidths and provide high data rates while being cognizant of the energy consumption levels especially in mobile applications. Since communicating at very high data rates prohibits obtaining h
The asymptotic capacity at low input powers of an average-power limited or an average- and peak-power limited discrete-time Poisson channel is considered. For a Poisson channel whose dark current is zero or decays to zero linearly with its average input power $E$, capacity scales like $Elogfrac{1}{E
We derive the probability that a randomly chosen NL-node over $S$ gets localized as a function of a variety of parameters. Then, we derive the probability that the whole network of NL-nodes over $S$ gets localized. In connection with the asymptotic thresholds, we show the presence of asymptotic thre
In this paper, efficient turbo packet combining for single carrier (SC) broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat request (ARQ) transmission with unknown co-channel interference (CCI) is studied. We propose a new frequency domain soft minimum mean square error (MMSE)-
We consider the dynamical behavior of Martin-L'of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction we prove that s
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO channel. It is assumed that the channels are degraded and th
The output distribution, when rate is above capacity, is investigated. It is shown that there is an asymptotic equipartition property (AEP) of the typical output sequences, independently of the specific codebook used, as long as the codebook is typical according to the standard random codebook gener
Enter keywords to search articles