In a multi-cell wireless network, cell-edge user equipments (UEs) inevitably suffer from strong interference from adjacent cells which leads to the UE throughput decrease. Contrary to conventional interference mitigation techniques which treat the interference as noise, we propose to use a rate splitting based interference exploitation technique. A novel distributed power allocation algorithm is adopted to optimize the performance. Simulation results show that the multi-layer rate splitting scheme with the proposed power allocation algorithm can approach the best known achievable rate bound of a two-user interference channel and substantially improve the performance of cell-edge UEs in a tri-sectored network.

In a multi-cell wireless network, an efficient interference mitigation technique is an inevitable part of the current state-of-the-art wireless system. As opposed to conventional interference mitigation techniques which treat the interference as noise, a multi-layer rate splitting scheme can be considered to improve the performance by decoding part of the interference. In this paper, we adapt the multi-layer rate splitting scheme to a Long Term Evolution Advanced framework. Simulation results for two UEs show that the proposed multi-layer rate splitting scheme substantially improves the performance of the cell-edge UE and achieves better fairness between the involved UEs.

The current coordinated multi-point transmission schemes require the transmission coordination to avoid the interference. This paper considers the benefit from the rate splitting method, which has been shown to improve the capacity of the interference channel by decoding part of the interference. In this paper, a coordinated multi-point transmission framework based on the cooperative rate splitting scheme is proposed in the Long Term Evolution Advanced system, where a user equipment pair selection algorithm and a cooperative proportional fair scheduling algorithm are newly developed. The simulation results have shown that the coordinated multi-point transmission with cooperative rate splitting can substantially improve the performance of the cell-edge user equipment without or with a slight performance loss at the average rate in a realistic network.

In this work, we present a new framework for developing decoding algorithms for linear block codes. We define a new graphical model, called configuration graph and show that maximum likelihood (ML) sequence decoding can be performed by finding a maximum vertex packing on a configuration graph. We present examples of low-cost decoding algorithms developed using this graphical model and show that remarkable performance improvements can be achieved especially by combining these algorithms with belief propagation (BP) decoding for Low Density Parity Check (LDPC) codes.

The long term evolution of UMTS (Universal Mobile Telecommunications System) Terrestrial Radio Access, abbreviated as UTRA LTE, will be based on OFDM (orthogonal frequency division multiplexing). Furthermore, MIMO (multiple-input multiple-output) techniques have been considered as a means for the improvement of wireless connectivity. In wireless systems, high data rates in the downlink are desirable: Furthermore, with respect to an efficient implementation, the downlink requires a thorough assessment. In particular, the Alamouti and the V-BLAST (Vertical Bell Labs Layered Space Time) schemes are seen as interesting concepts. In this communication, the authors will compare these two MIMO schemes w.r.t. the achievable performance in the UTRA LTE downlink using up to two transmit and two receive antennas. Furthermore, the authors will discuss the deployment of spatial multiplexing in the UTRA LTE downlink and will show that the performance of successive interference cancellation (SIC) based data detection techniques for MIMO-OFDM is beneficial.

The trellis of a finite Abelian group code is locally (i.e., trellis section by trellis section) related to the trellis of the corresponding dual group code which allows one to express the basic operations of the a posteriori probability (APP) decoding algorithm (defined on a single trellis section of the primal trellis) in terms of the corresponding dual trellis section. Using this local approach, any algorithm employing the same type of operations as the APP algorithm can, thus, be dualized, even if the global dual code does not exist (e.g., nongroup codes represented by a group trellis). Given this, the complexity advantage of the dual approach for high-rate codes can be generalized to a broader class of APP decoding algorithms, including suboptimum algorithms approximating the true APP, which may be more attractive in practical applications due to their reduced complexity. Moreover, the local approach opens the way for mixed approaches where the operations of the APP algorithm are not exclusively performed on the primal or dual trellis. This is inevitable if the code does not possess a trellis consisting solely of group trellis sections as, e.g., for certain terminated group or ring codes. The complexity reduction offered by applying dualization is evaluated. As examples, we give a dual implementation of a suboptimum APP decoding algorithm for tailbiting convolutional codes, as well as dual implementations of APP algorithms of the sliding-window type. Moreover, we evaluate their performance for decoding usual tailbiting codes or convolutional codes, respectively, as well as their performance as component decoders in iteratively decoded parallel concatenated schemes.

In this correspondence, the application of covariance techniques to surface representation of 3-D objects is discussed and such ways of computing surface geometry are compared with traditional methods using differential geometry. It is shown how the covariance method provides surface descriptors that are invariant to rigid motions without explicitly using surface parameterizations or derivatives. Analogous covariance operators for both the Gauss and Weingarten maps are defined and a range image segmentation technique is presented that labels pixels as jump or crease discontinuities or planar, parabolic or curved region types.>