S. Sirianunpiboon

Learn More
This paper focuses on conditional optimization as a decoding primitive for high rate space-time codes that are obtained by multiplexing in the spatial and code domains. The approach is a crystallization of the work of Hottinen which applies to space-time codes that are assisted by quasi-orthogonality. It is independent of implementation and is more general(More)
The Golden code is a full-rate full-diversity space-time code which has been incorporated in the IEEE 802.16 (WiMAX) standard. The worst case complexity of a tree-based sphere decoder for a square QAM constellation is O(N<sup>3</sup>), where N is the size of the underlying QAM constellation; the worst case will dominate average decoding complexity on any(More)
Perfect space-time block codes (STBCs) were first introduced by Oggier et al. to have full rate, full diversity and non-vanishing determinant. A maximum likelihood decoder based on the sphere decoder has been used for efficient decoding of perfect STBCs. However the worst-case complexity for the sphere decoder is an exhaustive search. In this paper we(More)
Space-time codes built out of Alamouti components have been adopted in wireless standards such as UMTS, IEEE 802.11n, and IEEE 802.16, where they facilitate higher data rates through multiplexing of parallel data streams and the addition of two or more antennas at the receiver that perform interference cancellation. This correspondence provides new(More)
Space-time codes built out of Alamouti components have been adopted in wireless standards such as UMTS, IEEE 802.1 In and IEEE 802.16 where they facilitate higher data rates through multiplexing of parallel data streams and the addition of two or more antennas at the receiver that perform interference cancellation. This paper provides new theoretical(More)
In this paper we consider the time frequency distributions of a class of operators on L2(R), which we refer to as timefrequency periodic. By this we mean that they commute with a rectangular lattice subset of the Heisenberg-Weyl group, (D(nT, m F ) : n, m E Z}, for some fixed T, F E R. One reason such operators are important is that they include the frame(More)
Bayesian and generalized likelihood ratio tests are derived for detection of a common unknown signal of known rank K in M &gt; K independent channels of white gaussian noise. The cases of known and unknown noise variance are both treated. These derivations encompass the development of explicit expressions for an invariant measure on the grassmannian(More)
The generalized coherence (GC) estimate is a well studied statistic for detection of a common but unknown signal on several noisy channels. In this paper, it is shown that the GC detector arises naturally from a Bayesian perspective. Specifically, it is derived as a test of the hypothesis that the signals in the channels are independent Gaussian processes(More)
The Golden Code is incorporated in the IEEE 802.16 standard and is representative of a large class of space-time codes where performance is determined by the difficulty of solving an associated Diophantine approximation problem. This paper develops a new approach to coherent decoding where channel state information is used to select from a plurality of(More)