For very large vocabulary vocal dictation systems, we present a decoding strategy useful to reduce the lexical decoding cost. For each test-utterance, a sub-lexicon is selected from a very large recognition vocabulary. Such a recognition sub-lexicon is called Dynamic Lexicon (DL). Various algorithms of DL selection are developed and tested in terms of coverage rate of textual corpus. From these...

This paper studies the performance of phase modulation through a fully saturated power amplifier and AWGN channel for broadband wireless systems. A nonlinear model for the fully saturated power amplifier is derived. The equivalent impulse response method is provided to analyze the SNR degradation. Both convolutional code and turbo code are used. The Viterbi decoding and the iterative decoding a...

Our study aims at bringing a software-based alternative for decoding Reed Solomon over the MPE-IFEC in the DVB-SH system, at the cost of a lower complexity and a good performance. The MPE-IFEC is operating in the Link layer, where the lost packets are considered as erasures. In this context, we propose to recover losses by decoding on a graph the binary image of the Reed Solomon code over a Bin...

Modeling overlapping phrases in an alignment model can improve alignment quality but comes with a high inference cost. For example, the model of DeNero and Klein (2010) uses an ITG constraint and beam-based Viterbi decoding for tractability, but is still slow. We first show that their model can be approximated using structured belief propagation, with a gain in alignment quality stemming from t...

Neural Machine Translation (NMT) lays intensive burden on computation and memory cost. It is a challenge to deploy NMT models on the devices with limited computation and memory budgets. This paper presents a four stage pipeline to compress model and speed up the decoding for NMT. Our method first introduces a compact architecture based on convolutional encoder and weight shared embeddings. Then...

In this paper, a multi-antenna assisted full-duplex (FD) relaying scheme with reliability-aware iterative decoding at the destination node is proposed to improve system spectral efficiency and reliability. This scheme allows the multi-antenna based FD relay node cancel the self-interference with QR-decomposition and forward its decoded signal to the destination node regardless the decoding erro...

In view of the low efficiency and poor coding performance, an active mechanism network coding algorithm based on multi-channel sensing is proposed. The algorithm first establishes a system model to analyze the work pattern of network coding, then selects the minimum sample as cost function and adopts the multi-channel sensing to examine the coding effect of relay node, which makes the network t...

Hierarchical phrase-based (Hiero) models have richer expressiveness than phrase-based models and have shown promising translation quality gains for many language pairs whose syntactic divergences, such as reordering, could be better captured. However, their expressiveness comes at a high computational cost in decoding, which is induced by huge dynamic programs associated with language model int...

We studied power splitting-based simultaneous wireless information and transfer (PS-SWIPT) in multiple access channels (MACs), considering the decoding cost non-linear energy harvesting (EH) constraints at receiving nodes to study practical limitations of an EH communication system. Under these restrictions, we formulated analyzed achievable rate maximum departure regions two well-studied scena...

We consider the problem of coding labeled trees by means of strings of node labels. Different codes have been introduced in the literature by Prüfer, Neville, and Deo and Micikevičius. For all of them, we show that both coding and decoding can be reduced to integer (radix) sorting, closing several open problems within a unified framework that can be applied both in a sequential and in a paralle...