• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,022,939
Next 10 →

Some results on the blind identifiability of orthogonal space-time block codes from second order statistics

by Javier Vía, Ignacio Santamaría - in IEEE Int. Conf. on Acoustic, Speech, and Signal Proc. (ICASSP , 2007
"... In this paper, the conditions for blind identifiability from second order statistics (SOS) of multiple-input multiple-output (MIMO) channels under orthogonal space-time block coded (OSTBC) transmissions are studied. The main contribution of the paper is to show that, assuming more than one receive a ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
In this paper, the conditions for blind identifiability from second order statistics (SOS) of multiple-input multiple-output (MIMO) channels under orthogonal space-time block coded (OSTBC) transmissions are studied. The main contribution of the paper is to show that, assuming more than one receive

Blind Signal Separation: Statistical Principles

by Jean-Francois Cardoso , 2003
"... Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption of mut ..."
Abstract - Cited by 522 (4 self) - Add to MetaCart
of mutual independence between the signals. The weakness of the assumptions makes it a powerful approach but requires to venture beyond familiar second order statistics. The objective of this paper is to review some of the approaches that have been recently developed to address this exciting problem

Iterative decoding of binary block and convolutional codes

by Joachim Hagenauer, Elke Offer, Lutz Papke - IEEE Trans. Inform. Theory , 1996
"... Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the ..."
Abstract - Cited by 600 (43 self) - Add to MetaCart
is controlled by a stop criterion derived from cross entropy, which results in a minimal number of iterations. Optimal and suboptimal decoders with reduced complexity are presented. Simulation results show that very simple component codes are sufficient, block codes are appropriate for high rates

A Quasi-orthogonal Space–time Block Code

by Hamid Jafarkhani , 2001
"... It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space–time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space–time block codes with ful ..."
Abstract - Cited by 299 (11 self) - Add to MetaCart
It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space–time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space–time block codes

Space-time block coding for wireless communications: performance results

by Vahid Tarokh, Hamid Jafarkhani, A. Robert Calderbank - IEEE J. Select. Areas. Commun , 1999
"... Abstract—We document the performance of space–time block codes [13], [14], which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code, and the encoded data is split into n streams which are simultaneousl ..."
Abstract - Cited by 361 (12 self) - Add to MetaCart
joint detection. This uses the orthogonal structure of the space–time block code and gives a maximum likelihood decoding algorithm which is based only on linear processing at the receiver. We review the encoding and decoding algorithms for various codes and provide simulation results demonstrating

Fading relay channels: Performance limits and space-time signal design

by Rohit U. Nabar, Helmut Bölcskei, Felix W. Kneubühler - IEEE J. SELECT. AREAS COMMUN , 2004
"... Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay ch ..."
Abstract - Cited by 436 (4 self) - Add to MetaCart
) or decode-and-forward (DF) modes. For each protocol, we study the ergodic and outage capacity behavior (assuming Gaussian code books) under the AF and DF modes of relaying. We analyze the spatial diversity performance of the various protocols and find that full spatial diversity (second-order in this case

Blind Beamforming for Non Gaussian Signals

by Jean-François Cardoso, Antoine Souloumiac - IEE Proceedings-F , 1993
"... This paper considers an application of blind identification to beamforming. The key point is to use estimates of directional vectors rather than resorting to their hypothesized value. By using estimates of the directional vectors obtained via blind identification i.e. without knowing the arrray mani ..."
Abstract - Cited by 704 (31 self) - Add to MetaCart
range of parameters, even when the array is perfectly known to the informed beamformer. The key assumption blind identification relies on is the statistical independence of the sources, which we exploit using fourth-order cumulants. A computationally efficient technique is presented for the blind

Wavelets and Subband Coding

by Martin Vetterli, Jelena Kovačević , 2007
"... ..."
Abstract - Cited by 608 (32 self) - Add to MetaCart
Abstract not found

Understanding Code Mobility

by Alfonso Fuggetta, Gian Pietro Picco, Giovanni Vigna - IEEE COMPUTER SCIENCE PRESS , 1998
"... The technologies, architectures, and methodologies traditionally used to develop distributed applications exhibit a variety of limitations and drawbacks when applied to large scale distributed settings (e.g., the Internet). In particular, they fail in providing the desired degree of configurability, ..."
Abstract - Cited by 549 (34 self) - Add to MetaCart
the approaches based on the notion of mobile code. Second, it introduces criteria and guidelines that support the developer in the identification of the classes of applications that can leverage off of mobile code, in the design of these applications, and, finally, in the selection of the most appropriate

Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise

by Joel A. Tropp , 2006
"... This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that ..."
Abstract - Cited by 496 (2 self) - Add to MetaCart
This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination
Next 10 →
Results 1 - 10 of 1,022,939
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University