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 addresses the problem of single-cell point-to-multipoint communications. We consider a base station that needs to transmit a common information to a group of users. We propose a layered Wyner-Ziv coding (WZC) scheme based on nested lattice quantization. In our scheme, we use the base layer generated by a standard coder as the decoders side information. Then, WZC is performed for quality...
The Gaussian fading channel is studied, in which the channel from the transmitter to the receiver is corrupted by a multiplicative fading coefficient H and an additive Gaussian random noise. It is assumed that the channel is experiencing block fading, and the transmitter does not know the channel state information (CSI). The receiver is assumed to have full knowledge of the CSI. If the channel state...
Fountain codes are used in many applications where the channels are time varying and it is difficult at the transmitter to predict the appropriate code rate. In this situation, fixedrate codes are not suitable. Despite the good performance of fountain codes, universally optimal codes do not exist in the finite-length regime. In this paper, we design new fountain codes that are robust to the communication...
We analyze the performance of a concatenated code with two different inner decoding schemes. One is the error-detecting inner decoding, and the other is the error-detecting-and-correcting inner decoding scheme. We compare the performances of the two decoding schemes when the concatenated code is applied to slow frequency-hopping spread-spectrum multiple access (FH-SSMA) communication systems.
We present a technique based on permutations, the well known arcade game Pacman, and limited-precision integers to encode data into balanced codewords. The redundancy that is introduced by the encoding is particularly low. The results are noticeably better than those of previous work. Still, the resources required by our technique remain modest: there is no need for costly calculations using large...
Multipath TCP (MPTCP) is a promising extension of TCP to spread data across several subflows enabling multiple path support. Like TCP, MPTCP suffers from performance degradation when deployed in wireless networks. It tends to interpret random link losses as congestion signals. Yet, the protocol is showcased for handheld devices with multiple radios to enable throughput aggregation and seamless handover...
360° video streaming to clients using Virtual Reality head mounted displays is a challenge for traditional video delivery. As transmission of the complete content in a desirable quality sacrifices a large fraction of available client and network resources, adaptivity to the user viewport promises substantial benefits. An efficient way to achieve viewport adaptive streaming without per-user or per-orientation...
In this work, we consider a variant of the set reconciliation problem where the estimate for the size of the symmetric difference may be inaccurate. Given this setup, we propose a new method to reconciling sets of data and we then compare our method to the Invertible Bloom Filter approach proposed by Eppstein et al. [2].
In this paper, we present a new digital hologram compression scheme using the Fresnelet transform and its multiresolutional decomposition properties. A digital hologram is locally divided to several sub-holograms and they are decomposed by the Fresnelet transform into subbands in the type of quad-tree. Among the subbands, the ones that have similar frequency bandwidth are combined into a sequence...
We consider a communication scenario in which the channel undergoes two different classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modeled by the concept of arbitrarily varying wiretap channels (AVWCs), in which the channel varies from one channel use to the other in an unknown and arbitrary manner. It has been shown that uncorrelated codes fail to...
Two polar coding schemes are proposed for the degraded broadcast channel under different reliability and secrecy requirements. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers, and individual channels are assumed to gradually degrade in such a way that each legitimate receiver has a better channel than...
Motivated by applications of distributed storage systems to key-value stores, recently, the multi-version coding problem was proposed to store data that is frequently being updated in a distributed storage system. In particular, in multi-version coding, it is desired to store the data consistently, that is, even if all servers do not receive the data updates simultaneously, the decoder can recover...
This paper shows that the slope at each corner point of the capacity region of the general broadcast channel coincides with that of the randomized time division (hence the Marton) inner bound and the Nair-El Gamal (as well as the Körner-Marton) outer bound. We then show that the optimal superposition coding inner bound by Bandemer, El Gamal, and Kim can be simplified to the convex closure of the union...
We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and decoding, we show that polar codes achieve the best known inner bound for the empirical coordination region, provided that a vanishing rate of common randomness...
Algebraic-geometric (AG) codes have long been considered as a possible candidate to replace Reed-Solomon (RS) codes. However, their decoding remains complex and infeasible to implement. Addressing this challenge, our paper proposes a low-complexity Chase (LCC) decoding algorithm for the most popular class of AG codes - Hermitian codes. The LCC decoding is realised by formulating decoding test-vectors,...
When complex system designs with complex specifications, where more than one address and data need to process simultaneously, than various protocols are used to process. There are various serial and parallel protocols are significant to used. But, now a day, AMBA AXI protocols are generally used for the interface. In this research work we present a flexible module with generic interfaces. Our implementation...
An efficient framework of distributed compressive video coding using Enhanced side information for WSN is proposed. At the encoder, the incoming video frames are split into key frames and Wiener-Ziv (WZ) frames depending on Group of Picture (GOP). Based on Distributed Video Coding (DVC) these frames are processed independently and transmitted over WSN. Generally the WZ frames are encoded at a lower...
Accurate modelling of the decoding energy of a CTU is essential to determine the appropriate level of quantization required for decoder energy-aware video encoding. The proposed method predicts the number of nonzero DCT coefficients, and their energy requirements with an average accuracy of 4.8% and 11.19%, respectively.
The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode input sequences emitted from two correlated sources into fixed-length codewords, and the decoder reconstructs all input sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder runs with...
Polar codes for channels with memory are considered in this paper. Şaşoğlu proved that Arikan's polarization applies to finite-state memory channels but practical decoding algorithms of polar codes for such channels have been unknown. This paper proposes a generalization of successive cancellation algorithm for channels with memory where the complexity is polynomial in the number of states. In addition,...
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.