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.
Due to the broadcast nature of wireless channels, the two-way system can be eavesdropped on when a confidential message is transmitted, which is one of the motivations of this paper. While most of existing work focuses on the discussion of secrecy rate with information theoretical approach, this paper discusses the probability of successful detection for the system experiencing exponential path loss...
This paper proposes an adaptive solution of temporal scalable decoding process with frame rate conversion method for surveillance video. It realizes the adaptive skipping scheme in the temporal scalable decoding process based on the content of the pictures. By analyzing the relationship between motion vector energy and the video quality loss of the same frame in probability, chooses the suitable form...
The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be...
Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final answer. Various methods have been developed to aggregate binary classifiers, including voting heuristics, loss-based decoding, and probabilistic decoding methods, but a little work on the optimal aggregation has been done....
Soft Input Decryption has been introduced earlier as a method for detection and correction of bit errors over erroneous channels. It uses the cryptographic checksums for the correction of channel errors using the additional soft information available from the channel decoders, such as MAP. However there is a probability of collisions associated with the cryptographic hash codes. As a result of the...
Proper name transliteration, the pronunciation based translation of a proper name, is important to many multilingual natural language processing task, such as Statistical Machine Translation (SMT) and Cross Lingual Information Retrieval (CLIR). This task is extremely challenging due to the pronunciation difference between the source and target language. A given proper name can lead to many different...
As the number of cores in a processor increases, asymmetrically distributed memory architecture is expected to become widely adopted. Running an application program effectively in a distributed fashion on asymmetric memory architecture is a challenging task. In this paper, we propose a novel load balancing technique for multi-core systems with asymmetric memory architectures. The proposed method uses...
We propose the use of an MDS (Maximum Distance Separable) code at the link-level of cooperative multi-hop relay networks and evaluate the outage probability. A codeword of the MDS code is partitioned into several blocks. Upon receiving one or more codeword blocks of the MDS code, each relay node aggregates the blocks, corrects channel errors with the punctured MDS code, encodes the message by the...
A new cooperative access protocol is presented in the context of IEEE 802.11-based fixed ad hoc networks. The protocol achieves optimal diversity-multiplexing tradeoff thanks to two known functionalities: on-demand cooperation and selection of the best relay. The on-demand approach allows maximization of the spatial multiplexing gain. The selection of the best relay allows maximization of the spatial...
We study the layered transmission of a Gaussian source over multiple relays using superposition coding. First, we analyze the outage probability and performance in terms of average throughput and distortion for decode-and-forward protocols with single layer and superposed two-layer coding. For the superposition coding approach, we consider different power allocations to the base and enhancement layers...
In this work, we focus on the use of network coding in a wireless sensor network where data is already encoded at the source node with fountain codes, in particular LT or Raptor codes. These codes have a specific degree distribution to follow in order to obtain an efficient decoding process. However, adding a layer of network coding on such packets triggers a distorsion of the degree distribution...
This paper focuses on recent research on unequal error protection random linear coding (UEP RLC) for applications in network coded (NC) multimedia communications. We define a class of UEP RLC called expanding window random linear coding (EW-RLC) and provide exact decoding probability analysis for different importance classes of the source data assuming the Gaussian Elimination (GE) decoder applied...
Low-density parity-check (LDPC) codes are playing more and more important roles in wireless communications due to their excellent error correction performance. In this paper, we study the combination of non-binary LDPC codes with M-ary orthogonal spread spectrum modulation for bandwidth efficient transmission over AWGN channel. Specifically, we investigate an algorithm for computing symbol soft metric...
We propose the notion of secrecy gain as a code design criterion for wiretap lattice codes to be used over an additive white Gaussian noise channel. Our analysis relies on the error probabilites of both the legitimate user and the eavesdropper. We focus on geometrical properties of lattices, described by their theta series, to characterize good wiretap codes.
This paper presents the outage analysis of multiple-input multiple-output (MIMO) block-fading channels with nearest neighbour decoding and mismatched channel state information at the receiver (CSIR). Based on mismatched decoding arguments, we demonstrate the achievability of the generalised outage probability, the probability that the generalised mutual information (GMI) is less than the target data...
We introduce a source that emits symbols at infinitesimal time slots. The source may emit no symbol at a slot. The outputs from the source are encoded on the real-time basis. We derive the minimum loss probability and reveal a connection to the continuous model. Moreover, we define the utilization factor of the channel and show that it coincides with the loss probability for any code. We consider...
In this paper, we propose a novel protocol for cooperative diversity based on decode-and-forward (DF) with iterative detection and decoding (IDD) receiver. Closed-form expression of outage probability is derived under quasi-static fading channels. Numerical results show that the proposed scheme achieves higher diversity order than traditional DF scheme without additional transmitter power.
We propose a new framework for MIMO decoding based on a recently developed technique for reliably conveying linear equations over wireless channels. Each transmit antenna sends an independent data stream using the same linear code. As a result, any integer combination of the codewords is itself a codeword. Each receive antenna observes a random complex-valued combination of the codewords according...
In this paper, we evaluate a multilevel coding (MLC) scheme with multi-stage decoding (MSD) designed for satellite broadcasting communications, where services with different quality of service (QoS) are desirable. A simple Land-Mobile-Satellite (LMS) channel model is presented, based on channel states and their transitions. The instantaneous channel capacity for suburban and forest scenarios is calculated...
The exact expressions for symbol error probability and outage probability of randomized distributed space-time codes (RDSTC) under Rayleigh fading are derived. The diversity gain derived in the literature uses the Chernoff bound which may not be achievable in general. Utilizing the exact expression, the achievable diversity gain of RDSTCs is validated. The analytical expressions are verified by Monte-Carlo...
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.