Coding Schemes for Noiseless and Noisy Asynchronous CDMA Systems

Wu, Ying-Wah; Chang, Shih Cheng

doi:10.1109/tit.2010.2050919

Cited by 5 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In classical communications, a unified method for synchronization and error correction can reduce implementation complexity [25]. A similar method using cyclic codes has also been proposed recently in the classical domain for simple implementation of asynchronous code division multiple access (CDMA) systems with random delays [26]. We hope that our seamlessly unified solution to block synchronization and quantum error correction may help simplify requirements on hardware and open up new possibilities of quantum computation and quantum communication such as transmission of a large amount of consecutive quantum information blocks with little aid from classical communications.…”

Section: Discussionmentioning

confidence: 99%

Block synchronization for quantum information

Fujiwara

2013

Phys. Rev. A

View full text Add to dashboard Cite

Locating the boundaries of consecutive blocks of quantum information is a fundamental building block for advanced quantum computation and quantum communication systems. We develop a coding theoretic method for properly locating boundaries of quantum information without relying on external synchronization when block synchronization is lost. The method also protects qubits from decoherence in a manner similar to conventional quantum error-correcting codes, seamlessly achieving synchronization recovery and error correction. A family of quantum codes that are simultaneously synchronizable and error-correcting is given through this approach.

show abstract

Section: Discussionmentioning

confidence: 99%

Block synchronization for quantum information

Fujiwara

2013

Phys. Rev. A

View full text Add to dashboard Cite

show abstract

“…Finding the overloaded UD class of codes for noiseless channel is directly related to coin-weighing problem, one of the problems that is discussed by Erdős and Rényi [11]. It can be considered as a special case of a general problem where authors in [12], [13], [16], [25], [26] refer to them as detecting matrices. Lindström [15] defines the same problem as the detecting set of vectors.…”

Section: Introductionmentioning

confidence: 99%

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

et al. 2022

View full text Add to dashboard Cite

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals K a max is the largest known for the given code length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational complexity for even moderate code lengths, the proposed decoder has a quasi-quadratic computational complexity. Simulation results in terms of bit-error-rate (BER) demonstrate that the performance of the proposed decoder has only a 1 − 2 dB degradation in signal-to-noise ratio (SNR) at a BER of 10 −3 when compared to ML. Moreover, we derive the proof of the minimum Manhattan distance of such UD codes and we provide the proofs for the propositions; these proofs constitute the foundation of the formal proof for the maximum number users K a max for L = 8.

show abstract