This paper presents an approach to vector quantization of sources exhibiting intervector dependency. We present the optimal decoder based on a collection of received indices. We also present the optimal encoder for such decoding. The optimal decoder can be implemented as a table look-up decoder, however the size of the decoder codebook grows very fast with the size of the collection of utilized...

in recent years, space syntax theory has been used for analyzing spatial configurations; these analyses mostly focus on social aspects. according to the space syntax theory, space arrangements affect the space usage in buildings. this paper aims at studying spatial configurations of some traditional houses in iran in terms of flexibility factor. besides of having the housing function and provid...

We describe a scalable decoder for parsing-based machine translation. e decoder is written in Java and implements all the essential algorithms described in (Chiang, 2007) and (Li and Khudanpur, 2008b): chart-parsing, n-gram language model integration, beamand cube-pruning, and k-best extraction. Additionally, parallel and distributed computing techniques are exploited to make it scalable. We d...

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...

A frame synchronization scheme based on decoder soft outputs of low-density parity-check codes over high frequency channels is considered. In a coded orthogonal frequency division multiplexing based system, low-density parity-check code decoder soft outputs are exploited in order to perform frame synchronization. The decoder soft outputs are observed for several candidate frame start positions ...

A versatile Reed-Solomon (RS) decoder structure is developed based on the time-domain decoding algorithm (transform decoding without transforms). In this paper, the algorithm is restructured and a method is given to decode any RS code generated by any generator polynomial. The main advantage of the introduced decoder structure is the versatility. By versatile decoder we mean a decoder that can ...

In previous papers we have considered fast-frequency hopping frequency shift keying. We have proposed a decoder with low error rate in channels with low signal to interference ratio. This decoder uses the Kolmogorov-Smirnov criterion statistics to differentiate transmitted codeword from others. In this paper we consider different goodness-of-fit criterion to improve the decoder error rate. We h...

Silicon-based polarization-encoding quantum key distribution (QKD) has been widely studied, owing to its low cost and robustness. However, prior studies have utilized off-chip devices demodulate the states or perform polarization compensation, given difficulty of fabricating polarized independent components on chip. In this paper we propose a fully chip-based decoder for QKD. The chip realizes ...

In todays era huge volume of information exists everywhere. Therefore, it is very crucial to evaluate that and extract useful, often summarized, out so may be used for relevant purposes. This extraction can achieved through a technique artificial intelligence, namely, machine learning. Indeed automatic text summarization has emerged as an important application learning in processing. this paper...

We identify problems with the Penn Treebank that render it imperfect for syntaxbased machine translation and propose methods of relabeling the syntax trees to improve translation quality. We develop a system incorporating a handful of relabeling strategies that yields a statistically significant improvement of 2.3 BLEU points over a baseline syntax-based system.