The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
From a subset of the n-dimensional integer lattice, we independently pick two points uniformly at random. A sumset is formed by adding these two points component-wise and a sumset is called typical, if the sum falls inside this set with high probability. In this note we characterize the asymptotic size of the typical sumsets for large n, and show that the typical sumset size exhibits different behaviors...
In this work, we propose a new framework called sequential reduction (SR) for reducing lattice bases, which harnesses the approximate closest vector problem (εCVP) oracles to sequentially reduce each basis vector. With the best εCVP oracle to serve as the theoretical upper limit of this scheme, our bound on basis lengths can be better than that of Minkowski's reduction under a mild assumption. A practical...
Block diagonalization (BD) is a famous conditional precoding algorithm in multi-input multi-output (MIMO) broadcast systems, vector perturbation (VP) and BD are combined which named as BD-VP for short and the receivers' complexity can be reduced by VP at the transmmiter. Furthermore, the performance of BD-VP in diversity is comparable because the maximum likehood (ML) method is involved. However,...
Explicit construction of polar codes for the Gray-Wyner network is studied. We show that Wyner's common information plays an essential role in constructing polar codes for both lossless and lossy Gray-Wyner problems. For discrete sources, extracting Wyner's common randomness can be viewed as a lossy compression problem, which is accomplished by extending polar coding from a single source to a pair...
More and more linguistic information has been employed to improve the performance of machine translation, such as part of speech, syntactic structures, discourse contexts, and so on. However, conventional approaches typically ignore the key information beyond the text such as prosody. In this paper, we exploit and employ three prosodic features: pronunciation (phonetic alphabet and tone), prosodic...
Speech segmentation is important in automatic speech recognition (ASR) and machine translation (MT). Particularly in N-best list rescoring processing, generalizing N-best lists consisting of as many as candidates from a decoding lattice requires proper utterance segmentation. In lecture speech recognition, only long audio recordings are provided without any utterance segmentation information. In addition,...
A new Goldreich-Goldwasser-Halevi (GGH) cryptosystem is proposed using Generalized Low Density (GLD) lattices. These low density lattices can alleviate a major drawback of the GGH scheme, namely the huge size of its public key. Indeed, we show that the new GGH that we propose in this paper reduces the key size by one order of magnitude. In addition, we show that the key generation complexity as well...
Two methods are presented to improve word confidence scores for Line-Level Query-by-String Lexicon-Free Keyword Spotting (KWS) in handwritten text images. The first one approaches true relevance probabilities by means of computations directly carried out on character lattices obtained from the lines images considered. The second method uses the same character lattices, but it obtains relevance scores...
For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bounds on the mutual information and error probability when using coset coding on a Rayleigh fading channel were recently established by Oggier and Belfiore, and the results in this paper build on their work. However, instead...
We study the transmission over a cloud radio access network in which multiple relays are connected to a central processor (CP) via error-free finite-capacity links. We develop a lattice-based coding scheme in which each relay node computes a linear combination of the users' messages, in the spirit of standard compute-and-forward (CoF). However, rather than forwarding the computed equation to the CP...
We propose a new method for low-complexity compression of multispectral images based on universal vector quantization. Our approach generalizes the recently developed theory of universal scalar quantization to vector quantization, and uses it in the context of distributed coding. We exploit the availability of side information on the decoder to reduce the encoding rate of a vector quantizer, applied...
In this paper we present a computationally efficient implementation of the sphere decoder, which is employed to solve the integer least-squares (ILS) problem underlying direct model predictive control (MPC) for power electronic applications. The introduced modifications take advantage of the structure of the problem and, as a result, the required real-time operations can be reduced to a minimum. The...
A design method of a multiple description vector quantizer (VQ) is proposed. VQ is widely used for data compression, transmission and other processing. Here, we assume transmission channels with data erasure such as a packet-based network. Multiple description coding is a coding method used to achieve “graceful degradation” when transmitting signals through lossy channels. The proposed method is inspired...
The compute-and-forward scheme for wireless relay networks can achieve higher transmission rates than other existing relaying schemes, such as decode-and-forward. The compute-and-forward (CF) design involves finding an integer-valued coefficient vector at each relay so that the set of coefficient vectors form a full rank matrix allowing the destination to perform decoding. The CF design problem is...
Physical layer network coding (PNC) with channel coding is a strategy that applies error correction at the relay nodes of a relay system to improve data communication reliability of the whole relay system. So far, channel coded PNC schemes have been studied for two-way relay systems, but have not been systematically proposed for general multiple-way relay systems. In this paper, joint channel coding...
Due to their linear and highly symmetrical structure, lattices are becoming of a great interest as potential transmission schemes. Lattice codes suggest a common view of channel and source coding and new tools for the analysis of information network problems. Several constructions have been proposed to build these lattices, some of which are based on multi-level coding and multistage decoding such...
1 In this paper we review the previously proposed methods for successive compute-and-forward and discuss about their incompleteness through some examples. Then we present a comprehensive formulation for multi-step successive interference cancellation problem through the asymmetric successive compute-and-forward strategy. It is shown that the generalized formulation includes the previous approaches.
We study the transmission over a cloud radio access network in which multiple base stations (BS) are connected to a central processor (CP) via finite-capacity backhaul links. We propose a lattice-based coding scheme in which the BSs decode linear combinations of the transmitted messages, in the spirit of Compute-and-Forward (CoF), but differs from it essentially in that the decoded equations are remapped...
In this paper, we propose a multilevel lattice construction, employing binary Reed-Muller codes, for the Rayleigh block fading channel. The construction is performed on a binary two-dimensional lattice partition chain, and Reed-Muller codes are chosen according to capacity rule. The lattice construction based on number-theoretical concepts is explained, and the system's performance is shown for various...
Recently, the idea of regularization received a lot of interest in signal processing with ill-conditioned problems. In this paper, instead of using the traditional sphere decoding (LSD) technique, regularized LSD detection techniques have been used for block data transmission systems (BDTS). The first regularization scheme that has been used is Tikhonov regularization (L2-regularization) which is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.