• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Finite State Systems in Mobile Communications (1996)

by W Zhang
Add To MetaCart

Tools

Sorted by:
Results 1 - 7 of 7

Channel Estimation Strategies for Coded MIMO Systems

by Rose Trepkowski, Rose Trepkowski, Committee Chairman, Dr. Brian Woerner , 2004
"... High transmission data rate, spectral efficiency, and reliability are necessary for future wireless communications systems. In a multipath-rich wireless channel, deploying multiple antennas at both the transmitter and receiver achieves high data rate, without increasing the total transmission power ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
High transmission data rate, spectral efficiency, and reliability are necessary for future wireless communications systems. In a multipath-rich wireless channel, deploying multiple antennas at both the transmitter and receiver achieves high data rate, without increasing the total transmission power or bandwidth. When perfect knowledge of the wireless channel conditions is available at the receiver, the capacity has been shown to grow linearly with the number of antennas. However, the channel conditions must be estimated since perfect channel knowledge is never known a priori. In practice, the channel estimation procedure can be aided by transmitting pilot symbols that are known at the receiver. System performance depends on the quality of channel estimate, and the number of pilot symbols. It is desirable to limit the number of transmitted pilot symbols because pilot symbols reduce spectral efficiency. This thesis analyzes the system performance of coded multiple-input multiple-output (MIMO) systems for the quasi-static fading channel. The assumption that perfect channel knowledge is available at the receiver must be removed, in order to more accurately
(Show Context)

Citation Context

... Figure 2.3 (a) shows the Ungerboeck set partitioning mapping. Figure 2.3 (b) shows Gray coded mapping. Figure 2.3 (c) shows the Vmapper. The V-mapper combines set partitioning and Gray coded mapping =-=[15]-=-. The set partitioning and V-mapper constellations obey the design rules, based on the maximization of Euclidean distance, originally described by Ungerboeck [13]. On the other hand, the Gray coded ma...

Computation of the active distances for trellis coded modulation

by B. Baumgartner, A. Hof, M. Bossert - in Proceedings 5th International ITG Conference on Source and Channel Coding , 2004
"... Recently, the concept of active distances, originally introduced for binary convolutional codes, was extended to the case of nonlinear trellis coded modulation. These distance measures allow an improved evaluation of the error correcting capability for trellis codes. Typically, the larger the slope ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Recently, the concept of active distances, originally introduced for binary convolutional codes, was extended to the case of nonlinear trellis coded modulation. These distance measures allow an improved evaluation of the error correcting capability for trellis codes. Typically, the larger the slope of the active distances the better the performance of the trellis code for low . Moreover, these distance measures are of particular interest for the design of concatenated coding schemes, with respect to the choice of the inner trellis code as well as the interleaver. In this paper we present a matrix based method to compute the active distances for trellis codes in Euclidean space, encoded by an -state finite state machine. The computation is based on a simplified version of the distance generating matrix, which is well known from the calculation of the distance spectrum of trellis codes. In general the distance generating matrix is of size . We show that for trellis codes, encoded by an -state FSM, the distance generating matrix can always be reduced to fiffflffi !"ff. Finally, simulation results are presented that confirm the importance of the active distances. 1
(Show Context)

Citation Context

...g to (1) is given by P 3 4Y 9 4[ 3 4\ S 2.2 Distance Generating Matrix After a short discussion about some general things concerning the distance generating matrix [6], =-=[11]-=-, we introduce a simplified version of this distance generating matrix, which is sufficient to compute the active distances. To analyze the distance properties of a trellis code, two FSM encoders have...

On the Slope of the Active Distances for Trellis Coded Modulation

by B. Baumgartner, A. Hof, M. Bossert
"... Abstract — The slope is the asymptotic growth rate of the active distances which are of particular interest for the design of trellis coded modulation schemes and concatenated codes. The higher the slope (growth rate) of the active burst distance, the better the error correcting capability of the co ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract — The slope is the asymptotic growth rate of the active distances which are of particular interest for the design of trellis coded modulation schemes and concatenated codes. The higher the slope (growth rate) of the active burst distance, the better the error correcting capability of the code. In this paper we introduce the slope as a new parameter for trellis coded modulation and present a matrix based method for its computation. The example of a trellis code based on asymmetric 4ASK will be used to illustrate the computation and the optimization of the slope. Simulation results confirm the improved error correcting capability for trellis codes with high slope. I.
(Show Context)

Citation Context

...> V G [ [ G G G M G G t T B. Distance Generating FSM/Matrix In order to analyze the distance properties of a trellis code we have to look at two FSMs, namely the encoder FSM \ ^ and the decoder FSM \ =-=[4]-=-. We consider the two FSMs to ^ be identical, and therefore, we assume perfect maximum likelihood sequence estimation (MLSE). The distance generating FSM can be derived from a combination of the encod...

On Optimal TCM Encoders

by Alex Alvarado, Alexandre Graell i Amat, Fredrik Brännström, Erik Agrell , 2014
"... ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract not found

On Distance Measurement Methods for Turbo Codes

by Youssouf Ould Cheikh Mouhamedou , 2005
"... New digital communication applications, such as multimedia, require very powerful error correcting codes that deliver low error rates while operating at low to moderate signal-tonoise ratios (SNRs). Turbo codes have reasonable complexity and can achieve very low error rates if a proper interleaver ..."
Abstract - Add to MetaCart
New digital communication applications, such as multimedia, require very powerful error correcting codes that deliver low error rates while operating at low to moderate signal-tonoise ratios (SNRs). Turbo codes have reasonable complexity and can achieve very low error rates if a proper interleaver design is in place. The use of well-designed interleavers result in very low error rates, especially for medium to long interleavers where turbo codes offer the greatest potential for achieving high minimum distance (dmin) values. The reliable determination of a code’s error performance at very low error rates using simulations may take months or may not be practical at all. However, the knowledge of dmin and its multiplicities can be used to estimate the error rates at high SNR. This thesis is concerned with efficient and accurate distance measurement methods for turbo codes. Since high values of dmin can be caused by high input weight values, say up to 20 or higher, if a brute force algorithm is used the accurate determination of dmin requires that all possible input sequences of input weight up to 20 be tested. Testing all possible input

Distance Spectrum Calculation of Symbol Punctured Trellis Coded Modulation

by Axel Hof
"... Abstract — A special kind of symbol-wise puncturing is applied to the code symbols of a constituent trellis coded modulation (TCM) within two very bandwidth-efficient concatenated coding schemes namely staggered TCM and parallel concatenated TCM. There exist methods to determine the minimum squared ..."
Abstract - Add to MetaCart
Abstract — A special kind of symbol-wise puncturing is applied to the code symbols of a constituent trellis coded modulation (TCM) within two very bandwidth-efficient concatenated coding schemes namely staggered TCM and parallel concatenated TCM. There exist methods to determine the minimum squared Euclidean distance of TCM for this special puncturing but they are only applicable to a limited number of TCM encoders with certain restrictions in code design. In this work, we present a general approach to calculate the distance spectrum of arbitrary TCM with symbol-wise puncturing. Thus, a deeper analysis of the error correcting capability of the underlying code is possible. I.
(Show Context)

Citation Context

... to further reduce the state space of the DGFSM B by exploiting certain symmetries such as geometrical uniformity [10] or linearity. An algorithm for state space minimization is given for instance in =-=[11]-=- and it is based on [6]. In order to derive the DGM, we define the Hamming distance between two symbols u =(u0u1 ...ub−1) ∈ IF b 2 and û =(û0û1 ...ûb−1) ∈ IF b 2 as d H ∑b−1 (u, û) = uτ ⊕ ûτ (2) τ=0 w...

Extended Transfer Bound Error Analysis for Parametric Channel with Continuous Valued Correlated Random Nuisance Parameter

by Jan Včelák, Jan Sýkora
"... Abstract. In this paper we address the extended use of transfer bound analysis of bit error rate (BER) properties. In conjunction with proper parameter modeling, we offer a method to resolve the problem of transfer bound applicability on a system with random and possibly correlated continuous valued ..."
Abstract - Add to MetaCart
Abstract. In this paper we address the extended use of transfer bound analysis of bit error rate (BER) properties. In conjunction with proper parameter modeling, we offer a method to resolve the problem of transfer bound applicability on a system with random and possibly correlated continuous valued nuisance parameters. We introduce a new additional parameter space into the original error space and join them in a product matrix for an extended transfer function evaluation. Example applications with simple trellis code for Rayleigh fading channel and phase synchronization error are investigated to demonstrate the functionality of the proved principle. Computer simulation results are presented for two different codes and various fading scenarios, and comparisons are made among analytical and measured system error performances.
(Show Context)

Citation Context

...starts to follow the different path from the encoder. Where the brute force search for moderate number of such error events is not numerically tractable, transfer bound (TB) offers a partial solution =-=[4]-=-. TB models an error system as a finite state machine (FSM) and applies the results from FSM theory to searching in its probabilistic state diagram. This work is a follow-up to our recent conference p...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University