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.

Construction of Multi-level Space-filling Designs via Code Mappings

Space-filling designs are widely used in various fields because of their nice space-filling properties.Uniform designs are one of space-filling designs,which desires the experimental points to scatter uniformly over the experimental area.For practical need,the construction and their properties of nine-level uniform designs are discussed via two code mappings in this paper.Firstly,the algorithm of constructing nine-level uniform designs is presented from an initial three-level design by the Type-I code mapping and tripling technique.Secondly,the algorithm of constructing nine-level uniform designs is presented from a three-level base design by the Type-II code mapping and generalized orthogonal arrays.Moreover,relative properties are discussed based on the two code mappings.Finally,some numerical examples are given out for supporting our theoretical results.

A novel bit mapping scheme for high-order polar coded modulation systems

In order to improve the spectrum efficiency of the high-order polar coded modulation systems, the polar code is used as the component code of the bit-interleave coded modulation(BICM) system, a novel bit mapping scheme is proposed considering of the channel polarization and successive cancellation(SC) decoding principle of polar codes as well as the unequal protection of equivalent channels by modulator. In this scheme, the frozen bits on the unreliable split channel are allocated to the equivalent channel with the low protection of the modulator, while the equivalent channels with the high protection are used to transmit the information bits. Thus, the error-correcting performance of polar codes is improved. Compared with some bit mapping schemes, the proposed bit mapping scheme only needs to divide and choose the parameters of the split channels reliability measurement, the complexity does not increase obviously, and simulation results show that the proposed scheme has the better performance under the quadrature amplitude modulation(QAM) modulation based on the Gray mapping.

RCDS:a right-confirmable data-sharing model based on symbol mapping coding and blockchain

The problem of data right confirmation is a long-term bottleneck in data sharing.Existing methods for confirming data rights lack credibility owing to poor supervision,and work only with specific data types because of their technical limitations.The emergence of blockchain is followed by some new data-sharing models that may provide improved data security.However,few of these models perform well enough in confirming data rights because the data access could not be fully under the control of the blockchain facility.In view of this,we propose a right-confirmable data-sharing model named RCDS that features symbol mapping coding(SMC)and blockchain.With SMC,each party encodes its digital identity into the byte sequence of the shared data by generating a unique symbol mapping table,whereby declaration of data rights can be content-independent for any type and any volume of data.With blockchain,all data-sharing participants jointly supervise the delivery and the access to shared data,so that granting of data rights can be openly verified.The evaluation results show that RCDS is effective and practical in data-sharing applications that are conscientious about data right confirmation.