We demonstrate that an attention-based encoder-decoder model can be used for sentence-level grammatical error identification for the Automated Evaluation of Scientific Writing (AESW) Shared Task 2016. The attention-based encoder-decoder models can be used for the generation of corrections, in addition to error identification, which is of interest for certain end-user applications. We show that ...

AVS video decoder consumes a huge number of computation, so real-time implementation of an AVS decoder has some challenging on x86 computing platform. This article describes a xAVS open source project to solve this problem. First of all, the reason for the low efficiency of the code of the existing AVS video decoder open source reference software RM52J_r1 is analyzed according to the descriptio...

We present an estimator-based, or soft, vector quantizer decoder for communication over a noisy channel. The decoder is optimal according to the mean-square error criterion, and Hadamard-based in the sense that a Hadamard transform representation of the vector quantizer is utilized in the implementation of the decoder. An eecient algorithm for optimal decoding is derived. We furthermore investi...

Recently, low-density parity-check (LDPC) codes have attracted much attention because of their excellent errorcorrecting performance and highly parallelizable decoding scheme. However, the effective VLSI implementation of an LDPC decoder remains a big challenge and is a crucial issue in determining how well we can exploit the benefits of the LDPC codes in the real applications. In this paper, f...

Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder bases its decision only on the compressed codewords and the channel output, which is in turn, the channel’s response to the transmission of an original codewor...

In this paper, we describe the new BBN BYBLOS efcient 2-Pass N-Best decoder used for the 1996 Hub-4 Benchmark Tests. The decoder uses a quick fastmatch to determine the likely word endings. Then in the second pass, it performs a time-synchronous beam search using a detailed continuous-density HMM and a trigram language model to decide the word starting positions. From these word starts, the dec...

The work demonstrates about the reversible logic synthesis for the 2 to 4 decoder, the circuits are designed using reversible fault tolerant toffoli gates. Thus the entire scheme inherently becomes fault tolerant. In addition, several lower bounds on the number of constant inputs, garbage outputs and quantum cost of the reversible fault tolerant decoder have been proposed. Transistor simulation...

--Performance degradation is an major problem in a relay based Decode-and-Forward (DF) receiving cooperative system. In the DF protocol , existing decoder performances have high decoding complexity, because destination require exact knowledge of the sourcerelay link along with the channel coefficient of source-destination and relay –destination links. In the proposed method, degradation can be ...

In this paper, we present a two-pass continuous digit string decoder using two sets of whole-word HMM models. One set contains context-independent (CI) models used in the first-pass search. The first-pass search results in N-best hypotheses from which a N-best word lattice can be derived. The other set contains context-dependent (CD) HMM models used to search along the N-best word lattice for t...

An insight on the lattice decoder for flat-fading multiple antenna wireless communications systems is presented in this paper. In particular, we show that by formulating the decoding problem as a bounded-error subset selection, the resultant decoder finds the nearest lattice point to the received signal vector such that the search is bounded inside a hypercube centered at the received vector. T...