We propose quasi ordered statistic decoding (quasiOSD) of binary image of Reed-Solomon (RS) codes and explore the application of RS codes to joint source-channel coding (JSCC). Unlike the conventional OSD algorithms t...
详细信息
ISBN:
(纸本)9798350382853;9798350382846
We propose quasi ordered statistic decoding (quasiOSD) of binary image of Reed-Solomon (RS) codes and explore the application of RS codes to joint source-channel coding (JSCC). Unlike the conventional OSD algorithms that use Gaussian elimination to obtain the systematic matrix, the proposed quasi-OSD algorithm utilizes the parallel Lagrange interpolation at the symbol level, which achieves a lower complexity and comparable performance compared with the locally constrained OSD (LC-OSD), for high-rate RS codes in the high signal-to-noise ratio (SNR) region. Additionally, we apply RS codes to the JSCC with known source statistics. At the transmitter, a new partition criterion is introduced in the classified enumerative (CE) coding to encode the source information. Then the multiple-rate RS coding transforms the variable-length codeword of the CE coding into a fixed-length transmitted codeword. At the receiver, parallel decoding is performed to recover the source. Simulation results demonstrate that the proposed JSCC scheme outperforms the double polar JSCC scheme by one dB, as expected by Gallager's JSCC bound.
A constant-rate encoder-decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the ...
详细信息
ISBN:
(纸本)1424405041
A constant-rate encoder-decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the 2-D constraint is turned into a set of independent and relatively simple one-dimensional (1-D) constraints;this is done by dividing the array into fixed-width vertical strips. Each row in the strip is seen as a symbol, and a graph presentation of the respective I-D constraint is constructed. The maxentropic stationary Markov chain on this graph is next considered: a perturbed version of the corresponding probability distribution on the edges of the graph is used in order to build an encoder which operates in parallel on the strips. This perturbation is found by means of a network flow, with upper and lower bounds on the flow through the edges. A key part of the encoder is an enumerative coder for constant-weight binary words. A fast realization of this coder is shown, using floating-point arithmetic.
In this paper, we propose a new joint source-channel coding (JSCC) scheme, especially in conjunction with overlay spread spectrum transmission. At the transmitter, a source sequence is redescribed by classified enumer...
详细信息
Benefiting from its shaping gain and flexible information rates, probabilistic shaping (PS) is on track to become a popular coded modulation standard in optical communication systems. Though producing amplitude sequen...
详细信息
In this paper, we propose a new joint source-channel coding (JSCC) for short blocklength sources. The proposed JSCC scheme is universal in the sense that it does not require the knowledge of source statistics. At the ...
详细信息
暂无评论