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.
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...
Many duty cycling MAC protocols exploit preamble sampling technique to improve the energy efficiency. In this technique, all the devices periodically listen to the medium for a short duration and then go back to sleep if medium is found idle. When a device wants to send data it transmits a long preamble followed by data bits. When the receiver wakes up and detects the preamble it stays awake until...
Since the pioneering research work of Ahlswede et al. in 2000, Network Coding (NC) has rapidly emerged as a major research area in electrical engineering and computer science due to its wide applicability to communication through real networks. The many contributions available in the literature to date, ranging from pure theoretical studies on fundamental limits to practical experimentations in real-world...
In this paper, we investigate the performance and the design of Joint Source-Channel Decoding (JSCD) schemes involving structured Low-Density Parity-Check (LDPC) codes such as protograph based codes. We first present the asymptotic analysis of such iterative receivers based on multi-dimensional EXIT charts. Since a protograph can be interpreted as different encoding schemes, the information mapping...
In this paper, we define and address a new problem that arises when a base station in a broadband wireless network wishes to multicast information to a large group of nodes and to guarantee some level of reliability using Application-layer forward error correction (FEC) codes. Every data block to be multicast is translated into a sequence of packets, from which every receiver must receive at least...
In this paper design of multiplier-less nonuniform filterbank transmultiplexer (ML NUFB TMUX) is presented. Nonuniform filter bank transmultiplexer (NUFB TMUX) is preferred when applications with different data rates are to be multiplexed. If filter coefficients can be represented in canonic signed digit (CSD) format with minimum number of signed power of two (SPT) terms, hardware complexity can be...
Underwater wireless sensor networks (UWSNs) are prone to message loss due to their poor link condition with high bit error rate (BER). Retransmission-based mechanisms such as ARQ can be used for the reliability, however, they are not suitable for UWSNs due to the inherent long propagation delay of UWSNs. Therefore, a forward error correction (FEC) mechanism might be an alternative in order to guarantee...
Multicast transmission enables a sender to distribute data to multiple intended receivers simultaneously. However, the multicast transmission should be reliable in erasure channel. Forward Error Correction (FEC) enables the lost packets to be recovered from some extra redundant packets without any retransmission. In this paper, we propose a new FEC codes, called Polynomial Interpolation codes (PI...
The continuous-time, peak-limited, infinite-bandwidth Poisson channel with spurious counts is considered. It is shown that if the times at which the spurious counts occur are known noncausally to the transmitter but not to the receiver, then the capacity is equal to that of the Poisson channel with no spurious counts. Knowing the times at which the spurious counts occur only causally at the transmitter...
We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different channel conditions, but also because they demand different amounts of information and have different decoding capabilities. The LT encoding scheme is employed. While some users accept output symbols of all degrees and decode...
This paper presents an achievable rate region for a 2-user Gaussian Z-interference channel with a noiseless and bidirectional digital communication link between the receivers. The region is achieved by utilizing the rate-splitting encoding technique, and the decode-and-forward and compress-and-forward strategies. In the very strong interference regime, the capacity region is achieved. In the weak...
In this paper, we consider the problem of functional compression for an arbitrary tree network. Suppose we have k possibly correlated source processes in a tree network, and a receiver in its root wishes to compute a deterministic function of these processes. Other nodes of this tree (called intermediate nodes) are allowed to perform some computations to satisfy the node's demand. Our objective is...
The capacity of the symbol-asynchronous single-relay channel is investigated. Symbol asynchronism implies that the codewords transmitted from the relay and the source do not coincide in time at the destination. Due to propagation or implementation effects (e.g. mis-synchronized clocks), symbol asynchronism occurs in many practical situations. In ad hoc scenarios, such as sensor networks, achieving...
We study random linear network coding for time-division duplexing channels for sharing information between nodes. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. Each node will act as both a sender of its own information and a receiver for the information of the other nodes. When a node acts as the sender, it transmits coded data packets back-to-back...
The capacity region for a state dependent degraded broadcast channel is derived. We study the case with noncausal channel state information (CSI) at the transmitter but no receiver CSI. For this model inner and outer bounds for the capacity region were known. We prove the achievability by introducing a new random coding scheme called the enhanced common randomness superposition coding. In this scheme,...
We propose a simple method for downlink communications based on second order Reed-Muller sequences which generalize the Walsh sequences that are used in orthogonal CDMA. In our approach, coding occurs at the chip level (i.e. we use a spreading factor of 1) and different users are not orthogonalized. Our decoding algorithm is borrowed from work on fast reconstruction of signals for compressed-sensing...
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two relay nodes serve as intermediaries between the transmitters and receivers. Each hop, one from the transmitters to the relays and the other from the relays to the receivers,...
In this work we analyze the average queue backlog at a source node serving a single multicast flow consisting of M destination nodes. In the model we consider, the channel between the source node and each receiver is an independent identically distributed packet erasure channel. We first develop a lower bound on the average queue backlog achievable by any transmission strategy; our bound indicates...
In this paper we study transmission of information over a multiple access channel (MAC) with noiseless feedback. We formulate this problem as a decentralized stochastic control problem, the three controllers being the decoder and the two encoders who, in the presence of limited information about each other, decide what to transmit at each time instance, in order to jointly achieve a common goal. Our...
We study the capacity of a class of deterministic discrete memoryless interference channels. Recent studies show that, in general, interference alignment is required to achieve capacity in interference channels. While interference alignment in general needs structured coding, we identify two scenarios where random coding achieves capacity and leads to single-letter capacity characterizations in deterministic...
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.