Self-Concatenated Trellis Coded Modulation With Self-Iterative Decoding
Self-concatenated trellis coded modulation with b(q-1) interleavers is a concatenated coded scheme based on only one rate bq/n convolutional code.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Self-concatenated trellis coded modulation with b(q-1) interleavers is a concatenated coded scheme based on only one rate bq/n convolutional code.
In this paper, we consider two different methods for decoding convoluionally coded GMSK and FQPSK-B using iterative detection and comvined trellis decoding.
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.
An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.
A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.
A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.
A recursive algorithm using the error-trellis decoding technique is developed to decode convolutional codes (CCs). An example, illustrating the very large scale integration (VLSI) architecture of such a decode, is given for a dual-K CC. It is demonstrated that such a decoder can be realized readily on a single chip with metal-nitride-oxide-semiconductor technology.
In proposed communication system, digital signals transmitted efficiently over fading channel by combination of trellis coding and multiple-phase-shift keying with addition of asymmetry to signal set. Coding and modulation schemes not designed separately as in previous systems but integrated to yield bandwidth-efficient modulation and forward-error-correction coding. Helps to satisfy need for reliable high-quality transmission of voice and data between land-mobile units via satellites, where limitations of power and bandwidth imposed simultaneously. Also applicable to ionospheric communications between fixed or mobile units.
A recursive algorithm using the error-trellis decoding technique is developed to decode convolutional codes (CCs). An example, illustrating the very large scale integration (VLSI) architecture of such a decode, is given for a dual-K CC. It is demonstrated that such a decoder can be realized readily on a single chip with metal-nitride-oxide-semiconductor technology.
Some new short constraint length codes are described for satellite channels which are constant-envelope and which have spectral and energy efficiencies intermediate to other recent coded techniques, namely r = 2/3 coded 8-PSK and r = 3/4 coded 16-PSK. Two intervals of 8-PSK transmission are used to form a modulation base for r = 5/6 Trellis codes. A particularly attractive design is an eight-state code, producing 6.2 dB gain on the Gaussian channel over uncoded 8-PSK, yet sacrificing only 16 percent in spectral efficiency.
Digital transmission for satellite-based land mobile communications is discussed. To satisfy the power and bandwidth limitations imposed on such systems, a combination of trellis coding and continuous-phase modulated signals are considered. Some schemes based on this idea are presented, and their performance is analyzed by computer simulation. The results obtained show that a scheme based on directional detection and Viterbi decoding appears promising for practical applications.
The effect of finite interleaver size on bit error rate (BER) performance of coded 8-DPSK is determined by means of computer simulations. The losses evaluated in this way include the SNR degradation due to the timing and frequency errors of the symbol synchronizer and the automatic frequency control (AFC) of the receiver. BER measurements are presented using a conventional 2/3 rate convolutional 8-state trellis-code for typical Rayleigh and Rician fading channels. It is shown that for a Rician channel with a Rician parameter of 7 dB, a Doppler spread of 100 Hz and a data rate of 2400 bps, an interleaver with size 16 x 16 symbols performs nearly as well as a very large interleaver. It is also shown that for very fast Rayleigh channels, the BER-curves flatten out at large SNR.
Digital real-time modem processes octuple differential-phase-shift-keyed trellis-coded modulation. Intended for use in communicating data at rate up to 4.8 kb/s in land-mobile satellite channel (Rician fading) of 5-kHz bandwidth at carrier frequency of 1 to 2 GHz. Modulator and demodulator contain digital signal processors performing modem functions. Design flexible in that functions altered via software. Modem successfully tested and evaluated in both laboratory and field experiments, including recent full-scale satellite experiment. In all cases, modem performed within 1 dB of theory. Other communication systems benefitting from this type of modem include land mobile (without satellites), paging, digitized voice, and frequency-modulation subcarrier data broadcasting.
It is demonstrated how the use of interleaving/deinterleaving in trellis-coded modulation (TCM) systems can reduce the signal-to-noise ratio loss due to imperfect carrier demodulation references. Both the discrete carrier (phase-locked loop) and suppressed carrier (Costas loop) cases are considered and the differences between the two are clearly demonstrated by numerical results. These results are of great importance for future communication links to the Deep Space Network (DSN), especially from high Earth orbiters, which may be bandwidth limited.
High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other, the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. This information is used to erase unreliable bits in the decoded output. An errors-and-erasures RS decoder is then used for the outer code. The two schemes have been proposed for high-speed data communication on NASA satellite channels. The rates considered are at least double those used in current NASA systems, and the results indicate that high system reliability can still be achieved.
Theoretical gain over simple multiple-phase-shift keying at least 2 to 3 decibels. Multiple-trellis-coded modulation scheme combined with M-ary modulation shows theoretically to yield asymptotic gains in performance over uncoded multiple-phase-shift keying, while employing symmetric multiple-phase-shift signal constellations and avoiding code catastrophe. Suitable for satellite and terrestrial-mobile/satellite communications or other communications requiring burst-error correction. Extended to such higher dimensional modulations as quadrature amplitude modulation.
A differential detection for MPSK, which uses a multiple symbol observation interval, is presented and its performance analyzed and simulated. The technique makes use of maximum-likelihood sequence estimation of the transmitted phases rather than symbol-by-symbol detection as in conventional differential detection. As such the performance of this multiple symbol detection scheme fills the gap between conventional (two-symbol observation) differentially coherent detection of MPSK and ideal coherent of MPSK with differential encoding. The amount of improvement gained over conventional differential detection depends on the number of phases, M, and the number of additional symbol intervals added to the observation. What is particularly interesting is that substantial performance improvement can be obtained for only one or two additional symbol intervals of observation. The analysis and simulation results presented are for uncoded and trellis coded MPSK.
A 2L-dimensional multiple phase-shift keyed (MPSK) (L x MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L x MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper. Trellis-coded L x 4PSK, L x 8PSK, and L x 16PSK modulation schemes are found for L = 1-4 and a variety of code rates and decoder complexities, many of which are fully transparent to discrete phase rotations of the signal set. The new codes achieve asymptotic coding gains up to 5.85 dB.