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.
We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another output is received as side information at the decoder. The adversary is assumed to know the source data non-causally, and can employ randomized jamming strategies...
In this paper, a streaming transmission setup is considered where an encoder observes a new message in the beginning of each block and a decoder sequentially decodes each message after a delay of T blocks. In this streaming setup, the fundamental interplay between the coding rate, the error probability, and the blocklength in the moderate deviations regime is studied. For output symmetric channels,...
We derive the second order rates of joint source-channel coding, whose source obeys an irreducible and ergodic Markov process by introducing new distribution family, switched Gaussian convolution distribution, when the channel is a discrete memoryless. We also compare the joint source-channel scheme with the separation scheme in the second order regime.
This paper studies expurgated random-coding bounds and error exponents for joint source-channel coding (JSCC). We extend Gallager's expurgation techniques for channel coding to the JSCC setting, and derive a non-asymptotic bound that recovers two exponents derived by Csiszár using the method of types. Our approach has the notable advantage of being directly applicable to channels with continuous alphabets.
In this work, we study the arbitrarily varying degraded broadcast channel (AVDBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the deterministic code capacity region. The capacity region is then determined for a class of channels satisfying a condition on the mutual informations between the...
In this paper, candidate coding schemes are investigated for the new radio access technology (RAT) of the fifth generation (5G) mobile communication standard. Enhanced mobile broadband(eMBB) scenario of the 5G standard corresponding the activities in the third generation partnership project (3GPP) is considered. The coding schemes are evaluated in terms of block error rate (BLER), bit error rate (BER),...
5-th generation mobile networks aim the peak data rates in excess of few Gbs, which may appear to be challenging to achieve due to the existence of some blocks such as the turbo decoder. In fact, the interleaver is known to be a major challenging part of the turbo decoder due to its need to the parallel interleaved memory access. LTE uses Quadratic Permutation Polynomial (QPP) interleaver, which makes...
In this paper, a distributed video coding (DVC) system with spatiotemporal side information is proposed. The proposed framework addresses the problem of poor compression performance of DVC for high-motion video sequences by integrating temporal and spatial prediction schemes in one framework. Super-resolution techniques are employed for spatially-predicted side information generation, and a support...
This work studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination. Due to the spectral efficiency constraint, we assume that a single time slot is dedicated to relaying. Conventional network-coded based cooperation (NCC) selects the best relay which uses network coding to serve the two sources simultaneously. It is shown that...
In harsh channel conditions, the quality of the synthetic speech at low bit rate would be affected severely. In order to improve the robustness of the vocoder and make it more resilient to errors in random channel, unequal error protection (UEP) channel coding is usually adopted. However, when the errors cannot be corrected in some cases, UEP channel coding will not improve the quality of the synthetic...
This paper studies the secure communication over Blackwell's binary multiplying channel (BMC) in the presence of an external eavesdropper, who has the same observation as the legitimate users. Based on the idea of Schalkwijk's coding scheme, we propose a secrecy coding scheme, aiming for both high efficiency (measured by the transmission sum-rate) and high secrecy (measured by the normalized equivocation...
We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ε. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source...
Hybrid analog digital (HDA) architectures have been widely used in communication systems for analog source over discrete-time memoryless Gaussian channels. They employ a linear coding scheme in the analog parts, while considering separately the design of source and channel codes in the digital parts. To the best of our knowledge, none of the previous HDA schemes exploit the advantages of maintaining...
With the enormous amount of data generated through the internet and sensors, Internet of Things, it becomes too overwhelming for humans to examine it all. One solution is to reduce the data to a set of statistics. The perspective in this paper is the opposite, namely that most of this data is just background noise, and the interesting parts are those that deviate from background noise, the parts that...
In this paper, a joint source-channel coding approach is taken to the problem of securely computing a function of distributed sources over a multiple-access wiretap channel that is linear with respect to a finite field. It is shown that if the joint source distribution fulfills certain conditions and the function to be computed matches the linear structure of the channel, secrecy comes for free in...
Spectrum sensing (SS) is the key enabling technology for wideband cognitive radio networks, where two coexisting systems share the same frequency band. The critical task of SS is required to detect spectrum opportunities and to determine if the spectrum allocation meets the quality of service (QoS) requirements of different users. In case of missed detection, collision happens between secondary and...
Since their invention in 2009, Polar Codes have emerged as new near-capacity channel codes with a great potential of replacing turbo codes and low density parity check codes in a wide range of applications. This paper investigates the use of systematic polar codes in a distributed source coding application. A system model is proposed for the compression of distributed sources with side information...
In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all n messages requested by the receivers, in the distributed index coding there are 2n − 1 servers, each containing a unique non-empty subset J of the messages and each is connected to all receivers via a noiseless independent...
Channel coding plays a vital role for the maintenance of quality and reliability in data delivery in a communication system. Practical applications of channel coding includes the area of deep space communication, satellite communication, wireless communication, data transmission etc. Convolution coding is one of large class among them. The main aim of this paper is to elucidate the main features of...
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...
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.