### Citations

557 |
Bit-interleaved coded modulation
- Caire, Taricco, et al.
- 1998
(Show Context)
Citation Context ...alphabets have been incorporated by application of the well known gap approximation, e.g. [12]. However, this approach still neglects the BICM system structure widely adapted in communication systems =-=[13]-=-. Recent research, hence, considers the BICM or parallel decoding capacity of a system promising a better performance estimate due to consideration of the interleaving and negligence of dependencies b... |

196 |
Numerical Recipes 3rd Edition: The Art of Scientific Computing
- Press, Teukolsky, et al.
- 2007
(Show Context)
Citation Context ...rmance of a coded system is considered. Furthermore, the resulting capacity expression can no longer be solved in closed form, even though an efficient numerical solution via Gauss-Hermite quadrature =-=[11]-=- is possible. Nevertheless, considering the bitwise capacity the BER/FER performance of a system can be described independently from the applied alphabet by the AMI of a code word [4][6]. This observa... |

177 |
A practical discrete multitone transceiver loading algorithm for data transmission over spectrally shaped channels
- Chow, Bingham
- 1995
(Show Context)
Citation Context ...ssian signalling as a quality indicator is widely used in literature and capacity losses due to finite symbol alphabets have been incorporated by application of the well known gap approximation, e.g. =-=[12]-=-. However, this approach still neglects the BICM system structure widely adapted in communication systems [13]. Recent research, hence, considers the BICM or parallel decoding capacity of a system pro... |

123 | A new loading algorithm for discrete multitone transmission - Fischer, Huber - 1996 |

96 | Optimal power allocation for parallel gaussian channels with arbitrary input distributions,”
- Lozano, Tulino, et al.
- 2006
(Show Context)
Citation Context ...024 subcarriers, LF = 10 channel taps, target FER of PTarget = 10 −2 vary strongly, which leads to severe performance losses if rounding to available code rates is exercised. Similarly, Lozano et al. =-=[14]-=- developed a closed form waterfilling solution dependent on the MMSE functions of the finite alphabets, which have to be numerically determined. This so called mercury waterfilling provides the optima... |

92 | Computationally efficient optimal power alloction algorithms for multicarrier communication systems
- Krongold, Ramchandran, et al.
- 1998
(Show Context)
Citation Context ...heuristic procedure to solve the optimisation problem approximately. Eq. (3) has been solved by the authors via expansion to coded systems of the well known bisection approach used by Krongold et al. =-=[1]-=-. The set of all rate-power pairs at a given BER/FER PTarget of all allowed transmission modes, employing SNR thresholds obtained from AWGN simulation as well as analytical expressions for uncoded M-Q... |

19 |
Designing MIMO communication systems: Constellation choice and linear transceiver design
- Palomar, Barbarossa
- 2005
(Show Context)
Citation Context ...rfect transmit CSI can be assumed, channel diagonalisation via singular value decomposition (SVD) is a well known approach shown to be almost optimal utilising waterfilling with the gap approximation =-=[15]-=- under the assumption of an uncoded transmission. Independent parallel spatial channels would again allow for the application of all previously discussed approaches. However, achieving full transmit C... |

11 |
Mutual-Information-Based Adaptive Bit-Loading Algorithms for LDPC-Coded OFDM
- Li, Ryan
(Show Context)
Citation Context ...mite quadrature [11] is possible. Nevertheless, considering the bitwise capacity the BER/FER performance of a system can be described independently from the applied alphabet by the AMI of a code word =-=[4]-=-[6]. This observation has motivated a class of algorithms, which will be described in Section 3.2. On the other hand, the issue of saturation still remains, especially for non-capacity approaching cod... |

8 |
Bossert,“Adaptive coding and modulation
- Stiglmayr, Klotz, et al.
- 2008
(Show Context)
Citation Context ...iculties in finding analytical expressions for the FER of coded systems, however, the simulated performance of different code and modulation combinations is often utilised to quantify the performance =-=[8, 10]-=-. The error rate constraint PTarget provides the necessary connection of power and rate to calculate a look-up table of the rate-power function, where only discrete points can be achieved. This provid... |

8 |
Capacity-based performance comparison of MIMO-BICM demodulators,”, in
- Fertl, Jalden, et al.
- 2008
(Show Context)
Citation Context ...h is computationally prohibitive. Using approximations, however, allows for a near optimal efficient solution [6]. Recent results on the capacity of MIMO systems with finite alphabets, e.g., [16] and =-=[17]-=-, may either be used to achieve lower complexity solutions adapting [6] to suboptimal receivers or to provide the necessary BICM capacities to apply SISO link adaptation schemes. Another quite straigh... |

7 | Efficient coded bit and power loading for BICM-OFDM,” in
- Bockelmann, W¨ubben, et al.
- 2009
(Show Context)
Citation Context ...iculties in finding analytical expressions for the FER of coded systems, however, the simulated performance of different code and modulation combinations is often utilised to quantify the performance =-=[8, 10]-=-. The error rate constraint PTarget provides the necessary connection of power and rate to calculate a look-up table of the rate-power function, where only discrete points can be achieved. This provid... |

4 |
Design of Near-Optimal Coding Schemes for Adaptive Modulation with Practical Constraints
- Sankar, Narayanan
- 2006
(Show Context)
Citation Context ...proach employs the construction of SNR look-up tables as pointed out before. A related solution has been proposed for MIMO systems by the authors [6]. Another idea has been developed by Sankar et al. =-=[5]-=-, who approximated the BICM capacities by simple exponential functions allowing the closed form derivation of a waterfilling scheme, which can be used to adapt the rate and power of a set of parallel ... |

3 | Rate loading in OFDM based on bit-level capacities - Stierstorfer, Fischer - 2008 |

3 |
Adaptive Interleaving and Modulation for BICM-OFDM
- Bockelmann, Kammeyer
- 2008
(Show Context)
Citation Context ...nt problem of error rate minimisation has been tackled by the authors with an algorithm that maximises the AMI of a code word for a single-input-single-output (SISO) system given an overall data rate =-=[9]-=-. Through this approach, no error rate requirement is needed as no power allocation beyond the reallocation of power from switched off subchannels is applied. Independently, Stiersdorfer et al. [7] pr... |

2 | Ensemble modem structure for imperfect transmission mead - Hartogs - 1988 |

2 |
Mutual Information based Rate Adaptation for MIMO-OFDM System with Finite Signal Alphabets
- Bockelmann, Wübben, et al.
- 2008
(Show Context)
Citation Context ...e quadrature [11] is possible. Nevertheless, considering the bitwise capacity the BER/FER performance of a system can be described independently from the applied alphabet by the AMI of a code word [4]=-=[6]-=-. This observation has motivated a class of algorithms, which will be described in Section 3.2. On the other hand, the issue of saturation still remains, especially for non-capacity approaching codes,... |

1 |
Mutual Information of V-BLAST Transmission
- Stiglmayr, Klotz, et al.
- 2008
(Show Context)
Citation Context ...ion, which is computationally prohibitive. Using approximations, however, allows for a near optimal efficient solution [6]. Recent results on the capacity of MIMO systems with finite alphabets, e.g., =-=[16]-=- and [17], may either be used to achieve lower complexity solutions adapting [6] to suboptimal receivers or to provide the necessary BICM capacities to apply SISO link adaptation schemes. Another quit... |

1 |
Adaptive Coding and Modulation in MIMO OFDMA Systems
- Stiglmayr, Klotz, et al.
- 2008
(Show Context)
Citation Context ...s can be seen, only a relatively small enhancement is possible, which may be expanded by a few iterations of link and filter adaptation. A similar approach regarding rate optimisation is presented in =-=[18]-=-. 5. Conclusion A variety of solutions to the resource allocation problem of coded adaptive systems has been discussed in this contribution, where two principle approaches have been identified. The BI... |