Skip to main content

Robert Calderbank

Charles S. Sydnor Distinguished Professor of Computer Science
Computer Science
Campus Box 90984, 140 Science Drive, Durham, NC 27708
140 Science Drive, 317 Gross Hall, Durham, NC 27708

Scholarly Works - Conferences


Zak-OTFS and LDPC Codes

Conference IEEE International Conference on Communications · January 1, 2024 Orthogonal Time Frequency Space (OTFS) is a framework for communications and active sensing that processes signals in the delay-Doppler (DD) domain. It is informed by 6G propagation environments, where Doppler spreads measured in kHz make it more and more ... Full text Cite

MIMO Precoding at the Speed of Wireless: Precoder Prediction for MIMO-OTFS Systems

Conference IEEE Vehicular Technology Conference · January 1, 2024 As the development of 6G technologies progresses, there is a focused effort by international bodies and regulatory agencies to enhance worldwide connectivity, paying special attention to the needs of high-mobility users and networks, such as Mobile Ad-Hoc ... Full text Cite

Performance Analysis of Binary Chirp Decoding

Conference 2023 IEEE Information Theory Workshop Itw 2023 · January 1, 2023 Binary Chirp (BC) codebooks consist of N(log2N + 3)/2 lines in CN, equivalent up to overall phase rotations. Exploiting the underlying algebraic structure, the BCs allow suboptimal decoders with complexity N(logN)2, based on autocorrelations between the re ... Full text Cite

LDPC Decoders Prefer More Reliable Parity Bits: Unequal Data Protection Over BSC

Conference 2023 12th International Symposium on Topics in Coding Istc 2023 · January 1, 2023 Low-density parity-check (LDPC) codes are specified by graphs, and are the error correction technique of choice in many communications and data storage contexts. Message passing decoders diffuse information carried by parity bits into the payload, and this ... Full text Cite

Extended Binary Chirps Codebooks for Non-Coherent Communications

Conference Proceedings IEEE Global Communications Conference Globecom · January 1, 2023 Binary chirps (BCs) are exponentiated 2nd-order Reed-Muller codes, which have interesting geometric and algebraic features, one of which is the close connection to the diagonal part of the Clifford group, which is the 2nd level of the Clifford hierarchy. W ... Full text Cite

Low-Complexity Grassmannian Quantization Based on Binary Chirps

Conference IEEE Wireless Communications and Networking Conference Wcnc · January 1, 2022 We consider autocorrelation-based low-complexity decoders for identifying Binary Chirp codewords from noisy signals in N = 2m dimensions. The underlying algebraic structure enables dimensionality reduction from N complex to m binary di- mensions, which can ... Full text Cite

Co-design of CSS Codes and Diagonal Gates

Conference IEEE International Symposium on Information Theory Proceedings · January 1, 2022 The challenge of quantum computing is to combine error resilience with universal computation. There are many finite sets of gates that are universal, and a standard choice is to augment the set of Clifford gates by a non-Clifford unitary such as the T gate ... Full text Cite

Read-and-Run Constrained Coding for Modern Flash Devices

Conference IEEE International Conference on Communications · January 1, 2022 The pivotal storage density win achieved by solid-state devices over magnetic devices in 2015 is a result of multiple innovations in physics, architecture, and signal processing. One of the most important innovations in that regard is enabling the storage ... Full text Cite

Securing Wireless Channels: Reliable Shared Secret Extraction through OTFS

Conference 2022 IEEE Conference on Communications and Network Security CNS 2022 · January 1, 2022 Physical layer key generation (PLKG) has emerged as a promising strategy for securing wireless communication using shared channel knowledge between two legitimate users. Traditional PLKG systems rely on time-frequency domain channels using metrics such as ... Full text Cite

Low-Complexity Channel Matrix Calculation for OTFS Systems with Fractional Delay and Doppler

Conference Proceedings IEEE Military Communications Conference MILCOM · January 1, 2022 Orthogonal Time Frequency Space (OTFS) modulation has been introduced to manage channel induced high Doppler shifts in mobile communication networks. In an OTFS system, the information carrying symbols are placed in the data frames in the delay-Doppler (DD ... Full text Cite

CSS Codes that are Oblivious to Coherent Noise

Conference IEEE International Symposium on Information Theory Proceedings · July 12, 2021 Physical platforms such as trapped ions suffer from coherent noise that does not follow a simple stochastic model. We view coherent errors as rotations about a particular axis, and observe that since they can accumulate coherently over time, they can be mo ... Full text Cite

GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes with High Memories

Conference IEEE International Symposium on Information Theory Proceedings · July 12, 2021 Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an underlying block code, fo ... Full text Cite

Knowledge-Aided Data-Driven Radar Clutter Representation

Conference IEEE National Radar Conference Proceedings · May 7, 2021 We use a knowledge-aided, data-driven, location-aware approach based on the RFView simulation software to model and estimate the effect of ground clutter in airborne radars. Using the RFView simulator, we produce many samples of potential clutter effects a ... Full text Cite

LOCO Codes: Lexicographically-Ordered Constrained Codes

Conference IEEE Transactions on Information Theory · June 1, 2020 Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash device ... Full text Cite

Foosball Coding: Correcting Shift Errors and Bit Flip Errors in 3D Racetrack Memory

Conference Proceedings 50th Annual IEEE IFIP International Conference on Dependable Systems and Networks Dsn 2020 · June 1, 2020 Racetrack memory is a promising new non-volatile memory technology, especially because of the density of its 3D implementation. However, for 3D racetrack to reach its potential, certain reliability issues must be overcome. Prior work used per-track encodin ... Full text Cite

Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution

Conference IEEE International Symposium on Information Theory Proceedings · June 1, 2020 Flash memory devices are winning the competition for storage density against magnetic recording devices. This outcome results from advances in physics that allow storage of more than one bit per cell, coupled with advances in signal processing that reduce ... Full text Cite

Reconstruction of Multi-user Binary Subspace Chirps

Conference IEEE International Symposium on Information Theory Proceedings · June 1, 2020 We consider codebooks of Complex Grassmannian Lines consisting of Binary Subspace Chirps (BSSCs) in N =2m dimensions. BSSCs are generalizations of Binary Chirps (BCs), their entries are either fourth-roots of unity, or zero. BSSCs consist of a B ... Full text Cite

Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks

Conference IEEE International Symposium on Information Theory Proceedings · June 1, 2020 The continuous rise of the blockchain technology is moving various information systems towards decentralization. Blockchain-based decentralized storage networks (DSNs) offer significantly higher privacy and lower costs to customers compared with centralize ... Full text Cite

Asymmetric LOCO Codes: Constrained Codes for Flash Memories

Conference 2019 57th Annual Allerton Conference on Communication Control and Computing Allerton 2019 · September 1, 2019 In data storage and data transmission, certain patterns are more likely to be subject to error when written (transmitted) onto the media. In magnetic recording systems with binary data and bipolar non-return-to-zero signaling, patterns that have insufficie ... Full text Cite

A New Family of Constrained Codes with Applications in Data Storage

Conference 2019 IEEE Information Theory Workshop Itw 2019 · August 1, 2019 Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash device ... Full text Cite

Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes

Conference 2019 IEEE Information Theory Workshop Itw 2019 · August 1, 2019 In order to meet the demands of data-hungry applications, data storage devices are required to be increasingly denser. Various sources of error appear with this increase in density. Multi-dimensional (MD) graph-based codes are capable of mitigating error s ... Full text Cite

Codebooks of Complex Lines Based on Binary Subspace Chirps

Conference 2019 IEEE Information Theory Workshop Itw 2019 · August 1, 2019 Motivated by problems in machine-type wireless communications, we consider codebooks of complex Grassmannian lines in N = 2m dimensions. Binary Chirp (BC) codebooks of prior art are expanded to codebooks of Binary Subspace Chirps (BSSCs), where ... Full text Cite

GreenFlag: Protecting 3D-Racetrack Memory from Shift Errors

Conference Proceedings 49th Annual IEEE IFIP International Conference on Dependable Systems and Networks Dsn 2019 · June 1, 2019 Racetrack memory is an exciting emerging memory technology with the potential to offer far greater capacity and performance than other non-volatile memories. Racetrack memory has an unusual error model, though, which precludes the use of the typical error ... Full text Cite

Asymptotic Performance of Linear Discriminant Analysis with Random Projections

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · May 1, 2019 We investigate random projections in the context of randomly projected linear discriminant analysis (LDA). We consider the case in which the data of dimension p is randomly projected onto a lower dimensional space before being fed to the classifier. Using ... Full text Cite

Gradient information for representation and modeling

Conference Advances in Neural Information Processing Systems · January 1, 2019 Motivated by Fisher divergence, in this paper we present a new set of information quantities which we refer to as gradient information. These measures serve as surrogates for classical information measures such as those based on logarithmic loss, Kullback- ... Cite

Hierarchical coding to enable scalability and flexibility in heterogeneous cloud storage

Conference Proceedings IEEE Global Communications Conference Globecom · January 1, 2019 In order to accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data storage systems are required to be scalable, flexible, and heterogeneous. Code ... Full text Cite

Fake news detection using deep markov random fields

Conference Naacl Hlt 2019 2019 Conference of the North American Chapter of the Association for Computational Linguistics Human Language Technologies Proceedings of the Conference · January 1, 2019 Deep-learning-based models have been successfully applied to the problem of detecting fake news on social media. While the correlations among news articles have been shown to be effective cues for online news analysis, existing deep-learning-based methods ... Cite

Regularizing autoencoder-based matrix completion models via manifold learning

Conference European Signal Processing Conference · November 29, 2018 Autoencoders are popular among neural-network-based matrix completion models due to their ability to retrieve potential latent factors from the partially observed matrices. Nevertheless, when training data is scarce their performance is significantly degra ... Full text Cite

Classifying Pump-Probe Images of Melanocytic Lesions Using the WEYL Transform

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · September 10, 2018 Diagnosis of melanoma is fraught with uncertainty, and discordance rates among physicians remain high because of the lack of a definitive criterion. Motivated by this challenge, this paper first introduces the Patch Weyl transform (PWT), a 2-dimensional va ... Full text Cite

Compressed Neighbour Discovery using Sparse Kerdock Matrices

Conference IEEE International Symposium on Information Theory Proceedings · August 15, 2018 We study the network-wide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses (NIAs) of its neighbour. We work within the rapid on-off division duplex framework proposed by Guo and ... Full text Cite

ARQ for Interference Packet Networks

Conference IEEE International Symposium on Information Theory Proceedings · August 15, 2018 In multi-user wireless packet networks interference is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for packet retransmission. We consider networks with spatia ... Full text Cite

Sparse near-equiangular tight frames with applications in full duplex wireless communication

Conference 2017 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2017 - Proceedings · March 7, 2018 We construct extremely sparse, near-equiangular tight frames which share the same row space as certain incomplete Delsarte-Goethals frames. Frames combining these properties have application in full duplex communication in ad-hoc wireless networks. We high ... Full text Cite

Jenga: Efficient fault tolerance for stacked DRAM

Conference Proceedings 35th IEEE International Conference on Computer Design Iccd 2017 · November 22, 2017 In this paper, we introduce Jenga, a new scheme for protecting 3D DRAM, specifically high bandwidth memory (HBM), from failures in bits, rows, banks, channels, dies, and TSVs. By providing redundancy at the granularity of a cache block rather than across b ... Full text Cite

Orthogonal Time Frequency Space (OTFS) modulation for millimeter-wave communications systems

Conference IEEE MTT S International Microwave Symposium Digest · October 4, 2017 Due to the increased demand for data rate, flexibility, and reliability of 5G cellular systems, new modulation formats need to be considered. A recently proposed scheme, Orthogonal Time Frequency Space (OTFS), offers various advantages in particular in env ... Full text Cite

Rate optimal binary linear locally repairable codes with small availability

Conference IEEE International Symposium on Information Theory Proceedings · August 9, 2017 A locally repairable code with availability has the property that every code symbol can be recovered from multiple, disjoint subsets of other symbols of small size. In particular, a code symbol is said to have (r, t)-availability if it can be recovered fro ... Full text Cite

Multi-scale spectrum sensing in small-cell mm-wave cognitive wireless networks

Conference IEEE International Conference on Communications · July 28, 2017 In this paper, a multi-scale approach to spectrum sensing in cognitive cellular networks is proposed. In order to overcome the huge cost incurred in the acquisition of full network state information, a hierarchical scheme is proposed, based on which local ... Full text Cite

Multi-scale spectrum sensing in millimeter wave cognitive networks

Conference Conference Record of 51st Asilomar Conference on Signals Systems and Computers Acssc 2017 · July 2, 2017 In this paper, a multi-scale approach to spectrum sensing and information exchange in millimeter wave cognitive cellular networks is proposed. In order to overcome the huge energy cost of acquiring full network state information on the occupancy of each ce ... Full text Cite

Run-length limited codes for backscatter communication

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · June 16, 2017 In backscatter communications, ultra-low power devices signal by modulating the reflection of radio frequency signals emitted from an external source. Unlike conventional one-way communication, the backscatter channel experiences unique self-interference a ... Full text Cite

Orthogonal time frequency space modulation

Conference IEEE Wireless Communications and Networking Conference Wcnc · May 10, 2017 A new two-dimensional modulation technique called Orthogonal Time Frequency Space (OTFS) modulation designed in the delay-Doppler domain is introduced. Through this design, which exploits full diversity over time and frequency, OTFS coupled with equalizati ... Full text Cite

Bounds on the Number of Measurements for Reliable Compressive Classification

Conference IEEE Transactions on Signal Processing · November 15, 2016 This paper studies the classification of high-dimensional Gaussian signals from low-dimensional noisy, linear measurements. In particular, it provides upper bounds (sufficient conditions) on the number of measurements required to drive the probability of m ... Full text Cite

Classification and Reconstruction of High-Dimensional Signals from Low-Dimensional Features in the Presence of Side Information

Conference IEEE Transactions on Information Theory · November 1, 2016 This paper offers a characterization of fundamental limits on the classification and reconstruction of high-dimensional signals from low-dimensional features, in the presence of side information. We consider a scenario where a decoder has access both to li ... Full text Cite

Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels

Conference 2016 IEEE Information Theory Workshop Itw 2016 · October 21, 2016 Recently, sequences of error-correcting codes with doubly-transitive permutation groups were shown to achieve capacity on erasure channels under symbol-wise maximum a posteriori (MAP) decoding. From this, it follows that Reed-Muller and primitive narrow-se ... Full text Cite

Methuselah flash: Rewriting codes for extra long storage lifetime

Conference Proceedings 46th Annual IEEE IFIP International Conference on Dependable Systems and Networks Dsn 2016 · September 29, 2016 Motivated by embedded systems and datacenters that require long-life components, we extend the lifetime of Flash memory using rewriting codes that allow for multiple writes to a page before it needs to be erased. Although researchers have previously explor ... Full text Cite

Reed-muller codes achieve capacity on the quantum erasure channel

Conference IEEE International Symposium on Information Theory Proceedings · August 10, 2016 The quantum erasure channel is the simplest example of a quantum communication channel and its information capacity is known precisely. The subclass of quantum error-correcting codes called stabilizer codes is known to contain capacity-achieving sequences ... Full text Cite

Rate-distortion bounds on Bayes risk in supervised learning

Conference IEEE International Symposium on Information Theory Proceedings · August 10, 2016 An information-theoretic framework is presented for estimating the number of labeled samples needed to train a classifier in a parametric Bayesian setting. Ideas from rate-distortion theory are used to derive bounds for the average L1 or L∞ ... Full text Cite

When does spatial correlation add value to delayed channel state information?

Conference IEEE International Symposium on Information Theory Proceedings · August 10, 2016 Fast fading wireless networks with delayed knowledge of the channel state information have received significant attention in recent years. An exception is networks where channels are spatially correlated. This paper characterizes the capacity region of two ... Full text Cite

A general framework for reconstruction and classification from compressive measurements with side information

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · May 18, 2016 We develop a general framework for compressive linear-projection measurements with side information. Side information is an additional signal correlated with the signal of interest. We investigate the impact of side information on classification and signal ... Full text Cite

A geometric perspective on guesswork

Conference 2015 53rd Annual Allerton Conference on Communication Control and Computing Allerton 2015 · April 4, 2016 Guesswork is the position at which a random string drawn from a given probability distribution appears in the list of strings ordered from the most likely to the least likely. We define the tilt operation on probability distributions and show that it param ... Full text Cite

Informational bottlenecks in two-unicast wireless networks with delayed CSIT

Conference 2015 53rd Annual Allerton Conference on Communication Control and Computing Allerton 2015 · April 4, 2016 We study the impact of delayed channel state information at the transmitters (CSIT) in two-unicast wireless networks with a layered topology and arbitrary connectivity. We introduce a technique to obtain outer bounds to the degrees-of-freedom (DoF) region ... Full text Cite

Can linear minimum storage regenerating codes be universally secure?

Conference Conference Record Asilomar Conference on Signals Systems and Computers · February 26, 2016 We study the problem of making a distributed storage system information-theoretically secure against a passive eavesdropper, and aim to characterize coding schemes that are universally secure for up to a given number of eavesdropped nodes. Specifically, we ... Full text Cite

Compressive imaging using fast transform coding

Conference Proceedings of SPIE the International Society for Optical Engineering · January 1, 2016 We propose deterministic sampling strategies for compressive imaging based on Delsarte-Goethals frames. We show that these sampling strategies result in multi-scale measurements which can be related to the 2D Haar wavelet transform. We demonstrate the effe ... Full text Cite

A rate-distortion framework for supervised learning

Conference IEEE International Workshop on Machine Learning for Signal Processing Mlsp · November 10, 2015 An information-theoretic framework is presented for bounding the number of samples needed for supervised learning in a parametric Bayesian setting. This framework is inspired by an analogy with rate-distortion theory, which characterizes tradeoffs in the l ... Full text Cite

Writing without disturb on phase change memories by integrating coding and layout design

Conference ACM International Conference Proceeding Series · October 5, 2015 We integrate coding techniques and layout design to elimi- nate write-disturb in phase change memories (PCMs), while enhancing lifetime and host-visible capacity. We first pro- pose a checkerboard confguration for cell layout to elimi- nate write-disturb w ... Full text Cite

Classification and reconstruction of compressed GMM signals with side information

Conference IEEE International Symposium on Information Theory Proceedings · September 28, 2015 This paper offers a characterization of performance limits for classification and reconstruction of high-dimensional signals from noisy compressive measurements, in the presence of side information. We assume the signal of interest and the side information ... Full text Cite

Impact of local delayed CSIT on the capacity region of the two-user interference channel

Conference IEEE International Symposium on Information Theory Proceedings · September 28, 2015 The coherence time of a wireless channel is often smaller than the delay with which channel state information is available at transmitters. In this paper, we aim to find the most important subset of the channel state information that transmitters need to l ... Full text Cite

Mismatch in the classification of linear subspaces: Upper bound to the probability of error

Conference IEEE International Symposium on Information Theory Proceedings · September 28, 2015 This paper studies the performance associated with the classification of linear subspaces corrupted by noise with a mismatched classifier. In particular, we consider a problem where the classifier observes a noisy signal, the signal distribution conditione ... Full text Cite

Quantifying computational security subject to source constraints, guesswork and inscrutability

Conference IEEE International Symposium on Information Theory Proceedings · September 28, 2015 Guesswork forms the mathematical framework for quantifying computational security subject to brute-force determination by query. In this paper, we consider guesswork subject to a per-symbol Shannon entropy budget. We introduce inscrutability rate as the as ... Full text Cite

Cyclic LRC codes and their subfield subcodes

Conference IEEE International Symposium on Information Theory Proceedings · September 28, 2015 We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Tra ... Full text Cite

Alignment with intra-class structure can improve classification

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · August 4, 2015 High dimensional data is modeled using low-rank subspaces, and the probability of misclassification is expressed in terms of the principal angles between subspaces. The form taken by this expression motivates the design of a new feature extraction method t ... Full text Cite

Multi-scale Bayesian reconstruction of compressive X-ray image

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · August 4, 2015 A novel multi-scale dictionary based Bayesian reconstruction algorithm is proposed for compressive X-ray imaging, which encodes the material's spectrum by Poisson measurements. Inspired by recently developed compressive X-ray imaging systems [1], this work ... Full text Cite

Polynomial-phase signal direction-finding and source-tracking with a single acoustic vector sensor

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · August 4, 2015 This paper introduces a new ESPRIT-based algorithm to estimate the direction-of-arrival of an arbitrary degree polynomial-phase signal with a single acoustic vector-sensor. The proposed time-invariant ESPRIT algorithm is based on a matrix-pencil pair deriv ... Full text Cite

Collaborative compressive X-ray image reconstruction

Conference ICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · August 4, 2015 The Poisson Factor Analysis (PFA) is applied to recover signals from a Poisson compressive sensing system. Motivated by the recently developed compressive X-ray imaging system, Coded Aperture Coherent Scatter Spectral Imaging (CACSSI) [1], we propose a new ... Full text Cite

Efficient linear time-varying system identification using chirp waveforms

Conference Conference Record Asilomar Conference on Signals Systems and Computers · April 24, 2015 Linear, time-varying (LTV) systems are operators composed of time shifts, frequency shifts, and complex amplitude scalings that act on continuous finite-energy waveforms. This paper builds upon a novel, resource-efficient method previously proposed by the ... Full text Cite

Geometry-aware deep transform

Conference Proceedings of the IEEE International Conference on Computer Vision · February 17, 2015 Many recent efforts have been devoted to designing sophisticated deep learning structures, obtaining revolutionary results on benchmark datasets. The success of these deep learning methods mostly relies on an enormous volume of labeled training samples to ... Full text Cite

Discriminative robust transformation learning

Conference Advances in Neural Information Processing Systems · January 1, 2015 This paper proposes a framework for learning features that are robust to data variation, which is particularly important when only a limited number of training samples are available. The framework makes it possible to tradeoff the discriminative value of l ... Cite

Dynamic spectrum estimation with minimal overhead via multiscale information exchange

Conference Proceedings IEEE Global Communications Conference Globecom · January 1, 2015 In this paper, a multiscale approach to spectrum sensing in cognitive cellular networks is analyzed. Observing that wireless interference decays with distance, and that estimating the entire spectrum occupancy across the network entails substantial energy ... Full text Cite

A survey of compressed sensing

Conference · January 1, 2015 Compressed sensing was introduced some ten years ago as an effective way of acquiring signals, which possess a sparse or nearly sparse representation in a suitable basis or dictionary. Due to its solid mathematical backgrounds, it quickly attracted the att ... Full text Cite

Compressive classification: Where wireless communications meets machine learning

Conference · January 1, 2015 This chapter introduces Shannon-inspired performance limits associated with the classification of low-dimensional subspaces embedded in a high-dimensional ambient space from compressive and noisy measurements. In particular, it introduces the diversity-dis ... Full text Cite

Data representation using the Weyl transform

Conference 3rd International Conference on Learning Representations Iclr 2015 Workshop Track Proceedings · January 1, 2015 The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as ... Cite

Nonlinear information-theoretic compressive measurement design

Conference 31st International Conference on Machine Learning Icml 2014 · January 1, 2014 We investigate design of general nonlinear functions for mapping high-dimensional data into a lower-dimensional (compressive) space. The nonlinear measurements are assumed contaminated by additive Gaussian noise. Depending on the application, we are either ... Cite

Average case analysis of high-dimensional block-sparse recovery and regression for arbitrary designs

Conference Journal of Machine Learning Research · January 1, 2014 This paper studies conditions for high-dimensional inference when the set of observations is given by a linear combination of a small number of groups of columns of a design matrix, termed the "block-sparse" case. In this regard, it first specifies conditi ... Cite

Shaping the Power Spectra of Bipolar Sequences with Application to Sub-Nyquist Sampling

Conference 2013 IEEE 5TH INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING (CAMSAP 2013) · January 1, 2013 Link to item Cite

Resource-Efficient Parametric Recovery of Linear Time-Varying Systems

Conference 2013 IEEE 5TH INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING (CAMSAP 2013) · January 1, 2013 Link to item Cite

Imaging the distribution of melanin in human skin lesions with pump-probe microscopy

Conference Optics Infobase Conference Papers · January 1, 2011 Full text Cite

Channel Estimation for MIMO-OFDM using Complementary Codes

Conference RWS: 2009 IEEE RADIO AND WIRELESS SYMPOSIUM · 2009 Link to item Cite

A Sublinear Algorithm for Sparse Reconstruction with 2 Recovery Guarantees

Conference 2009 3RD IEEE INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING (CAMSAP) · 2009 Link to item Cite

Golay Complementary Waveforms for Sparse Delay-Doppler Radar Imaging

Conference 2009 3RD IEEE INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING (CAMSAP) · 2009 Link to item Cite

Linear-time decodable secrecy codes for binary erasure wiretap channels

Conference 43rd Annual Allerton Conference on Communication Control and Computing 2005 · January 1, 2005 In this paper we consider encoder and decoder design for codes achieving perfect secrecy on the wiretap channel. We consider the special case of a noiseless main channel and binary erasure channel (BEC) as the wiretapper's channel and show that it is possi ... Cite

The first order space-time reed-muller codes

Conference 43rd Annual Allerton Conference on Communication Control and Computing 2005 · January 1, 2005 We present a family of Space-Time codes for the noncoherent MIMO channel. These space-time codes are strongly related to standard binary fist order Reed-Muller codes. In particular, their decoder can be built from several parallel decoders of first order R ... Cite

On embedded diversity codes

Conference 43rd Annual Allerton Conference on Communication Control and Computing 2005 · January 1, 2005 Diversity-embedded codes for fading channels are high-rate codes that are de-signed so that they have a high-diversity code embedded within them [3, 4]. This is equivalent to coding the data into two streams such that the high-priority stream has higher re ... Cite

A novel full-rate full-diversity STBC with application to WiMAX

Conference IEEE Vehicular Technology Conference · January 1, 2005 We 1 present a novel full-rate full-diversity orthogonal space-time block code for QPSK modulation and 4 transmit antennas based on quaternionic algebra. The code does not result in constellation expansion unlike other fullrate full-diversity codes in the ... Full text Cite

Opportunistic space-time block codes

Conference IEEE Vehicular Technology Conference · January 1, 2005 Rate and diversity impose a fundamental tradeoff in space-time coding. High-rate space-time codes come at a cost of lower diversity, and high reliability (diversity) implies a lower rate. In [2], [3], we 1 proposed a different point of view where we design ... Full text Cite

Space-time coding and signal processing for high data rate wireless communications

Conference WIRELESS COMMUNICATION TECHNOLOGIES: NEW MULTIMEDIA SYSTEMS · 2000 Link to item Cite

The application of orthogonal designs to wireless communication

Conference 1998 Information Theory Workshop Itw 1998 · January 1, 1998 We introduce space-block codzng, a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-block code and the encoded data is split into n streams which are simultaneously transmitted usin ... Full text Cite

Sequence based methods for data transmission and source compression

Conference Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 1993 In the last 10 years the invention of trellis coded modulation has revolutionized communication over bandlimited channels and is starting to be used in magnetic storage. Part of the reason is that sophisticated signal processing systems involving finite st ... Full text Cite

On the apparent duality of the kerdock and preparata codes

Conference Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 1993 The Kerdock and extended Preparata codes are something of an enigma in coding theory since they are both Hamming-distance invariant and have weight enumerators that are MacWilliams duals just as if they were dual linear codes. In this paper, we explain, by ... Full text Cite

State-space characterization of viterbi detector path metric differences

Conference Conference Record Asilomar Conference on Signals Systems and Computers · January 1, 1992 In the digital implementations of maximumlikelihood detectors based upon the Viterbi algorithm, bounds on the values of path metric differences are important parameters, and various techniques have been proposed for computing such bounds. This paper addres ... Full text Cite

Binary covering codes and high speed data transmission

Conference Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 1991 There has been a great deal of recent interest in the covering radius of binary codes. We shall describe how good covering codes can be used to make high speed data transmission more reliable. ... Full text Cite