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 this paper, we address the need for motivating applications, such as mission critical industrial control and medical applications, to operate under the Ultra-Reliable Communication (URC) mode in the future 5th Generation (5G) cellular wireless networks, while also under strict Quality of Service (QoS) constraints such as ultra-low latency. Reliability has been shown to improve by using Hybrid Automatic...
A general analytical framework based on generalized mutual information is applied to the analysis of massive multiple-input-multiple-output systems with low-resolution output quantization. For Gaussian codebook ensemble and nearestneighbor decoding rule, an equivalence relationship is established for general nonlinear transceiver distortion, that the effective signal-to-noise ratio based on the generalized...
We propose a decentralized multi-cell aware opportunistic random access (MA-ORA) protocol that almost achieves the optimal throughput scaling in a K-cell random access network with one access point (AP) and N users in each cell. Under our MA-ORA protocol, users opportunistically transmit with a predefined physical layer data rate in a decentralized manner if the desired signal power to the serving...
A concatenated coding scheme using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first bound is obtained using outer codes which are typical linear codes from the ensemble of parity check matrices whose elements are chosen independently and uniformly. As a byproduct of this bound, it determines...
The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This expression is used to characterize the number of measurements needed for signal recovery in the low SNR regime, in terms of higher order autocorrelations of the signal...
Concatenation of polar codes with cyclic redundancy check (CRC) codes, together with successive cancellation list (SCL) decoding, is known to be an effective approach that can significantly enhance the performance of the original polar codes. Most of the studies on the concatenation of CRC and polar codes, however, pay little attention to the structure of CRC codes themselves, even though the longer...
In a UHF RFID system, frequency drift is very common and will affect to decode RFID tag signals. When the frequency drift occurs, the performance of traditional decoding algorithms will degrade. In this paper, we introduce an FM0 decoding algorithm against the frequency drift. The introduced algorithm could effectively decode from the collided signals into a tag's ID through where a true positive...
Compressed Sensing (CS) is an effective way to sample a signal at a sub-Nyquist rate, i.e., by using a number of measurements smaller than the number of samples required when using the standard Nyquist approach. Measurements are obtained as linear projections of input signals along random sensing vectors. CS has been often regarded as a democratic method, in the sense that each measurement contributes...
Space-time trellis codes (STTCs) combine channel coding and multiple-input multiple-output (MIMO) techniques to provide coding and diversity gains for wireless communication systems. The decoding complexity is extremely high because of the high density of branch metric calculations. Thus, this study presents a state-purging mechanism based on the T-algorithm to reduce the computational complexity...
Recently, a new paradigm of multiple access (MAC) along with one eavesdropper to achieve secrecy transmissions has been getting in focus. However, all existing work on such multiple access wiretap channel (MAC-WT) mainly concentrates on the secrecy performance of the system as a whole from an information theoretic perspective. In this work, we investigate the secrecy performance of a single transmitter...
Owing to their capacity-achieving performance and low encoding and decoding complexity, polar codes have drawn much research interests recently. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two common approaches for decoding polar codes. SCD is sequential in nature while BPD can run in parallel. Thus BPD is more attractive for low latency applications. However BPD...
Recently, rateless codes make a remarkable progress on achieving maximum network performance without incurring CSI feedback overhead, under dynamic contexts with time-varying channels. However, existing rateless codes are only optimal for single-carrier channels, but are far from optimal for multi-subcarrier OFDM channels that are dominantly adopted in modern high-speed wireless networks. In this...
Incorporating the effect of residual self-interference, the spectral efficiency (SE) of full-duplex relay channel is analyzed for different relay schemes. The optimal relay power and the corresponding optimal SE have been derived in closed form for decode-forward, compress-forward, and amplify-forward (AF) schemes. In particular, backward decoding is introduced to the AF scheme in the presence of...
Real interference alignment is efficient in breaking-up a one-dimensional space over time-invariant channels into fractional dimensions. As such, multiple symbols can be simultaneously transmitted with fractional degrees-of-freedom (DoF). Of particular interest is when the one dimensional space is partitioned into two fractional dimensions. In such scenario, the interfering signals are confined to...
The integer-forcing (IF) linear multiple-input and multiple-output (MIMO) receiver is a recently proposed suboptimal receiver which nearly reaches the performance of the optimal maximum likelihood receiver for the entire signal-to-noise ratio (SNR) range and achieves the optimal diversity multiplexing tradeoff for the standard MIMO channel with no coding across transmit antennas in the high SNR regime...
We propose a new construction algorithm for Polar codes operating over Additive White Gaussian Noise channels under Successive Cancellation decoding. Our approach is based on tracking the bit error probabilities of the bit channels as they evolve through the decoder, allowing us on the one hand to characterize the performance of these channels, and on the other hand, providing a solid construction...
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...
We consider a multiple access relay channel (MARC) network consisting of two sources, one relay, and one common destination applying compute-and-forward (CF) strategy. We show that the direct application of CF to the MARC network results in poor error performance bounded by (p + 1)−1, the probability of rank deficiency of the coefficient matrix over Fp. To solve this problem, we propose two practical...
Polar code has become a major milestone in information theory field in recent times. Researchers are still observing more efficient encoding and decoding structures. In this study, a new WIB based structure is proposed which reduces the computational complexity of WIB introduced as an early termination method for BP polar decoder in literature. Both proposed and WIB methods are implemented with VHDL...
There is a growing concern regarding the design of decentralized control systems. Witsenhausen's counterexample is a well-known problem which has remained open in this context, and emphasizes the necessity of communication between blocks in a distributed control system. In this paper, we study an infinite vector model of this problem and a new bound for the cost function is derived. It is shown that...
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.