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.
In the satellite communication system, Doppler spread is caused by the movement of the mobile receiver such as high speed aircraft, vessel, and so on. To overcome Doppler spread in the satellite communications, we propose the novel FDE (Frequency Domain Equalizer) and turbo code in order to compensate Doppler spread efficiently in this paper. And we adapt single carrier system in order to save power...
The pure-interference bosonic multiple access channel has two senders and one receiver, such that the senders each communicate with multiple temporal modes of a single spatial mode of light. The channel mixes the input modes from the two users pairwise on a lossless beamsplitter, and the receiver has access to one of the two output ports. In prior work, Yen and Shapiro found the capacity region of...
Bit-patterned media is a novel technology for magnetic data storage that is poised to increase recording density beyond 1 Tb/sq. in. However, a significant concern in BPMR is the stringent requirements for synchronization between write clock and island position, errors in which may manifest as insertions and deletions. In this paper, we introduce a method for compensating for synchronization errors...
We develop several analytical lower bounds on the capacity of deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information rate between the input and output sequences. We consider the usual independent identically distributed (i.i.d.) binary deletion channel, i.i.d. deletion/substitution channel and i.i.d. deletion channel...
In this paper we construct a family of rate-compatible LDPC convolutional codes for Type-II HARQ systems. For each code family, the codes of lower rates are constructed by successively extending the graph of the high-rate base code. Theoretically, the proposed rate-compatible family includes all rates from 0 to 1. We prove analytically that all LDPC convolutional codes in the family are capacity achieving...
In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). Compared to some new researches, which are based on application of asymptotic analysis tools out of optimization process, the proposed method is much simpler, faster,...
Key agreement problem over a discrete memoryless state-dependent wiretap channel (DM-SWC) is addressed in this paper. Three parties have access to the wiretap channel: One transmitter, an authorized receiver, and an illegal receiver. The transmitter fully knows channel state information (CSI) in a non-causal form, while each receiver has access to a sequence of side information (SI) correlated with...
Design of a new Run Length Limited (RLL) code is presented. The new coding scheme has coding rate of R=2/5, with the minimum runlength between two successive transitions equal to 4. This RLL (4, ∞) code uses channel capacity extremely efficiently, 98.7% and consequently it achieves density rate of DR=2.0. It has better efficiency than many other currently used codes for high density optical recording,...
Any physical channel of communication offers two potential reasons why its capacity (the number of bits it can transmit in a unit of time) might be unbounded: (1) (Uncountably) infinitely many choices of signal strength at any given instant of time, and (2) (Uncountably) infinitely many instances of time at which signals may be sent. However channel noise cancels out the potential unboundedness of...
In this contribution, we investigate Near-Capacity Multi-user Network-coding (NCMN) based systems using an Irregular Convolutional Code, a Unity-Rate Code and M-ary Phase-Shift Keying. In the NCMN based systems, we consider a multiuser network in which the users cooperatively transmit independent information to a common base station (BS). Extrinsic Information Transfer (EXIT) charts were used for...
We study the capacity of discrete memoryless channels with synchronization errors and additive noise. We show that with very large alphabets, their capacity can be achieved by i.i.d. input sources, and prove tight lower and upper capacity bounds. An interesting result is that as long as the input sequences are not completely deleted, the capacity of channels with large alphabets corrupted by discrete...
This paper reviews existing noise models including both background and impulsive noise for the in-home PLC scenario, highlighting similarities and differences. With reference to the impulsive noise, it is shown that a simple model, in the frequency band up to 100 MHz, can be derived by considering the noise generated at the source and taking into account the effect of the channel. Capacity considerations...
A multiple packet receiver (MPR), which jointly performs timing acquisition of the incoming packets and decoding of the packet payloads, is analyzed. The payload decoding consists of iteratively performed parallel interference cancellation, followed by individual error control decoding. Timing acquisition is repeated at every stage of the interference cancellation in order to acquire packets that...
The capacity regions of two classes of multiple-access relay channels (MARCs) are characterized. The MARCs studied in this paper include a primitive relay component, which can help in relaying the messages through a non-interfering finite-capacity link to the decoder. The capacity regions for such MARCs are characterized when: (a) the decoders output is a physically degraded version of the relays...
We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of the channel corresponds to an adversary who may delete up to pn of these bits for a constant p. Our goal is to decode correctly without error regardless of the actions of the adversary. We consider what values of p allow non-zero...
Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of memoryless Gaussian channels. Chen et al. demonstrated that a modified incremental redundancy scheme can use noiseless feedback to help short convolutional codes deliver the bit-error-rate performance of a long blocklength turbo code, but with much lower latency. This paper presents a code-independent...
A new coding scheme for image transmission over noisy channel is proposed. Similar to standard image compression, the scheme includes a linear transform followed by embedded scalar quantization. Joint source-channel coding is implemented by optimizing the rate allocation across the source subbands, treated as the components of a parallel source model. The quantized transform coefficients are linearly...
We consider a discrete memoryless channel between two users and a destination in half-duplex mode implemented by time division. Each transmission block of length n is divided into 3 time slots with variable durations. During the first two time slots, each user alternatively transmits and receives, while during the last time slot, they both transmit to the destination. Even though within each time...
In this paper, we discuss the combination of non-binary channel coding with higher-order modulation and MIMO transmission in the form of spatial multiplexing. In addition to the benefits of non-binary LDPC codes on the AWGN channel, we identify an inherent advantage for non-binary coding in multiple antenna schemes. By comparing binary and q-ary information processing at the receiver, we highlight...
Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer from a capacity loss, when the component code rate is less than unity, which is shown by exploiting the so-called area properties of Extrinsic Information Transfer (EXIT) charts. This capacity loss is unavoidable for twin-component...
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.