This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may easily be generalized to two transmit antennas and M receive antennas to provide a diversity order of 2M. The new scheme does not require any bandwidth expansion or any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC.

A simple transmit diversity technique for wireless communications

Wireless Communications

Alhussein Abouzeid Rensselaer Polytechnic Institute Raviraj Adve University of Toronto Dharma Agrawal University of Cincinnati Walid Ahmed Tyco M/A-COM Sonia Aissa University of Quebec, INRSEMT Huseyin Arslan University of South Florida Nallanathan Arumugam National University of Singapore Saewoong Bahk Seoul National University Claus Bauer Dolby Laboratories Brahim Bensaou Hong Kong University of Science and Technology Rick Blum Lehigh University Michael Buehrer Virginia Tech Antonio Capone Politecnico di Milano Javier Gómez Castellanos National University of Mexico Claude Castelluccia INRIA Henry Chan The Hong Kong Polytechnic University Ajit Chaturvedi Indian Institute of Technology Kanpur Jyh-Cheng Chen National Tsing Hua University Yong Huat Chew Institute for Infocomm Research Tricia Chigan Michigan Tech Dong-Ho Cho Korea Advanced Institute of Science and Tech. Jinho Choi University of New South Wales Carlos Cordeiro Philips Research USA Laurie Cuthbert Queen Mary University of London Arek Dadej University of South Australia Sajal Das University of Texas at Arlington Franco Davoli DIST University of Genoa Xiaodai Dong, University of Alberta Hassan El-sallabi Helsinki University of Technology Ozgur Ercetin Sabanci University Elza Erkip Polytechnic University Romano Fantacci University of Florence Frank Fitzek Aalborg University Mario Freire University of Beira Interior Vincent Gaudet University of Alberta Jairo Gutierrez University of Auckland Michael Hadjitheodosiou University of Maryland Zhu Han University of Maryland College Park Christian Hartmann Technische Universitat Munchen Hossam Hassanein Queen's University Soong Boon Hee Nanyang Technological University Paul Ho Simon Fraser University Antonio Iera University "Mediterranea" of Reggio Calabria Markku Juntti University of Oulu Stefan Kaiser DoCoMo Euro-Labs Nei Kato Tohoku University Dongkyun Kim Kyungpook National University Ryuji Kohno Yokohama National University Bhaskar Krishnamachari University of Southern California Giridhar Krishnamurthy Indian Institute of Technology Madras Lutz Lampe University of British Columbia Bjorn Landfeldt The University of Sydney Peter Langendoerfer IHP Microelectronics Technologies Eddie Law Ryerson University in Toronto

Wireless communications

We introduce space-time block coding, a new paradigm for communication 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 simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than 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. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.

/pdf/space-time-block-codes-from-orthogonal-designs-1oj68nrilr.pdf

Space-time block codes from orthogonal designs

We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2-3 dB of the outage capacity for these channels using only 64 state encoders.

/pdf/space-time-codes-for-high-data-rate-wireless-communication-1cgp5sbe62.pdf

Space-time codes for high data rate wireless communication: performance criterion and code construction

We propose two signaling schemes that exploit the availability of multiple (N) antennas at the transmitter to provide diversity benefit to the receiver. This is typical of cellular radio systems where a mobile is equipped with only one antenna while the base station is equipped with multiple antennas. We further assume that the mobile-to-base and base-to-mobile channel variations are statistically independent and that the base station has no knowledge of the base-to-mobile channel characteristics. In the first scheme, a channel code of lengthN and minimum Hamming distanced
min≤N is used to encode a group ofK information bits. Channel code symbolc

 i
 is transmitted with thei th antenna. At the receiver, a maximum likelihood decoder for the channel code provides a diversity ofd
min as long as each transmitted code symbol is subjected to independent fading. This can be achieved by spacing the transmit antennas several wavelengths apart. The second scheme introduces deliberate resolvable multipath distortion by transmitting the data-bearing signal with antenna 1, andN−1 delayed versions of it with antennas 2 throughN. The delays are unique to each antenna and are chosen to be multiples of the symbol interval. At the receiver, a maximum likelihood sequence estimator resolves the multipath in an optimal manner to realize a diversity benefit ofN. Both schemes can suppress co-channel interference. We provide code constructions and simulation results for scheme 1 to demonstrate its merit. We derive the receiver structure and provide a bound on the error probability for scheme 2 which we show to be tight, by means of simulations, for the nontrivial and perhaps the most interesting caseN=2 antennas. The second scheme is backward-compatible with two of the proposed digital cellular system standards, viz., GSM for Europe and IS-54 for North America.

Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity

Techniques for controlling and managing network access are used to enable a wireless communication device to selectively communicate with several wireless networks. A portable communication device constructed according to the invention can communicate with different networks as the device is moved through the areas of coverage supported by the different networks. As a result, the device can take advantage of services provided by a particular network when the device is within the area of coverage provided by that network. Thus, the device can selectively switch to networks that provide, for example, high speed Internet access, different quality of service, low cost service and/or different services (e.g., voice, data, multimedia, etc.). A multi-mode controller in the device may be used to alternately poll different networks to determine whether the device is within the area of coverage of a network and to selectively establish communications with those networks.

Multi-mode controller

Access to secured services may be controlled based on the proximity of a wireless token to a computing device through which access to the secured services is obtained. An authorized user may be provided access to a service only when a wireless token assigned to the user is in the proximity of the computing device. A user's credential may be stored on an RFID token and an RFID reader may be implemented within a security boundary on the computing device. Thus, the credential may be passed to the security boundary without passing through the computing device via software messages or applications. The security boundary may be provided, in part, by incorporating the RFID reader onto the same chip as a cryptographic processing component. Once the information is received by the RFID reader it may be encrypted within the chip. As a result, the information may never be presented in the clear outside of the chip. The cryptographic processing component may cryptographically encrypt/sign the credential received from the token so that assurance may be provided to a service provider that the credentials came from a token that was proximate to the computing device. An RFID reader, cryptographic processing components and a wireless network controller may be implemented on a single chip in a mobile device.

Proximity authentication system

The effects of digital transmission errors on a family of variable-rate embedded subband speech coders (SBC) are analyzed in detail. It is shown that there is a difference in error sensitivity of four orders of magnitude between the most and the least sensitive bits of the speech coder. As a result, a family of rate-compatible punctured convolutional codes with flexible unequal error protection capabilities have been matched to the speech coder. These codes are optimally decoded with the Viterbi algorithm. Among the results, analysis and informal listening tests show that with a 4-level unequal error protection scheme transmission of 12 kb/s speech is possible with very little degradation in quality over a 16 kb/s channel with an average bit error rate (BER) of 2*10/sup -2/ at a vehicle speed of 60 m.p.h. and with interleaving over two 16 ms speech frames. >

Subband speech coding and matched convolutional channel coding for mobile radio channels

A process of creating incentives for wireless hotspots by a service provider is disclosed. An access point is provided to a wireless hotspot for wireless devices to wirelessly connect to a larger network in a publicly accessible location. Use of the access point for a portable device is authenticated by requesting submission of an account identifier to the service provider and billing data for a user of the portable device for use of the access point is generated. Use statistics are evaluated of the access point of the wireless hotspot by portables devices and an inducement is provided to the publicly accessible location based on the evaluated use statistics.

Nambi Seshadri

Papers

Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity

Multi-mode controller

Proximity authentication system

Subband speech coding and matched convolutional channel coding for mobile radio channels

Method of creating incentives for establishing hotspot locations