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.
Channel polarization is a new method for constructing capacity-achieving codes on binary-input discrete memoryless channel (B-DMC). How the block length, the erasure probability and threshold of the polarization affect the level of polarization is studied in this paper. Simulation results show that the polarization phenomenon becomes more and more obviously with the increase of the block length and...
Although polar codes can achieve the channel capacity in discrete memoryless channel, the practical performance of such codes, especially for the short ones, is still a subject of much needed improvement. The aim of this paper is to investigate increasing the Hamming distances of polar codes while maintaining their linearity property. We propose two methods; in the first, the code-rate remains unchanged,...
This paper evaluates the rate loss of fixed-length spatially-coupled low-density parity-check (SC-LDPC) code compared to the asymptotic performance of such code. In previous works, SC-LDPC with sufficient length of codeword shows excellent asymptotic performance and attracts a lot of attentions. However, when the length of codeword is limited, the performance of SC-LDPC code with limited codeword-length...
Compared with energy-harvesting transmitters, the performance of energy-harvesting receivers has not been fully investigated. The main consumption of energy at transmitters is for transmission, while that at receivers is for information decoding. Hence, the analysis and optimization of energy-harvesting transmitters and receivers are inherently different. Motivated by the above, in this paper, we...
In this paper, an adaptive cooperation scheme is presented for bidirectional communication between two nodes, where the non-relay direct transmission and the one- or two-way relaying diversity transmission are jointly considered. The results show that the proposed scheme obtains lower outage probability than the conventional bidirectional communication methods.
We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the original message. In addition, the relations between BEC, BDC, binary erasure quantization (BEQ), and write-once memory (WOM) are described. From these...
Hybrid Automatic Repeat reQuest (HARQ) techniques are largely used in the context of wireless communications systems especially in the last few years, being employed in the latest cellular systems, including the Long Term Evolution (LTE) standard. Such schemes have been widely studied in literature; however, in this paper we are interested in applying the results of Polyanskiy-Poor-Verdù on the finite...
A friendly eavesdropper assists communication in a broadcast scenario in which one transmitter wishes to send a common message to two receivers in the presence of a malicious jammer. The jammer attempts to disrupt communication by transmitting a high power Gaussian signal, whereas the friendly eavesdropper ‘hears’ the jammer's transmission and sends an assisting signal to the destinations over an...
The binary symmetric channel (BSC) with feedback is considered, where the input sequence contains no consecutive ones, i.e., satisfies the (1,∞)-RLL constraint. In [1], the capacity of this setting was formulated as dynamic programming (DP); however, analytic expressions for capacity and optimal input distribution were left as an open problem. In this paper, we derive explicit expressions for both...
We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity recently derived in [1]. The aforementioned...
The Internet of Things aims to connect several billions of devices. Terminals are expected to be low cost, low power, and able to achieve successful communication at long range. While current Machine-to-Machine technologies tend to use spreading factors to meet the required specifications, we propose a more sophisticated use of redundant waveforms in a scheme called Turbo-FSK. This scheme involves...
In this work we consider the communication setting in which a sender, Alice, wishes to communicate with a receiver, Bob, over a channel controlled by an adversarial entity, Calvin, who is myopic. Roughly speaking, for blocklength n, the codeword Xn transmitted by Alice is corrupted by Calvin who must base his adversarial decisions, on which characters of Xn to corrupt and how to corrupt them, not...
A long-standing question in coding theory is whether code ensembles having a low-density parity check (LDPC) matrix can attain capacity under belief propagation (BP) decoding. An affirmative answer to this problem was recently given by the special class of spatially-coupled LDPC code ensemble. In this work, we provide a simple derivation of a different LDPC code ensemble that approaches capacity under...
In this paper we analyze nonanticipative (delayless) transmission of source symbols with memory over channels with memory (with and without feedback). We employ duality of {source, channel} pairs with respect to {distortion function, transmission cost} pairs to show achievability of nonanticipative transmission in terms of excess distortion probability. We apply the method to the Binary Markov source...
The setup of a general channel is considered in the mismatched case, i.e., when the decoder uses a general decoding metric. An expression for the average error probability in list decoding with block length n, metric qn, list size enΘn and rate R, denoted ε(n)qn(R, Θn), is established. Further, a general multi-letter formula for the mismatched capacity with list decoding is derived. It is shown that...
For a discrete memoryless channel, a lower bound for the correct decoding probability exponent was derived by Arimoto. He also gave an iterative algorithm for computing the exponent. Subsequently, Dueck and Körner determined the optimal exponent function of the correct decoding probability. In this paper, a new iterative algorithm that computes Dueck and Körner's exponent is presented.
The capacity of a queueing timing channel in which a user modulates messages to another user via his pattern of access to a shared resource scheduled in an FCFS manner is calculated. One example of such a channel is the cross-Virtual Network (VN) covert channel in data center networks. In data center networks, software-defined-networks generate logically isolated virtual networks, across which direct...
This paper studies the first- and second-order maximum achievable rates of codes with/without cost constraints for general mixed channels whose channel law is characterized by a mixture of uncountably many stationary and memoryless discrete channels. These channels are referred to as general mixed memoryless channels and include mixed memoryless channels of finitely or countably many memoryless channels...
Nearly tight lower and upper bounds on the capacity of generalized Ising channels are presented. For the case where feedback is allowed, a closed-form expression for the capacity is found for channel error probability p ∈ [0, p0], where p0 ≈ 0.398324. Two lower bounds on that capacity for larger values of p are presented.
The paper considers stabilization under communication errors and limited data rate by means of realistic controllers with bounded (as time progresses) computational powers. Discrete-time partially observed noisy linear systems are studied for which the sensor signals are communicated to the controller over a finite capacity stochastic digital link. Addressed is stabilization in probability. It 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.