By Topic

# IEEE Transactions on Information Theory

Includes the top 50 most frequently accessed documents for this publication according to the usage statistics for the month of

• ### Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

Publication Year: 2006, Page(s):489 - 509
Cited by:  Papers (5924)  |  Patents (121)
| | PDF (1176 KB) | HTML

This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f∈CN and a randomly chosen set of frequencies Ω. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set Ω? A typical result of this paper is as follows. Suppose that f is a superposition of |T| s... View full abstract»

• ### Cooperative diversity in wireless networks: Efficient protocols and outage behavior

Publication Year: 2004, Page(s):3062 - 3080
Cited by:  Papers (8104)  |  Patents (57)
| | PDF (584 KB) | HTML

We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals' relaying signals for one another. We outline several strategies employed by the cooperating radios, including fixed relaying schemes such as amplify-and-forward and ... View full abstract»

• ### Compressed sensing

Publication Year: 2006, Page(s):1289 - 1306
Cited by:  Papers (9216)  |  Patents (139)
| | PDF (483 KB) | HTML

Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements n can be dramatically smaller than the size m. Thus, certain natural classes of ... View full abstract»

• ### Decoding by linear programming

Publication Year: 2005, Page(s):4203 - 4215
Cited by:  Papers (2548)  |  Patents (35)
| | PDF (384 KB) | HTML

This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f∈Rn from corrupted measurements y=Af+e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to recover f exactly from the data y? We prove that under suitable conditions on the coding matrix A, the input f is ... View full abstract»

• ### Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

Publication Year: 2009, Page(s):3051 - 3073
Cited by:  Papers (708)  |  Patents (14)
| | PDF (707 KB) | HTML

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 rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of N ind... View full abstract»

• ### Factor graphs and the sum-product algorithm

Publication Year: 2001, Page(s):498 - 519
Cited by:  Papers (2545)  |  Patents (187)
| | PDF (464 KB) | HTML

Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of “local” functions, each of which depends on a subset of the variables. Such a factorization can be visualized with a bipartite graph that we call a factor graph, In this tutorial paper, we present a generic message-passing algorithm,... View full abstract»

• ### Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

Publication Year: 2007, Page(s):4655 - 4666
Cited by:  Papers (2889)  |  Patents (30)
| | PDF (936 KB) | HTML

This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal. This is a massive improvement over previous results, which require O(m2) measurements. The new results for OMP are comparable with recen... View full abstract»

• ### Joint Spatial Division and Multiplexing—The Large-Scale Array Regime

Publication Year: 2013, Page(s):6441 - 6463
Cited by:  Papers (247)  |  Patents (2)
| | PDF (6169 KB) | HTML

We propose joint spatial division and multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional channel state information at the transmitter (CSIT). JSDM achieves significant savings both in the downlink training and in the... View full abstract»

• ### Nearest neighbor pattern classification

Publication Year: 1967, Page(s):21 - 27
Cited by:  Papers (3125)  |  Patents (94)
| | PDF (1019 KB)

The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points. This rule is independent of the underlying joint distribution on the sample points and their classifications, and hence the probability of errorRof such a rule must be at least as great as the Bayes probability of errorR^{ast}-... View full abstract»

• ### Subspace Pursuit for Compressive Sensing Signal Reconstruction

Publication Year: 2009, Page(s):2230 - 2249
Cited by:  Papers (770)  |  Patents (7)
| | PDF (976 KB) | HTML

We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same order as that of linear programming (LP) opti... View full abstract»

• ### Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

Publication Year: 2012, Page(s):1094 - 1121
Cited by:  Papers (386)
| | PDF (6565 KB) | HTML

Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard in general. We show here that for systems with “typical”/“random” Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our proposal, Stagewise Orthogonal Matching Pur... View full abstract»

• ### List Decoding of Polar Codes

Publication Year: 2015, Page(s):2213 - 2226
Cited by:  Papers (60)
| | PDF (1015 KB) | HTML

We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, L decoding paths are considered concurrently at each decoding stage, where L is an integer parameter. At the end of the decoding process, the most likely among the L paths is selected as the single codeword at t... View full abstract»

• ### The wavelet transform, time-frequency localization and signal analysis

Publication Year: 1990, Page(s):961 - 1005
Cited by:  Papers (2687)  |  Patents (29)
| | PDF (3132 KB)

Two different procedures for effecting a frequency analysis of a time-dependent signal locally in time are studied. The first procedure is the short-time or windowed Fourier transform; the second is the wavelet transform, in which high-frequency components are studied with sharper time resolution than low-frequency components. The similarities and the differences between these two methods are disc... View full abstract»

• ### Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel

Publication Year: 2008, Page(s):3425 - 3441
Cited by:  Papers (1828)  |  Patents (32)
| | PDF (422 KB) | HTML

For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log(SNR)+o(log(SNR)) . Thus, the K user time-varying interference channel almost surely has K/2 degrees of freedom. Achievability is based on the idea of interference alignment. Examples are also pr... View full abstract»

• ### New directions in cryptography

Publication Year: 1976, Page(s):644 - 654
Cited by:  Papers (3802)  |  Patents (332)
| | PDF (2176 KB)

Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communicati... View full abstract»

• ### FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers

Publication Year: 2013, Page(s):8402 - 8413
Cited by:  Papers (153)
| | PDF (2158 KB) | HTML

Video on-demand streaming from Internet-based servers is becoming one of the most important services offered by wireless networks today. In order to improve the area spectral efficiency of video transmission in cellular systems, small cells heterogeneous architectures (e.g., femtocells, WiFi off-loading) are being proposed, such that video traffic to nomadic users can be handled by short-range lin... View full abstract»

• ### Channel Coding Rate in the Finite Blocklength Regime

Publication Year: 2010, Page(s):2307 - 2359
Cited by:  Papers (497)  |  Patents (1)
| | PDF (3873 KB) | HTML

This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown ... View full abstract»

• ### The capacity of low-density parity-check codes under message-passing decoding

Publication Year: 2001, Page(s):599 - 618
Cited by:  Papers (1631)  |  Patents (144)
| | PDF (480 KB) | HTML

We present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chosen element of the given ensemble will achieve an arbitrarily small target probability of error with a probability th... View full abstract»

• ### How to Construct Polar Codes

Publication Year: 2013, Page(s):6562 - 6582
Cited by:  Papers (105)  |  Patents (2)
| | PDF (5879 KB) | HTML

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows exponentially with the code length. Thus, the core problem that needs to be solved is that of faithfully approximating a bit-channel with an intractably large a... View full abstract»

• ### How much training is needed in multiple-antenna wireless links?

Publication Year: 2003, Page(s):951 - 963
Cited by:  Papers (1121)  |  Patents (32)
| | PDF (832 KB) | HTML

Multiple-antenna wireless communication links promise very high data rates with low error probabilities, especially when the wireless channel response is known at the receiver. In practice, knowledge of the channel is often obtained by sending known training symbols to the receiver. We show how training affects the capacity of a fading channel-too little training and the channel is improperly lear... View full abstract»

• ### Preconditioned Data Sparsification for Big Data With Applications to PCA and K-Means

Publication Year: 2017, Page(s):2954 - 2974
| | PDF (1712 KB) | HTML

We analyze a compression scheme for large data sets that randomly keeps a small percentage of the components of each data sample. The benefit is that the output is a sparse matrix, and therefore, subsequent processing, such as principal component analysis (PCA) or K-means, is significantly faster, especially in a distributed-data setting. Furthermore, the sampling is single-pass and applicable to ... View full abstract»

• ### Design of capacity-approaching irregular low-density parity-check codes

Publication Year: 2001, Page(s):619 - 637
Cited by:  Papers (1876)  |  Patents (103)
| | PDF (516 KB) | HTML

We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on the work of Richardson and Urbanke (see ibid., vol.47, no.2, p.599-618, 2000). Assuming that the underlying communication chann... View full abstract»

• ### Greed is good: algorithmic results for sparse approximation

Publication Year: 2004, Page(s):2231 - 2242
Cited by:  Papers (1342)  |  Patents (8)
| | PDF (304 KB) | HTML

This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho's basis pursuit (BP) paradigm can recover the optimal representation of an exactly sparse signal. It leverages this theory to show that both OMP and BP succeed for ... View full abstract»

• ### Invariancy of Sparse Recovery Algorithms

Publication Year: 2017, Page(s):3333 - 3347
| | PDF (721 KB) | HTML

In this paper, a property for sparse recovery algorithms, called invariancy, is introduced. The significance of invariancy is that the performance of the algorithms with this property is less affected when the sensing (i.e., the dictionary) is ill-conditioned. This is because for this kind of algorithms, there exists implicitly an equivalent well-conditioned problem, which is being solved. Some ex... View full abstract»

• ### Model-Based Compressive Sensing

Publication Year: 2010, Page(s):1982 - 2001
Cited by:  Papers (597)  |  Patents (3)
| | PDF (966 KB) | HTML

Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K Â¿ N elements from an N -dimensional basis. Instead of taking periodic samples, CS measures inner products with M < N random vectors and then recovers the signal via a sparsity-seeking optimization or greedy algorithm. Standard CS d... View full abstract»

• ### Performance Analysis of ZF and MMSE Equalizers for MIMO Systems: An In-Depth Study of the High SNR Regime

Publication Year: 2011, Page(s):2008 - 2026
Cited by:  Papers (131)
| | PDF (912 KB) | HTML

This paper presents an in-depth analysis of the zero forcing (ZF) and minimum mean squared error (MMSE) equalizers applied to wireless multiinput multioutput (MIMO) systems with no fewer receive than transmit antennas. In spite of much prior work on this subject, we reveal several new and surprising analytical results in terms of output signal-to-noise ratio (SNR), uncoded error and outage probabi... View full abstract»

• ### Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

Publication Year: 2003, Page(s):1073 - 1096
Cited by:  Papers (2354)  |  Patents (44)
| | PDF (1620 KB) | HTML

Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel,... View full abstract»

• ### The estimation of the gradient of a density function, with applications in pattern recognition

Publication Year: 1975, Page(s):32 - 40
Cited by:  Papers (1027)  |  Patents (7)
| | PDF (1175 KB)

Nonparametric density gradient estimation using a generalized kernel approach is investigated. Conditions on the kernel functions are derived to guarantee asymptotic unbiasedness, consistency, and uniform consistency of the estimates. The results are generalized to obtain a simple mcan-shift estimate that can be extended in ak-nearest-neighbor approach. Applications of gradient estimati... View full abstract»

• ### Raptor codes

Publication Year: 2006, Page(s):2551 - 2567
Cited by:  Papers (1320)  |  Patents (50)
| | PDF (529 KB) | HTML

LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: for a given integer k and any real epsiv>0, Raptor codes in this class produce a potentially i... View full abstract»

• ### Relaxed Polar Codes

Publication Year: 2017, Page(s):1986 - 2000
| | PDF (1278 KB) | HTML

Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of binary-input discrete memoryless channels. Polar encoding and successive cancellation decoding have the complexities of N log N , for code length N. Although, the complexity bound of N log N is asymptotically favorable, we report... View full abstract»

• ### Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

Publication Year: 1967, Page(s):260 - 269
Cited by:  Papers (2104)  |  Patents (117)
| | PDF (1452 KB)

The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length of the code. For all but pathological channels the bounds are asymptotically (exponentially) tight for rates aboveR_{0}, the computational cutoff rate of sequential decoding. As a function of constraint length the... View full abstract»

• ### Wireless Information-Theoretic Security

Publication Year: 2008, Page(s):2515 - 2534
Cited by:  Papers (685)  |  Patents (1)
| | PDF (1341 KB) | HTML

This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average s... View full abstract»

• ### De-noising by soft-thresholding

Publication Year: 1995, Page(s):613 - 627
Cited by:  Papers (3978)  |  Patents (68)
| | PDF (1164 KB)

Donoho and Johnstone (1994) proposed a method for reconstructing an unknown function f on [0,1] from noisy data di=f(ti )+σzi, i=0, …, n-1,ti=i/n, where the zi are independent and identically distributed standard Gaussian random variables. The reconstruction fˆ*n is defined in the wavelet domain by translating all... View full abstract»

• ### Space-time codes for high data rate wireless communication: performance criterion and code construction

Publication Year: 1998, Page(s):744 - 765
Cited by:  Papers (4854)  |  Patents (204)
| | PDF (772 KB)

We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted sig... View full abstract»

• ### Order-Optimal Rate of Caching and Coded Multicasting With Random Demands

Publication Year: 2017, Page(s):3923 - 3949
| | PDF (1393 KB) | HTML

We consider the canonical shared link caching network formed by a source node, hosting a library of m information messages (files), connected via a noiseless multicast link to n user nodes, each equipped with a cache of size M files. Users request files independently at random according to an a-priori known demand distribution q. A coding scheme for this network consists of two phases: cache place... View full abstract»

• ### MIMO Broadcast Channels With Finite-Rate Feedback

Publication Year: 2006, Page(s):5045 - 5060
Cited by:  Papers (952)  |  Patents (23)
| | PDF (1368 KB) | HTML

Multiple transmit antennas in a downlink channel can provide tremendous capacity (i.e., multiplexing) gains, even when receivers have only single antennas. However, receiver and transmitter channel state information is generally required. In this correspondence, a system where each receiver has perfect channel knowledge, but the transmitter only receives quantized information regarding the channel... View full abstract»

• ### On the achievable throughput of a multiantenna Gaussian broadcast channel

Publication Year: 2003, Page(s):1691 - 1706
Cited by:  Papers (1474)  |  Patents (61)
| | PDF (1010 KB) | HTML

A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both transmitter and receivers have perfect knowledge of the channel. Despite its apparent simplicity, this model is, in general, a nondegraded broadcast channel (BC), for which the capacity region is not fully known. For the two-user case, we find a special case of Marton's (1979) r... View full abstract»

• ### Least squares quantization in PCM

Publication Year: 1982, Page(s):129 - 137
Cited by:  Papers (2826)  |  Patents (92)
| | PDF (1227 KB)

It has long been realized that in pulse-code modulation (PCM), with a given ensemble of signals to handle, the quantum values should be spaced more closely in the voltage regions where the signal amplitude is more likely to fall. It has been shown by Panter and Dite that, in the limit as the number of quanta becomes infinite, the asymptotic fractional density of quanta per unit voltage should vary... View full abstract»

• ### Compressed Sensing Off the Grid

Publication Year: 2013, Page(s):7465 - 7490
Cited by:  Papers (160)
| | PDF (6786 KB) | HTML

This paper investigates the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a grid, but can assume any values in the normalized frequency domain [0, 1]. An atomic norm minimization approach is proposed to exactly recover the un... View full abstract»

• ### Gaussian Multiple Access via Compute-and-Forward

Publication Year: 2017, Page(s):2678 - 2695
Cited by:  Papers (1)
| | PDF (1529 KB) | HTML

Lattice codes used under the compute-and-forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): the receiver successively decodes the integer linear combinations of the messages until it can invert and recover all messages. In this paper, a multiple-access technique called compute-forward multiple access (CFMA) is proposed and analyzed. For the tw... View full abstract»

• ### Optimal Shrinkage of Singular Values

Publication Year: 2017, Page(s):2137 - 2152
| | PDF (983 KB) | HTML

We consider the recovery of low-rank matrices from noisy data by shrinkage of singular values, in which a single, univariate nonlinearity is applied to each of the empirical singular values. We adopt an asymptotic framework, in which the matrix size is much larger than the rank of the signal matrix to be recovered, and the signal-to-noise ratio of the low-rank piece stays constant. For a variety o... View full abstract»

• ### Yet Another Proof of the Entropy Power Inequality

Publication Year: 2017, Page(s):3595 - 3599
| | PDF (159 KB) | HTML

Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young's inequality with sharp constant or Rényi entropies. The proof is based on a simple change of variables, is formally identical in one and several dimensions, and easily settles the equality case. View full abstract»

• ### Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

Publication Year: 2006, Page(s):5406 - 5425
Cited by:  Papers (2627)  |  Patents (38)
| | PDF (458 KB) | HTML

Suppose we are given a vector f in a class FsubeRopfN , e.g., a class of digital signals or digital images. How many linear measurements do we need to make about f to be able to recover f to within precision epsi in the Euclidean (lscr2) metric? This paper shows that if the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f t... View full abstract»

• ### Massive MIMO Systems With Non-Ideal Hardware: Energy Efficiency, Estimation, and Capacity Limits

Publication Year: 2014, Page(s):7112 - 7139
Cited by:  Papers (144)
| | PDF (2212 KB) | HTML

The use of large-scale antenna arrays can bring substantial improvements in energy and/or spectral efficiency to wireless systems due to the greatly improved spatial resolution and array gain. Recent works in the field of massive multiple-input multiple-output (MIMO) show that the user channels decorrelate when the number of antennas at the base stations (BSs) increases, thus strong signal gains a... View full abstract»

• ### Channel coding with multilevel/phase signals

Publication Year: 1982, Page(s):55 - 67
Cited by:  Papers (2423)  |  Patents (286)
| | PDF (1816 KB)

A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance. Soft maximum--likelihood (ML) decoding using the Viterbi algorithm is assumed. Following a discussion of channel ca... View full abstract»

• ### Fundamental Limits of Caching

Publication Year: 2014, Page(s):2856 - 2867
Cited by:  Papers (186)
| | PDF (783 KB) | HTML

Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to deliver requested content in part from a locally cached copy rather than through the network. The gain offered by this approach, which we term local caching gain, depends on the local cache size (i.e., the memory available at each individual ... View full abstract»

• ### The capacity of wireless networks

Publication Year: 2000, Page(s):388 - 404
Cited by:  Papers (4670)  |  Patents (56)
| | PDF (376 KB)

When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput λ(n) obtainable by each node for a randomly chosen destination is Θ(W/√(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assign... View full abstract»

• ### Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

Publication Year: 2001, Page(s):657 - 670
Cited by:  Papers (584)  |  Patents (55)
| | PDF (340 KB) | HTML

Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under message-passing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message densities under density evolution to simplify the analysis of the decoding algorithm. We convert the inf... View full abstract»

• ### Stable recovery of sparse overcomplete representations in the presence of noise

Publication Year: 2006, Page(s):6 - 18
Cited by:  Papers (878)  |  Patents (13)
| | PDF (528 KB) | HTML

Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in general, the problem of finding sparse representations must be unstable in the presence of noise. This paper establishes the possibility of stable recovery under a combination of sufficient sparsity and favorable structure ... View full abstract»

• ### Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals

Publication Year: 2010, Page(s):520 - 544
Cited by:  Papers (391)  |  Patents (12)
| | PDF (767 KB) | HTML

Wideband analog signals push contemporary analog-to-digital conversion (ADC) systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficient because the signals of interest contain only a small number of significant frequencies relative to the band limit, although the locations of the frequencies may not be known a priori. For this type of sparse sig... View full abstract»

## Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Prakash Narayan

Department of Electrical and Computer Engineering