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.
Interference forwarding by a relay enhances the interference level and enables the cancellation of the interference. If the interfering source to relay link is not strong, then the relay can decode a part of the interference and forward it to the destination, and the destination can cancel only that part of the interference. It is known as partial decode-and-forward (PDF) and partial interference...
Interference alignment (IA) networks seem secure, due to the fact that signals from the legitimate network may act as interference to disrupt the external eavesdropping. However, when some users inside the network are cooperating to eavesdrop one certain user, it will not be secure any longer. Thus, we concentrate on the eavesdropping attacks in this paper, and propose a novel collusive eavesdropping...
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...
New Raptor codes, based on low rate low-density parity-check (LDPC) codes, are proposed for short message length over various channels. The proposed Raptor codes are obtained by pre-coding the information bits by low rate LDPC codes and utilizing a low constant average degree distribution with high intermediate symbol recovery rate (ISRR). Simulation results demonstrate that the proposed Raptor codes...
It is known that by extracting log-likelihood ratio (LLR) values from the received MIMO signals, a MIMO detector is able to exchange a posteriori soft information with a channel decoder to improve the error performance. A minimum mean-square error with parallel interference cancellation (MMSE-PIC) detector is considered to be a practical MIMO detector, but the computational complexity for the LLR...
Hybrid digital-analog (HDA) architectures have been widely developed for efficient digital transmission of analog speech, audio or video data. By considering the advantage of both digital and analog components, HDA systems gain better performances than purely analog and digital schemes in a wide range of channel conditions. However, HDA systems described in previous works are mostly designed for continuous-valued...
Fountain codes are used in many applications where the channels are time varying and it is difficult at the transmitter to predict the appropriate code rate. In this situation, fixedrate codes are not suitable. Despite the good performance of fountain codes, universally optimal codes do not exist in the finite-length regime. In this paper, we design new fountain codes that are robust to the communication...
The arbitrarily varying channel (AVC) models communication over a channel that varies in an arbitrary and unknown manner from channel use to channel use. This paper considers the AVC under list decoding and studies the corresponding list capacity. In particular, the list capacity function is shown to be discontinuous and the corresponding discontinuity points are characterized for all possible list...
To implement 8K Advanced BS receiver system, 8K HEVC decoder SoC is developed as key component. To solve the exceeded required memory bandwidth over physical memory bandwidth limitation issue for realizing 8K decoder, two types of multi-cast write back scheme, including reference data multi-cast write back and output data multi-cast write back, are introduced. 8K HEVC decoder chip is fabricated in...
Stringent mobile usage characteristics force wireless networks to undergo a paradigm shift from conventional connection-centric to content-centric deployment. With respect to 5G, caching and heterogenous networks (HetNet) are key technologies that will facilitate the evolution of highly content-centric networks by facilitating unified quality of service in terms of low-latency communication. In this...
We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly...
Recently Yamamoto and Ueda proposed multiple object identification (MOID) codes to identify multiple objects via a channel at once, which is an extension of identification (ID) codes. They gave the explicit construction of MOID codes and derived the achievable triplet of coding rate R, the error exponents E1 and E2 of type I and type II decoding error probabilities. However, they did not treat the...
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 insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. We further assume that there are no segment markers in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based...
In this paper, throughput of hybrid automatic repeat request (HARQ) schemes with finite blocklength codes is studied for both constant-rate and ON-OFF discrete-time Markov arrivals under statistical queuing constraints and deadline limits. After analyzing the decoding error probability and outage probability, the distribution of transmission period is characterized, and the throughput expressions...
In this article, we resolve open problem 8.2 in [1]. We show that superposition coding is sub-optimal for a three receiver broadcast channel with two message sets (M0, M1) where two of the three receivers need to decode messages M0, M1) while the remaining one just needs to decode the message M0.
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...
A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is shown to satisfy a so-called “quasi-symmetry” condition under certain invertibility conditions. As a result, it is proved that a uniformly distributed input process...
We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data symbols using bitwise XOR and cyclic shift operations. The number of data symbols is chosen according to the Robust Soliton distribution. XOR and cyclic shift operations establish a unitary commutative ring if data symbols...
This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. First, a lower bound on the optimal peak rate-memory trade-off is provided...
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.