An Adaptive Joint Source/Channel Coding Using Error Correcting Arithmetic Codes

An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.

A Decode-and-Forward Scheme for LDPC Coded Three-Way Relay Fading Channels

In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is applied, two time slots are sufficient for one round information exchange. In this paper, we present a decode-and-forward(DF) scheme based on joint LDPC decoding for three-way relay channels, where relay decoder partially decodes the network code rather than fully decodes all the user messages. Simulation results show that the new DF scheme considerably outperforms other common schemes in three-way relay fading channels.

A simple channel estimator for space-time coded OFDM systems in rapid fading channels

A simple channel estimator for space-time coded orthogonal frequency division multiplexing (OFDM) systems in rapid fading channels is proposed. The channels at the training bauds are estimated using the EM (expectation-maximization) algorithm, while the channels at the data bauds are estimated based on the method for modelling the time-varying channel as the linear combination of several time-invariant " Doppler channels". Computer simulations showed that this estimator outperforms the decision-directed tracking in rapid fading channels and that the performance of this method can be improved by iteration.

Entanglement fidelity of channel adaptive quantum codes

We study the performances of quantum channel adaptive [4,1] code transmitting in a joint amplitude damping and dephasing channel, the [6,2] code transmitting in an amplitude damping channel by combining the encoding, noise process, and decoding as one effective channel. We explicitly obtain the entanglement fidelities. The recovery operators of the [6,2] code are given. The performance is nearly optimal compared with that of the optimal method of semidefinite programming.

JOINT ITERATIVE DECODING FOR SIMPLE-ENCODING SYSTEMATIC IRREGULAR-LDPC-BASED CODED COOPERATION IN NON-IDEAL RELAY CHANNEL

In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.

Performance analysis of LDPC codes on OOK terahertz wireless channels

Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parity check（LDPC） codes with soft decision decoding algorithm is proposed to improve the bit-error-rate（BER） performance of an on-off keying（OOK） modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications.

Polar Codes for Soft Decode-and-Forward in HalfDuplex Relay Channels

Soft decode-and-forward(DF) can combine the advantages of both amplify-and-forward and hard DF in relay channels. In this paper, we propose a low-complexity soft DF scheme based on polar codes, which features two key techniques: a low-complexity cyclic redundancy check(CRC) aided list successive cancellation(CALSC) decoder and a soft information calculation method. At the relay node, a low-complexity CALSC decoder is designed to reduce the computational complexity by adjusting the list size according to the reliabilities of decoded bits. Based on the path probability metric of the CALSC decoder, we propose a method to compute the soft information of the decoded bits in CALSC. Simulation results show that our proposed scheme outperforms the soft DF based on low-density parity-check codes and the soft DF with belief propagation or soft cancellation decoder, especially in the case when the source-relay channel is at the high signal-to-ratio region.

Partition and the Perfect Codes in the Additive Channel

Many problems of discrete optimization are connected with partition of the n-dimensional space into certain subsets, and the requirements needed for these subsets can be geometrical—for instance, their sphericity—or they can be connected with?certain metrics—for instance, the requirement that subsets are Dirichlet’s regions with Hamming’s metrics [1]. Often partitions into some subsets are considered, on which a functional is optimized [2]. In the present work, the partitions of the n-dimensional space into subsets with “zero” limitation are considered. Such partitions allow us to construct the set of the group codes, V, and the set of the channels, A, between the arbitrary elements, V and A, having correcting relation between them. Descriptions of some classes of both perfect and imperfect codes in the additive channel are presented, too. A way of constructing of group codes correcting the errors in the additive channels is presented, and this method is a further generalization of Hamming’s method of code construction.

Dirichlet Regions and Perfect Codes in Additive Channel

In the present work, the class of metrics connected with subsets of the linear space on the field, GF(2), is considered and a number of facts are established, which allow us to express the correcting capacity of codes for the additive channel in terms of this metrics. It is also considered a partition of the metric space, Bn, by means of D-representable codes. The equivalence of D-representable and the perfect codes in the additive channel is proved.

A CODE DESIGN CRITERIA FOR NOT FULLY CONNECTED CHANNEL

There are parallel channels which are not fully connected in practice, such as Frequency Division Multiplex (FDM or Orthogonal FDM) systems. Conventional space-time codes can be used for such parallel channels but not the optimal. Based on the derivation of PEP expression for codes transmitted on parallel block fading channels, criteria of codes design for not fully connected channels are proposed and are compared with Tarokh's criteria for fully connected channel. New codes for such channels are provided by systematical and exhaustive search. Simulation results show that these codes offer better performance on parallel FDM channels than other known codes.

Channel Coding at Finite Blocklength and Its Application in 6G URLLC

To support mission-critical applications, such as factory automation and autonomous driving, the ultra-reliable low latency communications (URLLC) is adopted in the fifth generation (5G) mobile communications network, which requires high level of reliability and low latency. Naturally, URLLC in the future 6G is expected to have a better capability than its 5G version which poses an unprecedented challenge to us. Fortunately, the potential solution can still be found in the well-known classical Shannon information theory. Since the latency constraint can be represented equivalently by blocklength, channel coding at finite blocklength plays an important role in the theoretic analysis of URLLC. Applying these achievements in rapidly development of massive MIMO techniques gives rise to a new theory on space time exchanging. It tells us that channel coding can also be performed in space domain, since it is capable of providing the same coding rate as that in time domain. This space time exchanging theory points out an exciting and feasible direction for us to further reduce latency in 6G URLLC. .

Design of bilayer lengthened LDPC codes over expanded graph for relay channels

This paper presents a low complexity optimized algorithm for design of bilayer lengthened LDPC(BL-LDPC) code for decode-and-forward relay system.The design is performed over the expanded graph of the BL-LDPC code,which consists of the original bilayer graph and the extra added relaygenerated parity check bits.To build up our proposed optimized algorithm,we present a modified Gaussian approximation algorithm for the expanded structure of the BL-LDPC code.Then using the proposed optimized algorithm,we find the optimum overall expanded graph of the BL-LDPC code.Simulation results show that the BL-LDPC codes obtained by our proposed optimized algorithm have excellent bit-error-rate performances and small gaps between the convergence thresholds and the theoretical limits when transmitted over the additive white Gaussian noise channels.

A channel- and QoS-adaptive turbo coded modulation architecture for mobile multimedia communication

This paper proposed a cross-layer dual adaptive coded modulation architecture using turbo codes formobile multimedia communication,which simultaneously adapted to both the varying channel characteris-tics and the quality of service(QoS)of various mobile multimedia services to increase the average systemthroughput substantially.A pragmatic channel-adaptive turbo coded modulation scheme,which comeswithin 2.5dB of the Shannon limit,was optimally designed,and then a QoS-adaptive scheme was super-imposed to build the dual adaptive architecture.Simulation results show that the novel dual adaption re-duces the difference with the fading channel capacity to 2dB when assuming different services occur in e-qual probability and the service duration follows the exponential distribution.

Construction of New Codes from Given Ones in an Additive Channel

In the present work, a construction making possible creation of an additive channel of cardinality s and rank r for arbitrary integers s, r, n (r≤min (n,s-1)), as well as creation of a code correcting errors of the channel A is presented.

Integrated Joint Source-Channel Symbol-by-Symbol Decoding of Variable-Length Codes Using 3-D MAP Sequence Estimation

Most of multimedia schemes employ variable-length codes （VLCs） like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this paper is to salvage as many data from the damaged packets as possible for higher audiovisual quality. This paper proposes an integrated joint source-channel decoder （I-JSCD） at a symbol-level using three-dimensional （3-D） trellis representation for first-order Markov sources encoded with VLC source code and convolutional channel code. This method combines source code and channel code state-spaces and bit-lengths to construct a two-dimensional （2-D） state-space, and then develops a 3-D trellis and a maximum a-posterior （MAP） algorithm to estimate the source sequence symbol by symbol. Experiment results demonstrate that our method results in significant improvement in decoding performance, it can salvage at least half of （50%） data in any channel error rate, and can provide additional error resilience to VLC stream like image, audio, video stream over high error rate links.

Performance of Polar Codes for OFDM-Based UWB Channel

A multiuser Ultra Wide Band (UWB) channel suffers seriously from realistic impairments. Among this, multipath fading and interferences, such as Multiple Access Interference (MAI) and Inter Symbol Interference (ISI), that significantly degrade the system performance. In this paper, a polar coding technique, originally developed by Arikan, is suggested to enhance the BER performance of indoor UWB based Orthogonal Frequency Division Multiplexing (OFDM) communications. Moreover, Interleave Division Multiple Access (IDMA) scheme has been considered for multiuser detection depending on the turbo type Chip-By-Chip (CBC) iterative detection strategy. Three different models as Symmetric Alpha Stable (SαS), Laplace model and Gaussian Mixture Model (GMM), have been introduced for approximating the interferences which are more realistic for UWB system. The performance of the proposed Polar-coded IDMA OFDM-based UWB system is investigated under UWB channel models proposed by IEEE 802.15.3a working group and compared with Low Density Parity Check (LDPC)-coded IDMA OFDM-based UWB system in terms of BER performance and complexity under the studied noise models. Simulation results show that the complexity of the proposed polar-coded system is much lower than LDPC-coded system with minor performance degradation. Furthermore, the proposed polar-coded system is robust against noise and interferences in UWB indoor environment and gains a significant performance improvement by about 5 dB compared with un-coded IDMA-OFDM-UWB system under the studied noise models.

Joint channel estimation and symbol detection for space-time block code

The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.

APPLICATION OF TURBO CODES IN HIGH-SPEED REAL-TIME CHANNEL

The time delay of Turbo codes due to its iterative decoding is the main bottleneck of its application in real-time channel. However, the time delay can be greatly shortened through the adoption of parallel decod-ing algorithm, dividing the received bits into several sub-blocks and processing in parallel. This letter mainly discusses the applicability of turbo codes in high-speed real-time channel through the study of a parallel turbo decoding algorithm based on 3GPP-proposed turbo encoder and interleaver in various channel. Simulation re-sult shows that, by choosing an appropriate sub-block length, the time delay can be obviously shortened with-out degrading the performance and increasing hardware complexity, and furthermore indicates the applicability of Turbo codes in high-speed real-time channel.

自由空间光通信中极化码的应用研究

【目的】在自由空间光(FSO)通信中,大气湍流效应会导致通信链路性能下降。【方法】文章提出了一种极化码信道编译码方案,使用蒙特卡洛算法构造了针对FSO通信中常见的Gamma⁃Gamma分布大气湍流信道的极化码。比较了文章提出的极化码编译码方案与未编码以及相近码长的低密度奇偶校验(LDPC)码在Gamma⁃Gamma分布大气湍流信道下的误码率(BER)。【结果】仿真结果表明,所提极化码与未编码比较时,在弱湍流强度下,当信噪比>6.7 dB时,极化码方案性能相较于未编码更优;在中湍流强度下,当信噪比>10.3 dB时,极化码方案性能相较于未编码更优;在强湍流强度下,当信噪比>11.5 dB时,极化码方案性能相较于未编码更优。所提极化码与LDPC码比较时,在弱湍流情况下,当信噪比>7.1 dB时,极化码整体性能优于LDPC码;在中湍流条件下,当信噪比>10.6 dB时,极化码整体性能优于LDPC码;在强湍流条件下,当信噪比>12 dB时,极化码整体性能优于LDPC码。此外,在码长短、码率低和译码宽度小时,文章所提出的极化码编译码方案具有更优的性能。【结论】使用所提极化码编码后,有效改善了FSO通信系统中的大气湍流效应,而且在中、高湍流强度这两种恶劣的大气湍流信道环境中,文章所提方案展现出了比LDPC码更为明显的优势。表明在FSO通信中,极化码具有良好的发展前景。