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 presents a non-binary finite-stat Markov channel (FSMC) that captures both the soft-decision information and the temporal correlation of a discrete fading channel (DFC) with 2ξ quantization levels. The parameters of the FSMC that approximate the DFC with fixe parameters are found using the Baum-Welch algorithm. An iterative decoding scheme, based on the sum-product algorithm, is also discussed...
This paper investigates the energy harvesting fading multiple-access channels, where the transmitters harvest random amounts of energy from the environment and the data transmissions are subject to statistical quality of service (QoS) constraints in the form of limitations on the buffer overflow probability. With the assumption that the channel state information (CSI) and harvested energy in all time...
We propose an underlay decode-and-forward cognitive (UDFC) scheme under joint effects of hardware impairments at secondary users and interference constraints at multi primary receivers. In this scheme, the transmit powers of a source node and relays are constrained by interference thresholds of primary receivers in which the best relay is selected has the highest decoding capacity from the source...
In this paper, we present a nonuniform quantizer based on the condition of maximum information rate achieved over uncorrelated Rayleigh fading channel and when successive cancellation (SC) decoding algorithm of polar codes is applied. Based on symmetry condition of random variables, we start with theoretical model where uniform scaling factors are applied to correct soft messages at the absence of...
This paper studies an uplink simultaneous wireless information and power transfer (SWIPT) system with non-orthogonal multiple access (NOMA), consisting of two users and one energy-harvesting access point (AP). The users transmit their independent information simultaneously to the AP which harvests energy and decodes information at the same time by dynamic power splitting (DPS). We focus on the ergodic...
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...
In this paper we study the initialization step of decoding algorithms for efficient error-control coding techniques, and its dependence of the channel characteristics over which transmission is performed. LDPC and Polar codes are selected as efficient error-control codes operating over different channels. Channels under study are the classic Additive White Gaussian noise channel, the Rayleigh fading...
This paper proposes Raptor codes-structured wireless super-dense networks serving a massive number of users with passive nodes constructing a precode of Raptor codes for future wireless networks. Passive nodes do not have their own information and only forward information from the neighboring nodes to the destination node. Similar to the capability of precode of Raptor coding scheme to protect information...
In this work we present construction of Space Time Block Codes (STBC) from Abelian codes. A well known Eisenstein-Jacobi rank preserving map is applied to map the codeword matrix symbols to symbols in the complex plane. We then propose an NT × NR MIMO (multiple input, multiple output) communication system employing the constructed STBC. An analysis on the receiver (decoder) computational complexity...
The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying attenuation due to fading needs to be mitigated. To the best of our knowledge, there has been no comprehensive work in this direction thus far. In this work, a practical...
First and second generation digital video broadcasting terrestrial systems (DVB-T and DVB-T2/T2-Lite), like many other wireless communication standards, contain an Orthogonal Frequency Division Multiplexing (OFDM) signal processing chain. One of the main disadvantages of the OFDM technique is its high sensitivity to the non-orthogonality between In-Phase and Quadrature (IQ) signals in the IQ modulator/demodulator...
A new time switching protocol referred to as TS- APS is proposed for the energy harvesting (EH) relay networks based on the combination of conventional time switching (TS) protocol and adaptive power splitting (APS). In the framework of the decode and forward (DF) relaying with multiple relays, we derive the closed-form expression for the outage probability of the proposed scheme and discuss its effective...
With the development of high-speed trains (HST), efficient and reliable communication services in high mobility scenarios have become an urgent demand. As one of the strong candidates in 5G wireless system, polar codes along with its optimized design should also be investigated under high mobility scenarios. In this paper, a scheme of hash-concatenated polar codes is proposed to reduce the false alarm...
In this work, the construction of non-recursive nonsystematic convolutional codes that allow to achieve secure transmission over a two-link compound wiretap channel is proposed. The code design goal is that, whenever an eavesdropper has access to one of the two links, he cannot recover any of the transmitted information bits. Secure transmission is achieved by considering a special family of convolutional...
A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into multiple independent information layers, each adapted to a specific actual channel realization. The major distinction between the proposed strategy and the existing...
We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with negligible probability of error for any channel realization and normalized log-density approaching the Poltyrev limit. Capacity analyses and numerical results on the...
Variable-length codes with incremental redundancy controlled by feedback allow a system to approach capacity with short average blocklengths and thus relatively low-complexity decoders. This paper shows how to use those same variable-length codes with incremental redundancy to approach capacity without feedback. The general principle is to provide a common pool of redundancy that can be accessed by...
In this paper, we study lattice coding for Rician fading wireless channels. This is motivated in particular by preliminary studies suggesting the Rician fading model for millimeter-wavelength wireless communications. We restrict to lattice codes arising from rotations of Zn, and to a single-input single-output (SISO) channel. We observe that several lattice design criteria suggest the optimality of...
One of the main challenges of communication in the absence of transmitter channel knowledge is codebook universality, i.e., the existence of a single codebook that guarantees a given rate for all channel states. We address this problem for a class of ergodic fading multiple-input multiple-output (MIMO) channels, whose fading distribution is not necessarily isotropic. It is shown that a universal codebook...
Previous approaches to compute-and-forward (C&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C&F strategy over block fading channels using Construction A over rings, so as to allow better quantization for the channels. Advantages in decoding error probabilities and computation rates are demonstrated, and the construction is shown to outperform...
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.