Cart (Loading....) | Create Account
Close category search window
 

Use of σ-trees as constellations in trellis-coded modulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zaidan, M.Y. ; Commetrex Corp., Norcross, GA, USA ; Barnes, C.F. ; Wicker, S.B.

Sigma-trees (σ-trees) are a class of geometric structures that include lattices as a constrained special case. These structures allow for signal sets, in spaces of arbitrary dimension, that are more spherical in shape than signal sets based on lattices. In this correspondence, it is shown that σ-trees can be used in the construction of non-lattice trellis-coded modulation schemes (TCM) schemes. A low-complexity σ-tree encoder is presented for multidimensional TCM codes. An optimal TCM decoder that uses the efficient sequential search property of σ-trees is then described. Simulation results based on one- and two-dimensional examples are used to show that the performance of σ-tree-based codes is comparable to that provided by conventional lattice-based codes

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 6 )

Date of Publication:

Nov 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.