209 research outputs found
Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity
In this correspondence, constructions of generalized concatenated (GC) codes with good rates and distances are presented. Some of the proposed GC codes have simpler trellis omplexity than Euclidean geometry (EG), ReedâMuller (RM), or BoseâChaudhuriâHocquenghem (BCH) codes of approximately the same rates and minimum distances, and in addition can be decoded with trellis-based multistage decoding up to their minimum distances. Several codes of the same length, dimension, and minimum distance as the best linear codes known are constructed
Binary Multilevel Convolutional Codes with Unequal Error Protection Capabilities
Binary multilevel convolutional codes (CCs) with unequal error protection (UEP) capabilities are studied. These codes belong to the class of generalized concatenated (GC) codes. Binary CCs are used as outer codes. Binary linear block codes of short length, and selected subcodes in their two-way subcode partition chain, are used as inner codes. Multistage decodings are presented that use Viterbi decoders operating on trellises with similar structure to that of the constituent binary CCs. Simulation results of example binary two-level CC\u27s are also reported
The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing
and protecting fragile qubits against the undesirable effects of quantum
decoherence. Similar to classical codes, hashing bound approaching QECCs may be
designed by exploiting a concatenated code structure, which invokes iterative
decoding. Therefore, in this paper we provide an extensive step-by-step
tutorial for designing EXtrinsic Information Transfer (EXIT) chart aided
concatenated quantum codes based on the underlying quantum-to-classical
isomorphism. These design lessons are then exemplified in the context of our
proposed Quantum Irregular Convolutional Code (QIRCC), which constitutes the
outer component of a concatenated quantum code. The proposed QIRCC can be
dynamically adapted to match any given inner code using EXIT charts, hence
achieving a performance close to the hashing bound. It is demonstrated that our
QIRCC-based optimized design is capable of operating within 0.4 dB of the noise
limit
Iterative Detection of Diagonal Block Space Time Trellis Codes, TCM and Reversible Variable Length Codes for Transmission over Rayleigh Fading Channels
Iterative detection of Diagonal Block Space Time Trellis Codes (DBSTTCs), Trellis Coded Modulation (TCM) and Reversible Variable Length Codes (RVLCs) is proposed. With the aid of efficient iterative decoding, the proposed scheme is capable of providing full transmit diversity and a near channel capacity performance. The performance of the proposed scheme was evaluated when communicating over uncorrelated Rayleigh fading channels. Explicitly, significant iteration gains were achieved by the proposed scheme, which was capable of performing within 2~dB from the channel capacity
Multi-dimensional modulation codes for fading channel
Some new codes are presented which have good performance on Rician fading channel with small decoding complexities. A new M-way partition chain is proposed for the L x MPSK (L less than or equal to M) signal set which maximizes the intra-set distance of each subset at each partition level. Based on this partition chain, a class of asymptotical optimum codes was found. For M = 4, these codes have both large symbol distances and product distances. Multi-level coding scheme allows to construct a code by hand such that the code meets some desired parameters, e.g., symbol distance, product distance, etc. In design of a multi-level code, all factors were considered which affect the performance and complexity of the code, such as, the decoding scheme, decoding complexity, and performance under the decoding scheme, e.g., if the multi-stage decoding scheme is used, the performance degradation due to the suboptimum decoding is taken into consideration. The performance for most of the presented codes was simulated on Rayleigh fading channel, and the results show that these codes have good performance with small decoding complexities
- âŠ