Han, Guangyue, Marcus, Brian, Peres, Yuval
In this note, we show that small complex perturbations of positive matrices are contractions, with respect to a complex version of the Hilbert metric, on the standard complex simplex. We show that...
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains (2008)
We derive an asymptotic formula for entropy rate of a hidden Markov chain around a "weak Black Hole". We also discuss applications of the asymptotic formula to the asymptotic behaviors of certain...
Menger's Paths with Minimum Mergings (2008)
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Merger's paths between the sources and the sinks such that the number of mergings between...
Asymptotics of Input-Constrained Binary Symmetric Channel Capacity (2008)
We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set....
Unitary Constellation Design with Application to Space-Time Coding (2007)
Guangyue Han, Joachim Rosenthal
Recently unitary space-time modulation has been presented to give a solution to more reliable multiple antennas communications. Good-performing unitary constellations are required to be designed to...
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains (2007)
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [16, 17] showed how, in principle, one can explicitly compute the...
Asymptotics of Noisy Constrained Channel Capacity (2007)
In this paper, we generalize a result in [17] and derive an asymptotic formula for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a binary symmetric channel....
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains (2006)
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13], [14] showed how, in principle, one can explicitly compute the...
Geometrical and numerical design of structured unitary space-time constellations (2006)
Guangyue Han, Joachim Rosenthal
Unitary space-time modulation using multiple antennas promises reliable communication at high transmission rates. The basic principles are well understood and certain criteria for designing good...
Analyticity of Entropy Rate of Hidden Markov Chains (2005)
We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine...
Generalized PSK in Space Time Coding (2004)
A wireless communication system using multiple antennas promises reliable transmission under Rayleigh flat fading assumptions. Design criteria and practical schemes have been presented for both...
Unitary Space Time Constellation Analysis: An Upper Bound for the Diversity (2004)
Han, Guangyue, Rosenthal, Joachim
The diversity product and the diversity sum are two very important parameters for a good-performing unitary space time constellation. A basic question is what the maximal diversity product (or sum)...
Space time coding with multiple antenna systems (2004)
Thesis (Ph. D.)--University of Notre Dame, 2004.
Space time coding with multiple antenna systems [electronic resource] / (2004)
Thesis (Ph. D.)--University of Notre Dame, 2004.
Space time coding with multiple antenna systems (2004)
Thesis (Ph. D.)--University of Notre Dame, 2004.
SPACE TIME CODING WITH MULTIPLE ANTENNA SYSTEMS (2004)
Guangyue Han, Joachim Rosenthal Director
entitled SPACE TIME CODING WITH MULTIPLE ANTENNA SYSTEMS This class conforms to the University of Notre Dame style guidelines established Fall 2000. However it is still possible to generate a...
Geometrical and Numerical Design of Structured Unitary Space Time Constellations (2003)
Han, Guangyue, Rosenthal, Joachim
In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how...
A Numerical Approach for Designing Unitary Space Time Codes with Large Diversity (2002)
Han, Guangyue, Rosenthal, Joachim
A numerical approach to design unitary constellation for any dimension and any transmission rate under non-coherent Rayleigh flat fading channel.
Unitary Constellations with Large Diversity Sum (2002)
And Good Diversity, Guangyue Han, Joachim Rosenthal
There exist two important design criterions for unitary space time codes. In the situation where the signal to noise ratio is large it is well known that the diversity product of a constellation...
Unitary constellations with large diversity sum and good diversity product (2002)
Guangyue Han, Joachim Rosenthal
Abstract There exist two important design criterions for unitary space time codes. In the situation where the signal to noise ratio is large it is well known that the diversity product of a...
Unitary Matrices with Maximal or near Maximal Diversity Product (2001)
Guangyue Han, Joachim Rosenthal, Keith Portman
Fully diversified constellations with large diversity product are playing an important role in improving the data rate of systems with multiple antennas. In this paper we study some optimal and some...