In this paper, we consider resource allocation for an outdoor-to-indoor shared user-equipment (UE)- side distributed antenna system (SUDAS) employing multiple independently operating compress-and- forward (CF) relays which utilize both licensed and unlicensed frequency bands to enhance indoor data throughput. First, a non-convex matrix-valued resource allocation problem for maximization of the weighted sum rate is formulated. Next, the non-convex problem is simplified to obtain a low- complexity suboptimal resource allocation algorithm based on sequential quadratic programming (SQP). The proposed algorithm is shown to provide excellent performance in practical scenarios. Furthermore, the algorithm has a low channel state information (CSI) feedback requirement and can accommodate arbitrary communication bands and technologies for indoor relaying. Therefore, the proposed CF-SUDAS scheme can help achieve high outdoor-to-indoor data throughput at low complexity, a crucial requirement for next generation wireless communication systems.

This paper proposes an analytical framework for the prediction of decoding error probabilities in heterogeneous wireless environments, where transmissions from various radio nodes with distinct Poisson-arrival rates and packet lengths populate the channel. Random channel access without feedback is assumed, where partial packet collisions can lead to the loss of packets. The analysis is based on the modeling of the collision length distribution between competing nodes. With recent results from information theory in the finite block length regime, we provide bounds on achievable decoding error probabilities for a given interference scenario. The new framework enables jointly considering inter- and intra-system interference, which is an important aspect in unlicensed radio bands. The framework's applicability to optimize system designs is demonstrated for a typical low-power wide area network scenario. We study the tradeoff between reliability and code rate for a point-to-point link and present achievable throughput regions. The analysis reveals the superior performance of coded time-hopping spread spectrum systems. They reach very low error probability even under strong interference for wide ranges of practically relevant load regions.

In this paper, we study the design of the user selection, the time allocation to uplink and downlink, and the transceiver processing matrix for uplink and downlink multicarrier transmission employing a shared user equipment (UE)-side distributed antenna system (SUDAS). The proposed SUDAS simultaneously utilizes licensed frequency bands and unlicensed frequency bands with large available bandwidths (e.g. the millimeter wave bands) to enable a spatial multiplexing gain for single-antenna UEs to improve the energy efficiency and throughput of 5th generation (5G) outdoor-to-indoor communication. The resource allocation algorithm design is formulated as a nonconvex optimization problem for the maximization of the end-to-end system energy efficiency (bits/Joule). The nonconvex matrix optimization problem is converted to an equivalent nonconvex scalar optimization problem for multiple parallel channels, which is solved by an asymptotically globally optimal iterative algorithm. Besides, we propose a suboptimal algorithm, which finds a locally optimal solution of the nonconvex optimization problem. Simulation results illustrate that the proposed resource allocation algorithms for SUDAS achieve a significant performance gain in terms of system energy efficiency and spectral efficiency compared to conventional baseline systems by offering multiple parallel data streams for single-antenna UEs.

In this paper, we study the resource allocation algorithm design for downlink multicarrier transmission with a shared user equipment (UE)-side distributed antenna system (SUDAS) which utilizes both licensed and unlicensed frequency bands for improving the system throughput. The joint UE selection and transceiver processing matrix design is formulated as a non-convex optimization problem for the maximization of the end-to-end system throughput (bits/s). In order to obtain a tractable resource allocation algorithm, we first show that the optimal transmitter precoding and receiver post-processing matrices jointly diagonalize the end-to-end communication channel. Subsequently, the optimization problem is converted to a scalar optimization problem for multiple parallel channels, which is solved by using an asymptotically optimal iterative algorithm. Simulation results illustrate that the proposed resource allocation algorithm for the SUDAS achieves an excellent system performance and provides a spatial multiplexing gain for single-antenna UEs.

This paper analyzes the reliability and throughput of the telegram-splitting concept in the presence of inter-system and intra-system interference. Using telegram splitting, the data of one telegram is split into multiple sub-packets, which are then transmitted with temporal spacing. As a result, collisions with other telegrams destroy only some sub-packets that can be recovered using forward error correction. Consequently, the reliability of the data transmission in case of inter- and intra-system interference - a significant problem in license-exempt bands - is highly improved. In this paper, probabilities for the resulting telegram error rate of random media access systems using telegram splitting are derived. Furthermore, the achievable throughput is analyzed. The theoretical considerations in addition to simulation results prove the significant gain of the telegram-splitting concept for telemetry systems.

In this paper, we evaluate a multilevel coding (MLC) scheme with multistage decoding (MSD) designed for satellite broadcasting communications. The impact of three different satellite system impairments on the decoding performance is analyzed. First, the influence of errors introduced by the channel estimation is discussed, assuming a typical data-aided (DA) channel estimator with different pilot lengths. Second, the impact of the residual phase noise present after the phase recovery is investigated using a model based on a normal distribution. Finally, the degradation introduced by the non-linearities of the satellite power amplifiers is also analyzed. The impact of these effects is investigated via the mutual information. Besides, bit error rate (BER) simulations are performed for each impairment effect. The considered MLC scheme is compared to a classical bit-interleaved coded modulation (BICM) scheme, showing that the MLC scheme provides different grades of robustness for each level.

In order to reduce the computational complexity of maximum-likelihood symbol estimation (MLSE) demapping of multilevel codes which is based on block partitioning and which produces soft input for a multistage decoding (MSD) process, three different demapping algorithms are proposed. It is theoretically proven that the proposed algorithms can reduce exponentially increasing computational complexity of the MLSE demapping algorithm to a constant complexity (neglecting comparisons). It is shown by extensive simulations for AWGN and Rayleigh fading channels that the proposed low complexity demapping algorithms can achieve near MLSE performance.

We introduce the use of multidimensional (MD) constellations in a multilevel coding (MLC) scheme with multi-stage decoding (MSD) designed for broadcasting communications, where services with different quality of service (QoS) are desirable. We show that the number of different protection levels increases when using MD constellations. Besides, the appropriate block labeling (BL) partitioning for an MD constellation is found by applying the binary switching algorithm (BSA) as an efficient search algorithm. Two cost functions for the BSA are proposed based on the BL criterion. Some methods to construct an appropriate MD constellation are presented, including the use of uniform and non-uniform component constellations. The viability of the proposed MD constellations approach for broadcasting with different protection levels is evaluated analyzing the mutual information (MI) of each level. Finally, we present a comparison between a unidimensional and a multidimensional scheme which again demonstrates the benefits of the proposed scheme.

In this paper, we evaluate a multilevel coding (MLC) scheme with multi-stage decoding (MSD) designed for satellite broadcasting communications, where services with different quality of service (QoS) are desirable. A simple Land-Mobile-Satellite (LMS) channel model is presented, based on channel states and their transitions. The instantaneous channel capacity for suburban and forest scenarios is calculated using the mutual information concept. An established transmission scheme for satellite broadcasting, which uses bit-interleaved coded modulation (BICM) with Gray mapping, is compared with the MLC scheme in terms of channel capacity and outage probability. The effect of removing a long channel interleaver in the physical layer is analyzed, showing that the MLC scheme is a good alternative to BICM for satellite broadcasting.

In this paper, we propose a multilevel coding (MLC) scheme suitable for satellite communications, where different QoS levels are required. We introduce a novel characterization of schemes based on mutual information, called multi-stage decoder (MSD) charts, to aid in the design and evaluation of multilevel coding systems. This characterization method finds the optimal set of code rates for the MLC scheme for a set of required SNR operation points. On the other hand, fixing the code rates to find out the operation points of SNR is also possible. Performance of common mapping strategies used in MLC schemes, as block labeling and Ungerbock labeling, are evaluated using MSD charts. An established transmission scheme for satellite broadcasting, European Satellite Digital Radio (ESDR) standard, is compared with the proposed MLC scheme, showing that the MLC scheme is able to work in lower SNR regions and provides more flexibility in designing the levels.

We derive new upper bounds on the minimum distance, which turbo codes can maximally attain with the optimum interleaver of a given length. The new bounds grow approximately logarithmically with the interleaver length, and they are tighter than all previously derived bounds for medium-length and long interleavers. An extensive discussion highlights the impacts of the new bounds in the context of interleaver design and provides some new design guidelines.

We give the asymptotic signal-to-interference ratio for the so-called widely linear minimum mean-squared error multiuser receiver for transmission of multiple users to a common receiver with DS-CDMA. Observing that widely linear multiuser detection virtually doubles the spreading factor, we show that transmission with real-valued channel symbols can lead to a higher spectral efficiency than with complex-valued channel symbols when each user employs its own complex-valued random spreading sequence.

An upper bound on the minimum distance of turbo codes is derived, which depends only on the interleaver length and the component scramblers employed. The derivation of this bound considers exclusively turbo encoder input words of weight 2. The bound does not only hold for a particular interleaver but for all possible interleavers including the best. It is shown that in contrast to general linear binary codes the minimum distance of turbo codes cannot grow stronger than the square root of the block length. This implies that turbo codes are asymptotically bad. A rigorous proof for the bound is provided, which is based on a geometric approach.

In this paper, new upper bounds on the maximum attainable minimum Hamming distance of turbo codes with arbitrary-including the best-interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, the code rate, and the scramblers employed in the encoder. Examples of the new bounds for particular turbo codes are given and discussed. The new bounds are tighter than all existing ones and prove that the minimum Hamming distance of turbo codes cannot asymptotically grow at a rate more than the third root of the codeword length.

Selected mapping (SLM) peak power reduction is distortionless as it selects the actual transmit signal from a set of alternative signals, which all represent the same information. Usually, the specific signal generation information needs to be transmitted and carefully protected against bit errors. Here, we propose an extension of SLM, which employs scrambling and refrains from transmitting explicit side information. Some additional complexity and nearly vanishing redundancy is introduced to achieve markedly improved transmit signal statistics. Even though SLM is applicable with any modulation, we concentrate on orthogonal frequency-division multiplexing (OFDM).

In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we can optimally decode simple turbo codes and compare the associated bit-error rate results to those of iterative algorithms.

By observing the structure of the decoder's trellis a new, non-iterative turbo-decoder based on a super-trellis structure is proposed, which exhibits the same decoding complexity as a conventional convolutional decoder possessing an identical number of trellis states. For the investigated half-rate, memory-length two code the proposed algorithm requires about 0.5 dB lower Gaussian channel signal-to-noise ratio (SNR) than the maximum a posteriori (MAP) algorithm using 16 iterations.