Figure 3 - uploaded by Markku J. Juntti
Content may be subject to copyright.
Source publication
A design method for recursive space-time trellis codes and parallel-concatenated space-time turbo coded modulation is proposed that can be applied to an arbitrary existing space-time trellis code. The method enables a large, systematic increase in coding gain while preserving the maximum transmit diversity gain and bandwidth efficiency property of...
Similar publications
With the growing interest in cell-free massive multiple-input multiple-output (MIMO) systems, the benefits of single-antenna access points (APs) versus multi-antenna APs must be analyzed in order to optimize deployment. In this paper, we compare various antenna system topologies based on achievable downlink spectral efficiency, using both measured...
This study presents an analysis of the capabilities of using multi‐user multiple input multiple output (MU‐MIMO) in indoor environments at the 3–4 GHz band through an empirical characterisation of the MU‐MIMO channel, obtaining a statistical description of the degree to which this specific multi‐user channel verifies the condition of ‘favourable pr...
This paper explores the feasibility of using the multiple-input multiple-output (MIMO) radio channel properties to passively detect and localize multiple humans in indoor environments. We propose to utilize the unique reverberation characteristics of indoor channels for the purpose of detecting, and the power angular delay profile (PADP) for locali...
With the growing interest in cell-free massive multiple-input multiple-output (MIMO) systems, the benefits of single-antenna access points (APs) versus multi-antenna APs must be analyzed in order to optimize deployment. In this paper, we compare various antenna system topologies based on achievable downlink spectral efficiency, using both measured...
The performance of wireless networks can be greatly influenced by the radiation pattern and polarization of the antennas at the nodes, especially when they are under non-line-of-sight (NLOS) channel environments. In this study, we designed a planar quasi-isotropic antenna based on the combination of a meandered electric dipole and an electrically s...
Citations
... transition in an encoder trellis is taken with equal probability, δ((p, q) → (p 1 , q 1 )) is the squared Euclidean distance when the correct path transits from p to p 1 and the erroneous path transits from q to q 1 . The exponent h is the Hamming distance vector [15] defined as follows. corresponding to the correct and erroneous codewords, respectively . ...
This work presents an enumerative technique to evaluate the distance spectrum of punctured turbo trellis coded modulation (TuCM) composed of two trellis coded modulation (TCM) component encoders connected in parallel via an interleaver. A matrix-based transfer function approach is employed to find the multiplicities of Hamming and Euclidean distances of input and output strings (distance spectrum) of each component TCM encoders after puncturing. An expurgated union bound on the bit error rate of TuCM schemes over the AWGN channel is computed using the distance spectrum. Comparisons with simulation results shows that the bound is tight in the range of the signal to noise of interest.
... As the requirement of higher data rates increases, communications systems with very high spectral efficiency need to be developed which rely on multiple antennas at the base station and the terminal. Space-time Turbo Coded Modulation (STTuCM) combines the properties of space-time transmission and turbo coded modulation [2], [3]. When combined with multi-carrier code division multiple access (MC-CDMA) or orthogonal frequency division multiplexing with time division multiple access (OFDM-TDMA) transmission it is especially suitable for high mobility vehicular environments. ...
It is foreseen that a single (wideband) air interface mode is not sufficient for achieving the high spectral efficiency targets set for next generation wireless system. A dual-bandwidth approach is adapted to simultaneously provide wide coverage and high capacity in a large range of different operating envi-ronments. In this paper, hybrid diversity-multiplexing scheme, where Space-time Turbo Coded Modulation (STTuCM) and layered space-time architectures are combined, is used as the air interface for the wide area communication to provide high spectral efficiency and robustness against spatial fading corre-lation. A system level performance study with different radio resource allocation functionalities applied to the proposed low bandwidth STTuCM orthogonal frequency division multiplexing air interface concept is conducted. The simulation results from the developed system level simulator indicate that the dynamic channel allocation (DCA) results in far better performance than the random allocation, especially in the case of frequency reuse factor one network. Moreover, the single frequency network with DCA performs equally well as the frequency reuse three network with DCA if the frequency resources are limited. Large system level gains can be achieved also if the suppression of structured inter-cell interference is utilized in all terminals. The results also show that transmission modes requiring large number of antennas at both sides of the communication link cannot be supported in the entire simulation scenario even if the frequency reuse of three is used.
... A design method for the recursive space-time trellis codes (Rec-STTrCs) and parallel concatenated space-time turbo coded modulation (STTuCM) applicable to an arbitrary STTrC from literature was recently introduced in [4]- [6] as a new framework for building optimized, low-complexity, large equivalent constraint-length space-time trellis codes. Applied to Takokh et al. space-time trellis codes (Tarokh-STTrCs) from [1] above design method enabled a large increase in the The research has been supported by Nokia, Elektrobit, Finnish Air Force, the National Technology Agency of Finland (Tekes) and Graduate School of Electronics, Telecommunications and Automation (GETA). ...
... The separation of interleaver on odd and even part prevails that all the input bits are equally protected. For more details and examples see [6]. ...
... To enable performance analysis tractable, we assume the maximum likelihood (ML) decoder here instead of the iterative decoder employed for simulations in [4]- [6]. We consider the probability that ML decoder decides in favor of the signal assuming that signal was transmitted. ...
A design method for recursive space-time trellis codes and parallel concatenated space-time turbo coded modulation was recently proposed as a new framework for building optimized, low-complexity, large equivalent constraint-length space-time trellis codes. In this paper the distance spectrum interpretation of the space-time turbo coded modulation is introduced to evaluate the union bound on the frame error rate over fast fading channels. The distance spectrum gives a good insight on the importance of multiplicities in the space-time coding design. Derived bounds are in some cases very tight and provide a designer with the practical tool for further optimization of the constituent space-time trellis codes within the space-time turbo coded modulation framework. Some interesting examples of the convergence of the sub-optimal iterative decoding were also presented.
... At FER 10 −2 , STTuCM outperforms Tarokh-STTrC by more than 3.5 dB and 6 dB for two and four independent fading blocks per frame, respectively. As seen from [25, 26], an increase in the frame size severely deteriorates the performance of Tarokh-STTrCs while increasing the frame size of STTuCM improves the performance on channels with a considerable amount of temporal diversity.Figure 9: Block-2, -4 fading, bandwidth efficiency 4 bit/s/Hz, 16QAM. ...
A design method for recursive space-time trellis codes and parallel-concatenated space-time turbo coded modulation is proposed that can be applied to an arbitrary existing space-time trellis code. The method enables a large, systematic increase in coding gain while preserving the maximum transmit diversity gain and bandwidth efficiency property of the considered space-time trellis code. Applying the above method to Tarokh et al. space-time trellis codes, significant performance improvements can be obtained even with extremely short input information frames. The application of space-time turbo coded modulation to the space-frequency domain is also proposed in this paper. Exploiting the bandwidth efficient orthogonal frequency division modulation (OFDM), multiple transmit antennas and large frequency selectivity offered by typical low mobility indoor environments, the proposed space-frequency turbo coded modulation performs within 2.5dB of the outage capacity for a variety of practical wideband multiple-input multiple-output (MIMO) radio channels.
... The performance bounds in [52] are based on the union bounds. In [53] two scenarios are considered by Tajkovic. The first one similar to [51], is the concatenation of two recursive space-time trellis codes in parallel and sending the coded data through two transmit antennas. ...
... In this thesis, the effects of novel MIMO techniques on spectral efficiency and error rate performance of a broadband MC-CDMA system are investigated. The goal is to study the utilization of single-antenna turbo coding [35,36] and recently proposed space-time turbo coded modulation (STTuCM) [23,[37][38][39] with the Bell Labs layered space-time (BLAST) architecture [26,28] in an MC-CDMA system. A sub-optimal iterative multiuser receiver is derived with iterative detection and decoding (IDD) to regain degraded receive diversity due to the spatial filtering. ...
... However, in a fast fading channel it is advantageous to use recursive STTrCs as constituent codes. A systematic way of producing recursive STTrCs from arbitrary non-recursive STTrCs was presented in [37,88]. Later on, research effort has been invested in the optimization of the constituent codes, resulting in a concept that is both bandwidth efficient and robust in different environments. ...
... The corresponding output of the component encoder e = 1, 2 is a tall matrix [23,38,39] The constituent codes for the ST turbo encoder used in [37,[86][87][88] are derived from the trellis diagrams of the original non-recursive STTrCs and are thus themselves presented by non-binary trellises. The encoding is therefore easy to implement by converting the binary input sub-sequences u(n) ∈ B k 0 to integers in F k 0 and then using the defined trellises to find the outputs and state transitions. ...
In this paper, the performance of two concatenated coding schemes is investigated over Nakagami fading channels. The concatenation coding scheme with iterative decoding involves convolutional code as the outer code and super-orthogonal space-time trellis code (SOSTTC) as the inner code. The pairwise error probability (PEP) for the two schemes were derived and their performances evaluated by computer simulation.
Hybrid concatenated code is a combination of parallel and serial concatenated codes. In this paper, two hybrid concatenated super-orthogonal space-time trellis code (SOSTTC) applying iterative decoding is proposed for flat fading channels. The encoding operation is based on the concatenation of convolutional codes, interleaving and super-orthogonal space-time trellis codes. The first concatenated scheme consists of a serial concatenation of a parallel concatenated convolutional code with a SOSTTC while the second consist of parallel concatenation of two serially concatenated convolutional and SOSTTC codes. The decoding of these two schemes is described and their bit error rate (BER) and frame error rate (FER) performance evaluated by computer simulation in Rayleigh fading channels. The proposed topologies are shown to perform better than existing concatenated schemes with constituent code of convoluntional and space time codes in literatures.
In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.
Recent advances in space-time coding and array processing have lead to substantial improvements in broadband wireless access systems. A design method for constituent recursive space-time trellis codes (Rec-STTrCs) and parallel concatenated space-time turbo coded modulation (STTuCM) was introduced recently as a new framework for building low complexity, large equivalent constraint-length STTrCs. In this paper, STTuCM is analyzed in terms of the two-dimensional distance spectrum (DS), the truncated union bound (UB) and the iterative decoding convergence. The derived bounds appeared to be tight over fast fading channels but rather optimistic over quasi-static fading channels. Nevertheless, the rank deficient part of the DS has been well enumerated, which turned out to be crucial for the accurate design of the full transmit diversity STTuCM in the second half of the paper. Modified design criteria for space-time (ST) codes over quasi-static and fast fading channels were further introduced to capture the joint effects of error exponents and multiplicities in the code's DS. A recursive systematic form with a primitive equivalent feed-backward polynomial was assumed for constituent codes (CCs) to assure good convergence of iterative decoding. The DS optimization produced new sets of CCs for STTuCM resulting in a robust ST coding scheme with improved performance over both quasi-static and fast fading channels. Full transmit diversity was achieved with no constrains on the implemented pseudo-random bit-wise odd-even information interleaving.
