Robert Calderbank

Robert Calderbank

Auto-generated profile, based on publicly available information

Robert Calderbank

Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2022 in IEEE BITS the Information Theory Magazine
Verified
Journal Article
Closed access
SMSaif Khan Mohammed
Saif Khan Mohammed
RHRonny Hadani
Ronny Hadani
ACAnanthanarayanan Chockalingam
Ananthanarayanan Chockalingam
RCRobert Calderbank
Robert Calderbank
Orthogonal time frequency space (OTFS) is a framework for communication and active sensing that processes signals in the delay-Doppler (DD) domain. This paper explores three key features of the OTFS framework, and explains their value to applications. The first feature is a compact and sparse DD domain parameterization of the wireless channel, where the parameters map directly to physical attributes of the reflectors that comprise the scattering environment, and as a consequence these parameters evolve predictably. The second feature is a novel waveform / modulation technique, matched to the DD channel model, that embeds information symbols in the DD domain. The relation between channel inputs and outputs is localized, non-fading and predictable, even in the presence of significant delay and Doppler spread, and as a consequence the channel can be efficiently acquired and equalized. By avoiding fading, the post equalization SNR remains constant across all information symbols in a packet, so that bit error performance is superior to contemporary multi-carrier waveforms. Further, the OTFS carrier waveform is a localized pulse in the DD domain, making it possible to separate reflectors along both delay and Doppler simultaneously, and to achieve a high-resolution delay-Doppler radar image of the environment. In other words, the DD parameterization provides a common mathematical framework for communication and radar. This is the third feature of the OTFS framework, and it is ideally suited to intelligent transportation systems involving self-driving cars and unmanned ground/aerial vehicles which are self/network controlled. The OTFS waveform is able to support stable and superior performance over a wide range of user speeds. In the emerging 6 G systems and standards, it is ideally suited to support mobility-on-demand envisaged in next generation cellular and WiFi systems, as well as high-mobility use cases. Finally, the compactness and predictability of the OTFS input-output relation makes it a natural fit for machine learning and AI algorithms designed for intelligent non-myopic management of control plane resources in future mobile networks.

27 September 2023 in IEEE BITS the Information Theory Magazine
Verified
Journal Article
Closed access
SMSaif Khan Mohammed
Saif Khan Mohammed
RHRonny Hadani
Ronny Hadani
ACAnanthanarayanan Chockalingam
Ananthanarayanan Chockalingam
RCRobert Calderbank
Robert Calderbank
In our first paper [2] we explained why the Zak-OTFS input-output (I/O) relation is predictable and non-fading when the delay and Doppler periods are greater than the effective channel delay and Doppler spreads, a condition which we refer to as the crystallization condition. We argued that a communication system should operate within the crystalline regime. It is well known that it is possible to identify a linear time varying (LTV) channel if and only if it is under-spread. The crystallization condition is more restrictive than the under-spread condition, so identification is always possible. In the crystalline regime, we show that Zak-OTFS pilot sequences minimize the complexity of identifying the effective DD domain channel filter. We demonstrate that the filter taps can simply be read off from the response to a single Zak-OTFS pilot. In general, we provide an explicit formula for reconstructing the Zak-OTFS I/O relation from a finite number of received pilot symbols in the delay- Doppler (DD) domain. This reconstruction formula makes it possible to study predictability of the Zak-OTFS I/O relation for a sampled system that operates under finite duration and bandwidth constraints. We analyze reconstruction accuracy for different choices of the delay and Doppler periods, and of the pulse shaping filter. Reconstruction accuracy is high when the crystallization condition is satisfied, implying that it is possible to learn directly the I/O relation without needing to estimate the underlying channel. This opens up the possibility of a model-free mode of operation, which is especially useful when a traditional model-dependent mode of operation (reliant on estimation of the underlying physical channel) is out of reach (for example, when the channel comprises of unresolvable paths, or exhibits a continuous delay- Doppler profile such as in presence of acceleration). Our study clarifies the fundamental origins of predictability by revealing how non-predictability appears as a consequence of aliasing in the DD domain. This perspective leads to a canonical decomposition of the effective DD channel as a sum of predictable and non-predictable components, which we refer to as the crystalline decomposition. Vanishing of the non-predictable component of the channel is equivalent to satisfying the crystallization condition. Finally, we measure the benefits of predictability in terms of bit error rate (BER) performance. We consider two cases. In the first, we measure performance given perfect knowledge of the I/O relation. We show that performance is optimal when the crystallization condition holds, that performance approaches that of Time Domain Modulation (TDM) when the Doppler period vanishes, and approaches that of Frequency Domain Modulation (FDM) when the delay period vanishes. In the second, we measure performance given imperfect knowledge of the I/O relation, as is the case when it is not possible to learn the underlying channel. We show that model-free operation is successful when the crystallization condition holds, and that performance is only slightly worse than performance given perfect knowledge of the I/O relation. We also compare the performance of Zak-OTFS with that of a well-studied conventional multi-carrier approximation to Zak-OTFS, which we refer to as MC-OTFS. We show that the I/O relation of MC-OTFS is predictable to a lesser degree than that of Zak-OTFS, and as a result the performance of MC-OTFS is inferior as the Doppler spread increases.

30 July 2020 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
NRNarayanan Rengaswamy
Narayanan Rengaswamy
RCRobert Calderbank
Robert Calderbank
MNMichael Newman
Michael Newman
HPHenry D. Pfister
Henry D. Pfister
In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal T and T gates preserve the codespace. Our Heisenberg perspective reduces this question to a finite geometry problem that translates to the design of certain classical codes. We prove three corollaries of this result: (a) For any non-degenerate n,k,d stabilizer code supporting a physical transversal T (which might not be logical T), there exists an n,k,d CSS code with the same property; (b) Triorthogonal codes form the most general family of CSS codes that realize logical transversal T via physical transversal T; (c) Triorthogonality is necessary for physical transversal T on a CSS code to realize the logical identity. The main tool we use is a recent characterization of a particular family of diagonal gates in the Clifford hierarchy that are efficiently described by symmetric matrices over rings of integers N. Rengaswamy et al., Phys. Rev. A 100, 022304. We refer to these operations as Quadratic Form Diagonal (QFD) gates. Our framework generalizes all existing stabilizer code constructions that realize logical gates via transversal T. We provide several examples of codes and briefly discuss connections to decreasing monomial codes, pin codes, generalized triorthogonality and quasitransversality. We partially extend these results towards characterizing all stabilizer codes that support transversal π/2ℓ Z-rotations. In particular, using Ax’s theorem on residue weights of polynomials, we provide an alternate characterization of logical gates induced by transversal π/2ℓ Z-rotations on a family of quantum Reed-Muller codes. We also briefly discuss a general approach to analyze QFD gates that might lead to a characterization of all stabilizer codes that support any given physical transversal 1-or 2-local diagonal gate.

27 May 2011 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MRMaxim Raginsky
Maxim Raginsky
SJSina Jafarpour
Sina Jafarpour
ZHZachary T. Harmany
Zachary T. Harmany
RMRoummel F. Marcia
Roummel F. Marcia
RWRebecca M. Willett
Rebecca M. Willett
RCRobert Calderbank
Robert Calderbank
This paper provides performance bounds for compressed sensing in the presence of Poisson noise using expander graphs. The Poisson noise model is appropriate for a variety of applications, including low-light imaging and digital streaming, where the signal-independent and/or bounded noise models used in the compressed sensing literature are no longer applicable. In this paper, we develop a novel sensing paradigm based on expander graphs and propose a maximum a posteriori (MAP) algorithm for recovering sparse or compressible signals from Poisson observations. The geometry of the expander graphs and the positivity of the corresponding sensing matrices play a crucial role in establishing the bounds on the signal reconstruction error of the proposed algorithm. We support our results with experimental demonstrations of reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arrivals of packets in each flow follow a Poisson process.

31 March 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZZZhou Zhou
Zhou Zhou
LLLingjia Liu
Lingjia Liu
JXJiarui Xu
Jiarui Xu
RCRobert Calderbank
Robert Calderbank
Orthogonal Time Frequency Space (OTFS) is a novel framework that processes modulation symbols via a time-independent channel characterized by the delay-Doppler domain. The conventional waveform, orthogonal frequency division multiplexing (OFDM), requires tracking frequency selective fading channels over the time, whereas OTFS benefits from full time-frequency diversity by leveraging appropriate equalization techniques. In this paper, we consider a neural network-based supervised learning framework for OTFS equalization. Learning of the introduced neural network is conducted in each OTFS frame fulfilling an online learning framework: the training and testing datasets are within the same OTFS-frame over the air. Utilizing reservoir computing, a special recurrent neural network, the resulting one-shot online learning is sufficiently flexible to cope with channel variations among different OTFS frames (e.g., due to the link/rank adaptation and user scheduling in cellular networks). The proposed method does not require explicit channel state information (CSI) and simulation results demonstrate a lower bit error rate (BER) than conventional equalization methods in the low signal-to-noise (SNR) regime under large Doppler spreads. When compared with its neural network-based counterparts for OFDM, the introduced approach for OTFS will lead to a better tradeoff between the processing complexity and the equalization performance.

7 August 2019 in Physical Review A
Verified
Journal Article
Closed access
PDF file
NRNarayanan Rengaswamy
Narayanan Rengaswamy
RCRobert Calderbank
Robert Calderbank
HPHenry D. Pfister
Henry D. Pfister
The Clifford hierarchy of unitary operators is a foundational concept for universal quantum computation. It was introduced to show that universal quantum computation can be realized via quantum teleportation, given access to certain standard resources. While the full structure of the hierarchy is still not understood, Cui et al. [S. X. Cui et al., Phys. Rev. A 95, 012329 (2017)] recently described the structure of diagonal unitaries in the hierarchy. They considered diagonal unitaries whose action on a computational basis qudit state is described by a 2kth root of unity raised to some polynomial function of the state, and they established the level of such unitaries in the hierarchy as a function of k and the degree of the polynomial. For qubit systems, we consider kth-level diagonal unitaries that can be described just by quadratic forms of the state over the ring Z2k of integers modulo 2k. The quadratic forms involve symmetric matrices over Z2k that can be used to efficiently describe all two-local and certain higher locality diagonal gates in the hierarchy. We also provide explicit algebraic descriptions of their action on Pauli matrices, which establishes a natural recursion to diagonal unitaries from lower levels. The result involves symplectic matrices over Z2k and hence our perspective unifies a subgroup of diagonal gates in the Clifford hierarchy with the binary symplectic framework for gates in the Clifford group. We augment our description with simple examples for certain standard gates. In addition to demonstrating structure, these formulas might prove useful in applications such as (i) classical simulation of quantum circuits, especially via the stabilizer rank approach, (ii) synthesis of logical non-Clifford unitaries, specifically alternatives to expensive magic state distillation, and (iii) decomposition of arbitrary unitaries beyond the Clifford+T set of gates, perhaps leading to shorter depth circuits. Our results suggest that some nondiagonal gates in the hierarchy might also be understood by generalizing other binary symplectic matrices to integer rings.