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 pape...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.展开更多
A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of ou...A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of our decoding algorithm is that source a priori information with the form of bit transition probabilities corresponding to the VLC tree can be derived directly from sub-state transitions in new composite-state represented super-trellis. A Maximum Likelihood (ML) decoding algorithm for VLC sequence estimations based on the proposed super-trellis is also described. Simu-lation results show that the new iterative decoding scheme can obtain obvious encoding gain especially for Reversible Variable Length Codes (RVLCs),when compared with the classical separated turbo decoding and the previous joint decoding not considering source statistical characteristics.展开更多
A novel Variable-Length Code (VLC), called Alternate VLC (AVLC), is proposed in this letter, which employs two types of VLC to encode source symbols alternately. Its advantage is that it can not only stop the symbol e...A novel Variable-Length Code (VLC), called Alternate VLC (AVLC), is proposed in this letter, which employs two types of VLC to encode source symbols alternately. Its advantage is that it can not only stop the symbol error propagation effect, but also correct symbol insertion errors and avoid symbol deletion er-rors, so the original sequence number of symbols can be kept correctly, which is very important in video com-munication.展开更多
Sparse code multiple access(SCMA)is a non-orthogonal multiple access(NOMA)scheme based on joint modulation and spread spectrum coding.It is ideal for future communication networks with a massive number of nodes due to...Sparse code multiple access(SCMA)is a non-orthogonal multiple access(NOMA)scheme based on joint modulation and spread spectrum coding.It is ideal for future communication networks with a massive number of nodes due to its ability to handle user overload.Introducing SCMA into visible light communication(VLC)systems can improve the data transmission capability of the system.However,designing a suitable codebook becomes a challenging problem when addressing the demands of massive connectivity scenarios.Therefore,this paper proposes a low-complexity design method for high-overload codebooks based on the minimum bit error rate(BER)criterion.Firstly,this paper constructs a new codebook with parameters based on the symmetric mother codebook structure by allocating the codeword power so that the power of each user codebook is unbalanced;then,the BER performance in the visible light communication system is optimized to obtain specific parameters;finally,the successive interference cancellation(SIC)detection algorithm is used at the receiver side.Simulation results show that the method proposed in this paper can converge quickly by utilizing a relatively small number of detection iterations.This can simultaneously reduce the complexity of design and detection,outperforming existing design methods for massive SCMA codebooks.展开更多
In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results fr...In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).展开更多
基金Supported by the Foundation of Ministry of Education of China (211CERS10)
文摘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.
基金Supported by the National Natural Science Foundation of China (No.90304003, No.60573112, No.60272056)the Foundation Project of China (No.A1320061262).
文摘A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of our decoding algorithm is that source a priori information with the form of bit transition probabilities corresponding to the VLC tree can be derived directly from sub-state transitions in new composite-state represented super-trellis. A Maximum Likelihood (ML) decoding algorithm for VLC sequence estimations based on the proposed super-trellis is also described. Simu-lation results show that the new iterative decoding scheme can obtain obvious encoding gain especially for Reversible Variable Length Codes (RVLCs),when compared with the classical separated turbo decoding and the previous joint decoding not considering source statistical characteristics.
文摘A novel Variable-Length Code (VLC), called Alternate VLC (AVLC), is proposed in this letter, which employs two types of VLC to encode source symbols alternately. Its advantage is that it can not only stop the symbol error propagation effect, but also correct symbol insertion errors and avoid symbol deletion er-rors, so the original sequence number of symbols can be kept correctly, which is very important in video com-munication.
基金supported in part by the National Science Foundation of China(NSFC)under Grant 62161024Jiangxi Provincial Natural Science Foundation under Grant 20224BAB212002+3 种基金Jiangxi Provincial Talent Project for Academic and Technical Leaders of Major Disciplines under Grant 20232BCJ23085,China Postdoctoral Science Foundation under Grant 2021TQ0136 and 2022M711463the State Key Laboratory of Computer Architecture(ICT,CAS)Open Project under Grant CARCHB202019supported in part by the National Natural Science Foundation of China(NSFC)under Grant 62061030supported in part by the National Natural Science Foundation of China(NSFC)under Grant 62161023。
文摘Sparse code multiple access(SCMA)is a non-orthogonal multiple access(NOMA)scheme based on joint modulation and spread spectrum coding.It is ideal for future communication networks with a massive number of nodes due to its ability to handle user overload.Introducing SCMA into visible light communication(VLC)systems can improve the data transmission capability of the system.However,designing a suitable codebook becomes a challenging problem when addressing the demands of massive connectivity scenarios.Therefore,this paper proposes a low-complexity design method for high-overload codebooks based on the minimum bit error rate(BER)criterion.Firstly,this paper constructs a new codebook with parameters based on the symmetric mother codebook structure by allocating the codeword power so that the power of each user codebook is unbalanced;then,the BER performance in the visible light communication system is optimized to obtain specific parameters;finally,the successive interference cancellation(SIC)detection algorithm is used at the receiver side.Simulation results show that the method proposed in this paper can converge quickly by utilizing a relatively small number of detection iterations.This can simultaneously reduce the complexity of design and detection,outperforming existing design methods for massive SCMA codebooks.
文摘In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).
