Applying a joint code and decoder design methodology, we develop a high-speed (3, k)-regular LDPC code partly parallel decoder architecture, based on which a 9216-bit, rate1/2 (3, 6)-regular LDPC code decoder is implemented on Xilinx FPGA device. When performing maximum 18 iterations for each code block decoding, this partly parallel decoder supports a maximum symbol throughput of 54 Mbps and a...

In the context of Distributed Joint Source-Channel coding (DJSC), we conceive reduced-complexity Turbo Trellis Coded Modulation (TTCM)-aided syndrome-based block decoding for estimating the crossover probability pe of the Binary Symmetric Channel (BSC), which models the correlation between a pair of sources. Our joint decoder achieves an accurate correlation estimation for varying correlation c...

In this paper, we present a characterization, through its convergence analysis, and an optimisation of a joint source-channel receiver composed of a LDPC decoder and a Soft Input Soft Output (SISO) source decoder. Under Gaussian approximation, assuming the knowledge of the extrinsic mutual information transfer function (EXIT chart) of the source decoder, we derive the Mutual Information evoluti...

As tokenization is usually ambiguous for many natural languages such as Chinese and Korean, tokenization errors might potentially introduce translation mistakes for translation systems that rely on 1-best tokenizations. While using lattices to offer more alternatives to translation systems have elegantly alleviated this problem, we take a further step to tokenize and translate jointly. Taking a...

This paper is about exact error exponents for the two-user interference channel under the random coding regime. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, heuristic decoding rules that have bee...

This study presents a dual channel decoder capable of modeling cross-speaker dependencies for segmentation and classification of fillers and feedbacks in conversational speech found in the DEAL corpus. For the same number of Gaussians per state, we have shown improvement in terms of average F-score for the successive addition of 1) increased frame rate from 10 ms to 50 ms 2) Joint Maximum Cross...

We describe techniques for joint source-channel coding of hidden Markov sources using a modiied turbo decoding algorithm. This avoids the need to perform any explicit source coding prior to transmission, and instead allows the decoder to utilize the a priori structure due to the hidden Markov source. In addition, we present methods that allow the decoder to estimate the parameters of the Markov...

This paper proposes an optimal joint source-channel, maximum a posteriori, decoder for entropy coded Markov sources transmitted over noisy channels. We introduce the concept of incomplete and complete states to deal with the problem of variable length source codes in the decoder. The proposed decoder is sequential, there by making the expected delay finite. When compared to the standard Huffman...

Current SMT systems usually decode with single translation models and cannot benefit from the strengths of other models in decoding phase. We instead propose joint decoding, a method that combines multiple translation models in one decoder. Our joint decoder draws connections among multiple models by integrating the translation hypergraphs they produce individually. Therefore, one model can sha...

This paper is about exact error exponents for the two-user interference channel under the random coding regime. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, heuristic decoding rules that have bee...