Home DE ES FR


Advanced Search

Our On-Line PhDs

Submit a Thesis
My Account Register Help

About
Fields
Mathematics and Applications
Information and Communication Sciences and Technologies
Physics, Optics
Materials Science, Mechanics and Mechanical Engineering
Fluid Mechanics and Energy
Chemistry, Physical Chemistry and Chemical Engineering
Life Sciences and Engineering
Earth Sciences and Environmental Engineering
Sciences of Economy, Management and Society
Decoding Algorithms for Some Non-Coherent Space-Time Codes

Cipriano, Antonio Maria (2005) Decoding Algorithms for Some Non-Coherent Space-Time Codes. PhD thesis communications et electronique, ENST - COMELEC Communication et Electronique, ENST.

Full text available as:

- these_Cipriano.pdf ( 1916 Kb )
Licence: Copyright

Abstract

This thesis is composed of two parts, the most important one deals with space-time block coding and decoding for systems in which no channel knowledge is available at the receiver and at the transmitter. We focus on a particular family of non-coherent space-time block codes, obtained by a non-linear map called the exponential map.
This part is composed of four chapters.
In Chapter 2, we introduce the channel model. Basic mathematical tools, results on non-coherent space-time codes and previous propositions are also recalled.
In Chapter 3, an in-depth investigation of non-coherent space-time codes obtained via the exponential map is carried out. We explain the geometrical interpretation of this coding procedure and we solve some open problems on code design.
In Chapter 4, we propose a new simplified decoder for the case of one transmit antenna and many receive antennas. Discussion on the expected complexity and parameters of the decoder are detailed, as well as simulations and comparisons with other propositions.
In Chapter 5, we propose two simplified decoders in the general multiple antenna case. Discussion about the expected complexity and about decoder parameters is provided. Simulations and comparisons conclude this chapter.
The second part of the thesis is composed of Chapter 6, which deals with CPM signal decompositions in PAM pulses. CPM is a non-linear modulation, while signal decomposition as a linear combination of waveforms can simplify the code and receiver design both for coherent and non-coherent systems.
A final conclusion is reported.
A summary of the thesis in french is provided in Chapter 1.

Item Type:PhD Thesis (PhD)
Thesis Supervisor:Rodriguez Guisantes, Georges and Cariolaro, Gianfranco
Date:2005
Board of examiners:Elia, Michele and Caire, Giuseppe and Rodriguez Guisantes, Georges and Cariolaro, Gianfranco
Ecole Doctorale:ED 130 INFORMATIQUE, TELECOMMUNICATIONS ET ELECTRONIQUE (EDITE)
Discipline:communications et electronique
Collection (Fonds):ENST
Institution:ENST
Department:ENST - COMELEC Communication et Electronique
Subjects:2. Information and Communication Sciences and Technologies
Uncontrolled Keywords:Decoding, Space-time code, Non coherent, Non-coherent, Grassmannian, Differential manifold, Grassmann manifold, Nonlinear coding, PAM decomposition, Cpm, Décodage, Code espace-temps, Systèmes non-cohérents, Grassmannien, décomposition PAM, Codage non-linéaire, signaux CPM, Modulation espace-temps, Variété différentielle

References

[1] E. Biglieri, J. Proakis, and S. S. (Shitz), "Fading channels: Information-theoretic and communications aspects," IEEE Trans. Inform. Theory, vol. 44, no. 6, pp.
2619 -2692, October 1998.
[2] E. Biglieri, G. Caire, and G. Taricco, "Limiting performance for block-fading channels with multiple antennas," IEEE Trans. on Inform. Theory, vol. 47, no. 4, pp. 1273-1289, May 2001.
[3] G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Johns Hopkins
University Press, 1996, ISBN 0-8018-5414-8.
[4] A. Edelman, T. A. Arias, and S. T. Smith, "The Geometry of Algorithms with
Orthogonality Constraints," Siam J. Matrix Anal. Appl., vol. 20, no. 2, pp. 303-
353 , 1998.
[5] A. Barg and D. Y. Nogin, "Bounds on packings in the Grassmann manifold,"
IEEE Trans. Inform. Theory, vol. 48, no. 9, pp. 2450-2454, Sep. 2002.
[6] D. Warrier and U. Madhow, "Spectrally Efficient Noncoherent Communication,"
IEEE Trans. Inform. Theory, vol. 48, no. 3, pp. 651-668, March 2002.
[7] A. Lapidoth and P. Narayan, "Reliable Communications Under Channel Uncertainty,"
IEEE Trans. on Inform. Theory, vol. 44, no. 6, pp. 2148-2177, October
1998.[8] J. G. Proakis, Digital Communications, 4th ed. McGraw-Hill, 2000.
[9] B. M. Hochwald and T. L. Marzetta, "Unitary Space-Time Modulation for
Multiple-Antenna Communications in Rayleigh Flat Fading," IEEE Trans. Inform.
Theory, vol. 46, no. 2, pp. 543-564, March 2000.
[10] A. Dogandži`c, "Chernoff Bounds on Pairwise Error Probabilities of Space-Times
Codes," IEEE Trans. Inform. Theory, vol. 49, no. 5, pp. 1327-1336, May 2003.
[11] M. Brehler and M. K. Varanasi, "Asymptotic Error Probability Analysis of
Quadratic Receivers in Rayleigh-Fading Channels with Applications to a Unified Analysis of Coherent and Noncoherent Space-Time Receivers," IEEE Trans.
Inform. Theory, vol. 47, pp. 2383-2399, Sep. 2001.
[12] V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communications: Performance Criterion and code construction,"
IEEE Trans. Inform. Theory, vol. 44, no. 2, pp. 744-765, March 1998.
[13] D. Agrawal, T. J. Richardson, and R. L. Urbanke, "Multiple-Antenna Signal Constellations for Fading Channels," IEEE Trans. Inform. Theory, vol. 47, no. 6, pp.
2618 -2626, September 2001.
[14] R. H. Gohary and T. N. Davidson, "Non-Coherent MIMO Communication:
Grassmannian Constellation and Efficient Detection," in Proc. of the International
Symposium of Information Theory 2004 (ISIT2004), Chicago, USA, June
27 - July 2 2004, p. 65.
[15] M. L. McCloud, M. Brehler, and M. K. Varanasi, "Signal Design and Convolutional
Coding for Noncoherent Space-Time Communication on the BlockRayleigh-Fading Channel," IEEE Trans. Inform. Theory, vol. 48, no. 5, pp. 1186-
1194 , May 2002.
[16] M. Brehler and M. K. Varanasi, "Training-Codes for the Noncoherent MultiAntenna Block-Rayleigh-Fading Channel," in Proc. of the Conf. Inform. Sciences and Systems, Johns Hopkins University, March 2003.
[17] M. J. Borran, A. Sabharwal, and B. Aazhang, "On Design Criteria and Construction of Noncoherent Space-Time Constellations," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2332-2351, October 2003.
[18] B.M. Hochwald, T. L.Marzetta, T. J. Richardson,W. Sweldens, and R. Urbanke,
"Systematic design of Unitary Space-Time Constellations," IEEE Trans. Inform.
Theory, vol. 46, no. 6, pp. 1962-1973, September 2000.
[19] Y. Jing and B. Hassibi, "Unitary Space-TimeModulation via Cayley Transform,"
IEEE Trans. Signal Processing, vol. 51, no. 11, pp. 2891-2904, Nov. 2003.
[20] J. Wang, X. Wang, and M. Madihian, "Optimum Design of Noncoherent Cayley
Unitary Space-Time Codes," IEEE Trans. Wireless Commun., submitted for pubblication, 2004.
[21] I. Kammoun, "Codage Spatio-temporel sans connaissance à priori du canal,"
Ph.D. dissertation, Ecole Nationale Supérieure des Télécommunications, Paris,
2004.[22] I. Kammoun and J.-C. Belfiore, "A new family of Grassmannian space-time codes for non-coherent MIMO systems," IEEE Comm. Letters, vol. 7, pp. 528-
530 , Nov. 2003.
[23] V. Tarokh and I.-M. Kim, "Existence and Construction of Noncoherent Unitary
Space-Time Codes," IEEE Trans. Inform. Theory, vol. 48, no. 12, pp. 3112-3117,
December 2002.
[24] W. Zhao, G. Leus, and G. Giannakis, "Orthogonal design of unitary constellations for uncoded and trellis coded non-coherent space-time systems," IEEE Trans.
Inform. Theory, vol. 50, no. 6, pp. 1319-1327, June 2004.
[25] F. Oggier, N. Sloane, A. Calderbank, and S. Diggavi, "Nonintersecting
Subspaces Based on Finite Alphabets," submitted to IEEE Trans. Inform.
Theory. [Online]. Available: http://www.research.att.com/~njas/
[26] P. Dayal, M. Brehler, and M. K. Varanasi, "Leveraging coherent space-time codes for noncoherent communication via training," IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 2058-2080, September 2004.
[27] H. E. Gamal and M. O. Damen, "Universal Space-Time Coding," IEEE Trans.
Inform. Theory, vol. 49, no. 5, pp. 1097-1119, May 2003.
[28] H. E. Gamal, D. Aktas, and M. O. Damen, "Coherent Space-Time Codes for
Noncoherent Channels," in Proc. IEEE Global Telecommunications Conference,
San Francisco, CA, December 7-10 2003.
[29] ——, "Noncoherent Space-Time Coding: an Algebraic Perspective," IEEE
Trans. Inform. Theory, submitted for pubblication, 2003.
[30] L. Zheng and D. N. C. Tse, "Communication on the Grassmann Manifold: A Geometric
Approach to the Noncoherent Multiple-Antenna Channel," IEEE Trans.
Inform. Theory, vol. 48, no. 2, pp. 359-383, February 2002.
[31] I. Kammoun and J.-C. Belfiore, "Grassmann-based signal design for noncoherent reception," in Proc. of the IV IEEE International Workshop on Signal Processing
Advances for Wireless Communications (SPAWC2003), Rome, Italy, June 2003, pp. 564-568.
[32] M. O. Damen, A. Tewfik, and J.-C. Belfiore, "A Construction of a Space-Time
Code Based on Number Theory," IEEE Trans. Inform. Theory, vol. 48, no. 3, pp.
753 -760, Mar. 2002.
[33] J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The Golden Code: a
2 × 2 Full-Rate Space-Time Code with Non-Vanishing Determinants,"
IEEE Trans. Inform. Theory, submitted for publication. [Online]. Available: http://www.comelec.enst.fr/~belfiore/
[34] P. A. Laurent, "Exact and approximate construction of digital phase modulations by superposition of amplitude modulated pulses," IEEE Trans. Commun., vol. 34, pp. 150-160, February 1986.
[35] U. Mengali and M. Morelli, "Decomposition of M-ary CPM Signals into PAM
Waveforms," IEEE Trans. Inform. Theory, vol. 41, pp. 809-820, September 1995.
[36] X. Huang and Y. Li, "The PAM Decomposition of CPM Signals with Integer
Modulation Index," IEEE Trans. Commun., vol. 51, pp. 543-546, April 2003.
[37] G. Colavolpe and R. Raheli, "Reduced-Complexity detection and phase synchronization of CPM Signals," IEEE Trans. Commun., vol. 45, pp. 1070-1079,
September 1997.
[38] ——, "Noncoherent Sequence Detection," IEEE Trans. Commun., vol. 47, pp.
1376 -1385, September 1999.
[39] G. K. Kaleh, "Simple coherent receivers for partial response continuous phase modulation," IEEE J. Select. Areas Commun., vol. 7, pp. 1427-1436, September
1989.[40] A. N. D'Andrea, A. Ginesi, and U. Mengali, "Frequency detectors for CPM signals,"
IEEE Trans. Commun., vol. 43, pp. 1828-1837, Feb.-Mar.-Apr. 1995.
[41] T. L. Marzetta and B. M. Hochwald, "Capacity of a Mobile Multiple-Antenna
Communication Lynk in Rayleigh Flat Fading," IEEE Trans. Inform. Theory, vol. 45, no. 1, pp. 139-157, Jan. 1999.
[42] R. G. Gallager, Information Theory and Reliable Communications. New York:
Wiley, 1968.
[43] L. H. Ozarow, S. Shamai, and A. D. Wyner, "Information Theoretic Considerations for Cellular Mobile Radio," IEEE Trans. Inform. Theory, vol. 43, no. 2, pp.
359 -378, May 1994.
[44] E. Telatar, "Capacity of multi-antenna gaussian channels," European Transaction on Telecommunications (ETT), vol. 10, no. 6, November/December 1999.
[45] L. Zheng, "Diversity-Multiplexing Tradeoff: A Comprehensive View of Multiple
Antenna Systems," Ph.D. dissertation, University of California, Berkeley, 2002.
[Online]. Available: http://web.mit.edu/lizhong/www/
[46] I. C. Abou-Faycal, M. D. Trott, and S. Shamai, "The capacity of discrete-time rayleigh-fading channels," IEEE Trans. Inform. Theory, vol. 47, no. 4, pp. 1290-
1301 , May 2001.
[47] G. Taricco and M. Elia, "Capacity of fading channel with no side information,"
IEE Electron. Lett., vol. 33, no. 16, pp. 1368-1370, July 1997.
[48] B. Hassibi and T. L.Marzetta, "Multiple-Antennas and isotropically random unitary inputs: the received signal density in closed form," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1473-1484, June 2002.
[49] L. Zheng and D. N. C. Tse, "Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels," IEEE Trans. Inform. Theory, vol. 49, no. 5, pp.
1073 -1096, May 2003.
[50] G. Bauch, "Introduction to Multi-Antenna Systems and Space-Time Codes," in
Proc. of the 3rd International Workshop on Commercial Radio Sensors and Communication
Techniques, Linz, Austria, Aug. 2001, pp. 50-56.
[51] S. Siwamogsatham, M. P. Fitz, and J. H. Grimm, "A New View of Performance
Analysis of Transmit Diversity Schemes is Correlated Rayleigh Fading," IEEE
Trans. Inform. Theory, vol. 48, no. 4, pp. 950-956, April 2002.
[52] D. Tse and P. Viswanatan, "Fundamentals of Wireless Communication Course
Notes," Fall 2002, U.C. Berkeley.
[53] A. Paulraj, R. Nabar, and D. Gore, Introduction to Space-Time Wireless Communications.
Cambridge Univ. Press, May, 2003.
[54] S. M. Alamouti, "A simple transmit diversity technique for Wireless Communications,"
IEEE J. Select. Areas Commun., vol. 16, no. 8, pp. 1451-1458, October
1998.[55] A. Paulraj and C. B. Papadias, "Space-Time Processing for Wireless Communications,"
IEEE Signal Processing Mag., vol. 14, no. 5, pp. 49-83, November
1997.[56] S. G. Wilson, Digital modulation and coding. Prentice Hall, 1996.
[57] J. H. Conway, R. H. Hardin, and N. J. A. Sloane, "Packing Lines, Planes, etc.:
Packings in Grassmannian Spaces," Experimental Mathematics, vol. 5, no. 2, pp.
139 -159, 1996.
[58] T. M. Cover, J. A. Thomas, Elements of Information Theory. New York: Wiley,
1991.[59] T. L. Marzetta, B. Hassibi, and B. M. Hochwald, "Structured Unitary Space-
Time Autocoding Constellations," IEEE Trans. Inform. Theory, vol. 48, no. 4, pp. 942-950, April 2002.
[60] E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest Point Search in Lattices,"
IEEE Trans. Inform. Theory, vol. 48, pp. 2201-2214, Aug. 2002.
[61] B. Hassibi and B.M. Hochwal, "Cayley Differential Unitary Space-Time Codes,"
IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1485-1503, June 2002.
[62] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal-designs," IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 744-765,
July 1999.
[63] B. Hassibi and B. M. Hochwald, "How much Training is Needed in MultipleAntenna Wireless Links?" IEEE Trans. Inform. Theory, vol. 49, no. 4, pp. 951-
963 , April 2003.
[64] E. Viterbo and J. Boutros, "A universal Lattice Decoder for Fading Channels,"
IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.
[65] M. O. Damen, H. E. Gamal, and G. Caire, "On Maximum-Likelyhood Detection and the Search for the Closest Lattice Point," IEEE Trans. Inform. Theory, vol. 49, pp. 2389-2402, Oct. 2003.
[66] B. Hassibi and H. Vikalo, "On the Sphere Decoding Algorithm. I. Expected Complexity,"
IEEE Trans. Signal Processing, submitted for pubblication.
[67] H. Vikalo and B. Hassibi, "On the Sphere Decoding Algorithm. II. Generalizations,
Second Order Statistics, and Applications to Communications," IEEE
Trans. Signal Processing, submitted for pubblication.
[68] R. A. Horn and C. J. Johnson, Matrix Analysis. New York: Wiley, 1958.
[69] N. Benvenuto and G. Cherubini, Algorithms for Communications Systems and their applications. Wiley, 2003.
[70] F. W. Warner, Foundations of Differentiable Manifolds and Lie Groups. Scott,
Foresman and Company, 1971.
[71] S. A. Gaal, Linear Analysis and Representation Theory. Springer-Verlag, 1973.
[72] Wolfram, "Mathworld," maintained by Eric Weisstein. [Online]. Available: http://mathworld.wolfram.com
[73] M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions. New
York: Dover Publications, 1972.
[74] W. Sweldens, "Fast Block Noncoherent Decoding," IEEE Commun. Lett., vol. 5, no. 4, pp. 132-134, April 2001.
[75] C. M. Monti, G. Pierobon, Esercitazioni di Teoria della Probabilità: Vettori
Aleatori. Padova: Progetto, 1992, in italiano.
[76] Steven M. Kay, Fundamentals of statistical signal processing: detection theory.
Upper Saddle River, NJ: Prentice Hall, 1998.
[77] J. Boutros, N. Gresset, L. Brunel, and M. Fossorier, "Soft-input soft-output lattice sphere decoder for linear channels," in Globecom'03, Linz, Austria, August
2001 , pp. 50-56.
[78] F. Oggier and E. Viterbo, "Algebraic Number Theory and its Applications to code design of Rayleigh fading channels," 2004, book to be published.
[79] J.-C. Belfiore and G. Rekaya, "Quaternionic lattices for space-time coding," in
Proc. of the Information Theory Workshop (ITW 2003), Paris. France, March
2004. [Online]. Available: http://www.comelec.enst.fr/~rekaya/
[80] F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect Space Time
Block Codes," IEEE Trans. Inform. Theory, submitted for publication. [Online].
Available: http://www.comelec.enst.fr/~rekaya/
[81] E. Bayer-Fluckiger, F. Oggier, and E. Viterbo, "New Algebraic Constructions of Rotated Zn-Lattice Constellations for the Rayleigh Fading Channel," IEEE
Trans. Inform. Theory, vol. 50, no. 4, pp. 702-714, April 2004.
[82] N. Rydbeck, T. Aulin, and C. W. Sundberg, "Continuous Phase Modulation: Part
I and II," IEEE Trans. Commun., vol. COM-29, pp. 196-225, March 1981.
[83] T. Aulin, J. B. Anderson, and C. W. Sundberg, Digital Phase Modulation. New
York: Plenum, 1986.
[84] J. H. Lodge and M. L. Moher, "Maximum-Likelihood Sequence estimation of
CPM signals transmitted over Rayleigh Flat-Fading Channels," IEEE Trans.
Commun., vol. 41, no. 6, pp. 787-794, January 1990.
[85] X. Zhang and M. P. Fitz, "Space-time code design with continuous phase modulation,"
IEEE J. Select. Areas Commun., vol. 21, no. 5, pp. 783-792, September
2003.[86] J. B. Anderson and C. E. W. Sundberg, "Advances in constant envelope coded modulation," IEEE Commun. Mag., vol. 29, pp. 36-45, December 1991.
[87] M. K. Simon and D. Divsalar, "Maximum-Likelihood Block Detection of Noncoherent
Continuous Phase Modulation," IEEE Trans. Commun., vol. 41, no. 1, pp. 90-98, January 1993.
[88] G. K. Kaleh, "Differential Detection via the Viterbi Algorithm for offset modulation and MSK-type signals," IEEE Trans. Veh. Technol., vol. 41, pp. 401-406,
November 1992.
[89] G. Cariolaro and A. M. Cipriano, "An Equivalence Principle for Separable CPM
Signals," in Proc. 15th IEEE Intl. Symp. on Personal, Indoor and Mobile Radio
Communications (PIMRC'04), vol. 2, Barcelona, Spain, September 2004, pp.
1347 -1350.
[90] E. Obetti, "The Decomposition of CPM Signals into PAM Waveforms," Ph.D.
dissertation, University of Padua, Padua, Italy, December 2001.

ID Code:1326
Deposited By:Antonio Maria Cipriano
Deposited On:11 July 2005

Statistiques de consultation

Repository Staff Only: edit this item

© ParisTech 2007 - Réalisé par RILK.com - Graphisme par Winch Communication