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 propose a novel MIMO transmission scheme, called trellis coded spatial modulation (TC-SM) in which the trellis (convolutional) encoder and the spatial modulation (SM) mapper are jointly designed similar to the conventional trellis coded modulation (TCM). A soft decision Viterbi decoder, which is fed with the soft information supplied by the optimal SM decoder, is used at the receiver...
This work studies the Gaussian interference channel (IC) with an out-of-band relay (OBR) from an information-theoretical perspective. The relay works in bands orthogonal to the IC. The focus is on a symmetric channel model, in order to understand the fundamental impact of the OBR on the signal interaction of the IC, in the simplest possible setting. We classify the interference links as extremely...
This paper investigates a network information flow problem for a multiple-input multiple-output (MIMO) Gaussian wireless network with K-users and a single intermediate relay having M antennas. In this network, each user intends to convey a multicast message to all other users while receiving K-1 independent messages from the other users via an intermediate relay. This network information flow is termed...
In some harsh environment, wireless sensor networks without the sink are often deployed. In the network, the nodes just have limited energy and are easy to fail. In order to prevent the data loss due to the failure of nodes, each node disseminates its data to be stored at a subset of nodes in the network for preservation. However, each node just knows the information of its neighbors, and just has...
In this paper, we investigate various cooperative transmission techniques for hybrid and/or integrated satellite and terrestrial systems, where satellite and terrestrial components cooperates to provide high quality services. It has been reported that cooperative diversity techniques combined with space time and/or error correction coding schemes could provide appreciable diversity and additional...
Low-density parity-check (LDPC) codes have proved to be very powerful channel coding schemes with a broad range of applications. However, as maximum-likelihood decoding is utterly complex, suboptimal decoders have to be employed. One of the most popular decoding algorithms of LDPC codes is belief propagation (BP) decoding. In this paper, we present a novel scheduling for belief propagation decoding...
Cooperative diversity is an emerging and powerful solution that can significantly improve the diversity order and link reliability over the harsh wireless fading channels. Although there has been a lot of work on achieving full diversity by using advanced space-time coding or signal processing schemes, how to increase the spectral efficiency or multiplexing gain with half-duplex relays has not received...
We present a low complexity iterative decoding method for a multiplexed Alamouti space-time code serially concatenated by a convolutional code. The space-time signalling code consists of a Gray coded 16-QAM mapper and two spatially overlaid Alamouti signalling blocks. A linear complexity decoder is used for decoding the inner space-time code. Ordinarily, an iterative decoding between the inner and...
It is well known that although the conventional sphere decoder (SD) achieves optimal maximum likelihood (ML) performance at a reduced complexity compared to the naive ML detector, the SD computational complexity varies with signal noise ratio (SNR) and is high in the low SNR region. This paper proposes a new idea to overcome these drawback that reduces the complexity significantly at a negligible...
In this paper we study the long-term throughput performance of repetition protocols coupled with power control for multiple access block-fading channels. We propose to use the feedback bits to inform the transmitter about the decoding status and the instantaneous channel quality. We determine the throughput of simple and practically inspired protocols; we show remarkable throughput improvements, especially...
Recently, analog joint source-channel coding has been proposed as a means of achieving near-optimum performance for high data rates with a very low complexity. However, no experimental evaluation showing the practical feasibility of this scheme has been performed to date. In this paper, we describe a software-defined radio implementation of an analog joint source-channel coded wireless transmission...
In wireless X networks where all transmitters send the independent messages to all receivers, the theoretical degrees of freedom (DOF) and interference alignment (IA) scheme for its achievability are given by Cadambe and Jafar. However, IA scheme for wireless X network may be infeasible in practice unless the transmitters have the perfect channel information. In addition, if the transmitter with single...
CA(Carrier aggregation) is one of the most important techniques for LTE-Advanced system because of its capability to support wide bandwidth while achieving backward compatibility. In order to improve performance of control information transmission, cross-carrier scheduling is to be supported, i.e. control information on one CC (Component Carrier) can assign radio resource on another CC. Design of...
We present a novel adaptive physical layer network coding (PLNC) at the relay, called pseudo exclusive-or (PXOR), for LDPC coded two-way relay (TWR) block fading channels. Based on the pairwise check decoding (PCD), the check relationship table generated by the proposed PXOR mapping obtains the same Hamming distances of the PLNC mapped codewords as that of conventional XOR mapping. In the meantime,...
We have derived the optimal cooperative sensing schemes for distributed sensors with time independent signals and shown that the optimal scheme is simply a linear combination of the normalized energies from all sensors. To avoid using the SNR information and simplify the decision process and threshold setting, some sub-optimal schemes have been analyzed and compared. In general, the proposed AOCS...
We consider a simple closed-loop spatial multiplexing architecture which can be incorporated into an outer system with off-the-shelf single-input single-output encoders/decoders. Instead of relying on transmitter-side channel state information for matching the layers of the multidimensional signal to the eigenmodes of the multiple-input multiple-output channel through a precoding, the eigenmodes with...
Cooperative communication with rateless codes has attracted much attention recently because it combines spatial diversity of multiple nodes and high bandwidth efficiency of rateless codes. However, relay selection for asynchronous relaying, which shows great potential for practical applications, has not been carefully studied yet. In this paper, based on rateless codes, we propose a simple probabilistic...
A significant amount of the analysis of protograph-based low-density parity-check (LDPC) codes has been devoted to the subclass of quasi-cyclic (QC) LDPC codes. Despite their implementation advantages and algebraic properties that make them easy to analyze, protograph-based QC-LDPC codes have undesirable fixed upper limits on important code parameters. This implies that picking a QC code from an asymptotically...
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.