A Noncoherent Space-Time Code from Quantum Error Correction

In this work, we develop a space-time block code for noncoherent communication using techniques from the field of quantum error correction. We decompose the multiple-input multiple-output (MIMO) channel into operators from quantum mechanics, and design a non-coherent space time code using the quantum stabilizer formalism. We derive an optimal decoder, and analyze the former through a quantum mechanical lens. We compare our approach to a comparable coherent approach and a noncoherent differential approach, achieving comparable or better performance.Comment: 6 pages, one figure, accepted at the 53rd annual Conference on Information Sciences and System

Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems

In this paper we propose a simple method for generating short-length rate-compatible codes over $\mathbb{Z}_M$ that are robust to non-coherent detection for $M$-PSK constellations. First, a greedy algorithm is used to construct a family of rotationally invariant codes for a given constellation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. We briefly discuss the optimality of the constructed codes for special cases of BPSK and QPSK constellations. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We also derive a simple asymptotic upper bound on the frame error rate (FER) of such codes and provide the simulation results for a selected set of proposed codes. Finally, we briefly discuss the problem of designing binary codes that are robust to non-coherent detection for QPSK constellation.Comment: 11 pages, 5 figure

Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2. One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code, are analyzed and clarified. We propose a construction of secure network coding scheme, and analyze its security performance and error correction capability as an example of applications of the RDIP and the RGRW. Silva and Kschischang showed the existence of a secure network coding in which no part of the secret message is revealed to the adversary even if any dim C_1-1 links are wiretapped, which is guaranteed over any underlying network code. However, the explicit construction of such a scheme remained an open problem. Our new construction is just one instance of secure network coding that solves this open problem.Comment: IEEEtran.cls, 25 pages, no figure, accepted for publication in IEEE Transactions on Information Theor

Boolean Functions, Projection Operators and Quantum Error Correcting Codes

This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and non-additive quantum error correcting codes. The new framework leads to the construction of a variety of codes including an infinite class of codes that extend the original ((5,6,2)) code found by Rains [21]. It also extends to operator quantum error correcting codes.Comment: Submitted to IEEE Transactions on Information Theory, October 2006, to appear in IEEE Transactions on Information Theory, 200

Comparison of direct and heterodyne detection optical intersatellite communication links

The performance of direct and heterodyne detection optical intersatellite communication links are evaluated and compared. It is shown that the performance of optical links is very sensitive to the pointing and tracking errors at the transmitter and receiver. In the presence of random pointing and tracking errors, optimal antenna gains exist that will minimize the required transmitter power. In addition to limiting the antenna gains, random pointing and tracking errors also impose a power penalty in the link budget. This power penalty is between 1.6 to 3 dB for a direct detection QPPM link, and 3 to 5 dB for a heterodyne QFSK system. For the heterodyne systems, the carrier phase noise presents another major factor of performance degradation that must be considered. In contrast, the loss due to synchronization error is small. The link budgets for direct and heterodyne detection systems are evaluated. It is shown that, for systems with large pointing and tracking errors, the link budget is dominated by the spatial tracking error, and the direct detection system shows a superior performance because it is less sensitive to the spatial tracking error. On the other hand, for systems with small pointing and tracking jitters, the antenna gains are in general limited by the launch cost, and suboptimal antenna gains are often used in practice. In which case, the heterodyne system has a slightly higher power margin because of higher receiver sensitivity

Quantum information processing approaches in classical systems

The engineering problem of building scalable quantum computers has prompted the development of a rich theory modeling the evolution of quantum systems as well as techniques to preserve quantum information in the presence of noise. Such techniques offer systems-level approaches to the problem of robustly encoding and preserving information and, as a result, see applicability in a wide variety of architectures for computing systems. In this thesis, we visit the mathematical underpinnings of quantum information and apply strategies inspired by quantum information processing to two non-quantum systems to demonstrate advantage. We first describe the construction of a quantum emulation device, an analog electronic system with the same mathematical structure as a gate-based quantum computer, and introduce novel time-domain information encoding methods to increase the computational capacity of the device. We confirm the sustained performance of the improved system by successfully transforming emulated states by randomly selected quantum gates. We then visit similarities between quantum information processing and signal processing in the noncoherent wireless communication setting, the latter being an environment characterized by a lack of instantaneous channel knowledge. We describe the theoretical underpinnings of the noncoherent communication environment from both an information theoretic and signal processing perspective. This leads us to propose a multi-antenna space-time code construction based on a family of quantum error correcting codes known as stabilizer codes. For this code, we derive the optimal decoder in Rayleigh and Ricean fading and benchmark the its performance against coherent and differential coding at comparable rates.Electrical and Computer Engineerin

Advanced deep space communication systems study Final report

Deep space communication system requirements for period 1970 to 198

A low complexity distributed differential scheme based on orthogonal space time block coding for decode-and-forward wireless relay networks

This work proposes a new differential cooperative diversity scheme with high data rate and low decoding complexity using the decode-and-forward protocol. The proposed model does not require either differential encoding or channel state information at the source node, relay nodes, or destination node where the data sequence is directly transmitted and the differential detection method is applied at the relay nodes and the destination node. The proposed technique enjoys a low encoding and decoding complexity at the source node, the relay nodes, and the destination node. Furthermore, the performance of the proposed strategy is analyzed by computer simulations in quasi-static Rayleigh fading channel and using the decode-and-forward protocol. The simulation results show that the proposed differential technique outperforms the corresponding reference strategies

Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric

Codes in the sum-rank metric have various applications in error control for multishot network coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS) codes contain Reed-Solomon and Gabidulin codes as subclasses and fulfill the Singleton-like bound in the sum-rank metric with equality. We propose the first known error-erasure decoder for LRS codes to unleash their full potential for multishot network coding. The presented syndrome-based Berlekamp-Massey-like error-erasure decoder can correct $t_F$ full errors, $t_R$ row erasures and $t_C$ column erasures up to $2t_F + t_R + t_C \leq n-k$ in the sum-rank metric requiring at most $\mathcal{O}(n^2)$ operations in $\mathbb{F}_{q^m}$, where $n$ is the code's length and $k$ its dimension. We show how the proposed decoder can be used to correct errors in the sum-subspace metric that occur in (noncoherent) multishot network coding.Comment: 6 pages, presented at ISIT 202

Reduced-complexity non-coherent soft-decision-aided DAPSK dispensing with channel estimation

Differential Amplitude Phase Shift Keying (DAPSK), which is also known as star-shaped QAM has implementational advantages not only due to dispensing with channel estimation, but also as a benefit of its low signal detection complexity. It is widely recognized that separately detecting the amplitude and the phase of a received DAPSK symbol exhibits a lower complexity than jointly detecting the two terms. However, since the amplitude and the phase of a DAPSK symbol are affected by the correlated magnitude fading and phase-rotations, detecting the two terms completely independently results in a performance loss, which is especially significant for soft-decision-aided DAPSK detectors relying on multiple receive antennas. Therefore, in this contribution, we propose a new soft-decision-aided DAPSK detection method, which achieves the optimum DAPSK detection capability at a substantially reduced detection complexity. More specifically, we link each a priori soft input bit to a specific part of the channel's output, so that only a reduced subset of the DAPSK constellation points has to be evaluated by the soft DAPSK detector. Our simulation results demonstrate that the proposed soft DAPSK detector exhibits a lower detection complexity than that of independently detecting the amplitude and the phase, while the optimal performance of DAPSK detection is retained