Relevant bibliographies by topics / Unitary space-time codes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Unitary space-time codes'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Unitary space-time codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Unitary space-time codes"

1

Hassibi, B., and B. M. Hochwald. "Cayley differential unitary space-time codes." IEEE Transactions on Information Theory 48, no. 6 (June 2002): 1485–503. http://dx.doi.org/10.1109/tit.2002.1003836.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Niyomsataya, Terasan, Ali Miri, and Monica Nevins. "Unitary Space–Time Constellation Designs From Group Codes." IEEE Transactions on Information Theory 53, no. 11 (November 2007): 4322–29. http://dx.doi.org/10.1109/tit.2007.907474.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Attiah, Kareem M., Karim Seddik, and Ramy H. Gohary. "Differential Unitary Space-Time Constellations From Spherical Codes." IEEE Wireless Communications Letters 9, no. 11 (November 2020): 1909–13. http://dx.doi.org/10.1109/lwc.2020.3007915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Peng, Li, Qiuping Peng, and Lingling Yang. "A Design Method of Noncoherent Unitary Space-Time Codes." International Journal of Communications, Network and System Sciences 04, no. 07 (2011): 430–35. http://dx.doi.org/10.4236/ijcns.2011.47051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Larsson, E. G., and W. H. Wong. "Nonuniform Unitary Space–Time Codes for Layered Source Coding." IEEE Transactions on Wireless Communications 3, no. 3 (May 2004): 958–65. http://dx.doi.org/10.1109/twc.2004.827741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jibing Wang and Xiaodong Wang. "Optimum design of noncoherent cayley unitary space-time codes." IEEE Transactions on Wireless Communications 5, no. 7 (July 2006): 1942–51. http://dx.doi.org/10.1109/twc.2006.1673105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tarokh, V., and Il-Min Kim. "Existence and construction of noncoherent unitary space-time codes." IEEE Transactions on Information Theory 48, no. 12 (December 2002): 3112–17. http://dx.doi.org/10.1109/tit.2002.805075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Su, Xin, Kechu Yi, Bin Tian, and Yongjun Sun. "Reduced-complexity decoding algorithms for unitary space-time codes." Journal of Electronics (China) 24, no. 1 (January 2007): 112–15. http://dx.doi.org/10.1007/s11767-006-0062-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tong, Hongxi. "Constructions of unitary space-time codes with full diversity." Journal of Systems Science and Complexity 26, no. 4 (August 2013): 650–64. http://dx.doi.org/10.1007/s11424-013-0333-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yu, Fei, and HongXi Tong. "A construction of fully diverse unitary space-time codes." Science in China Series A: Mathematics 52, no. 10 (July 24, 2009): 2163–70. http://dx.doi.org/10.1007/s11425-009-0042-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Unitary space-time codes"

1

Niyomsataya, Terasan. "New unitary space-time codes with high diversity products." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26730.

Full text
Abstract:
We propose new unitary space-time codes with high diversity products for multiple antenna wireless communications. These Hamiltonian and product constellations have full diversity, and can be used for any number of transmitter antennas and for any data rate. Hamiltonian constellations for-two transmitter antennas are based on Slepian's group codes. We construct Hamiltonian constellations for any M transmitter antennas by using a direct sum of 2 x 2 Hamiltonian matrices for M even, and a direct sum of 2 x 2 Hamiltonian matrices with the roots of unity for M odd. Product constellations are proposed using a product of a Hamiltonian constellation and a representation of cyclic group. We also present product constellations of two Hamiltonian constellations with diagonal blocks in different order for M odd. Many of our constellations outperform, and have higher diversity products, than the best known space-time constellation designs in the literature.
APA, Harvard, Vancouver, ISO, and other styles
2

Panagos, Adam G., and Kurt Kosbar. "A METHOD FOR FINDING BETTER SPACE-TIME CODES FOR MIMO CHANNELS." International Foundation for Telemetering, 2005. http://hdl.handle.net/10150/604782.

Full text
Abstract:
ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada
Multiple-input multiple output (MIMO) communication systems can have dramatically higher throughput than single-input, single-output systems. Unfortunately, it can be difficult to find the space-time codes these systems need to achieve their potential. Previously published results located good codes by minimizing the maximum correlation between transmitted signals. This paper shows how this min-max method may produce sub-optimal codes. A new method which sorts codes based on the union bound of pairwise error probabilities is presented. This new technique can identify superior MIMO codes, providing higher system throughput without increasing the transmitted power or bandwidth requirements.
APA, Harvard, Vancouver, ISO, and other styles
3

Anderson, Adam L. "Unitary space-time transmit diversity for multiple antenna self-interference suppression /." Diss., CLICK HERE for online access, 2004. http://contentdm.lib.byu.edu/ETD/image/etd500.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Anderson, Adam Lane. "Unitary Space-Time Transmit Diversity for Multiple Antenna Self-Interference Suppression." BYU ScholarsArchive, 2004. https://scholarsarchive.byu.edu/etd/154.

Full text
Abstract:
A common practice for government defense agencies and commercial aeronautical companies is to use dual antennas on test flight air vehicles in order to overcome occlusion issues during high-speed telemetric maneuvers. The dual antennas, though never being masked at the same time, unfortunately lead to a drastic increase in nulls in the signal pattern. The result of this interference pattern can be compared to the effect of fading in a multiple-input multiple-output (MIMO) multi-path scattering environment. Confidence in this comparison leads to the use of unitary space-time MIMO codes to overcome the signal self-interference. The possibility and performance of several of these codes will be examined. Such criteria as training for channel estimation, use of shaped offset quadrature phase shift keying (SOQPSK), hardware facility, and data throughput will be compared for each code. A realistic telemetry channel will be derived to increase accuracy of simulated results and conclusions.
APA, Harvard, Vancouver, ISO, and other styles
5

Stanley, Seth. "PERFORMANCE OF UNITARY SPACE TIME CODES GENERATED BY GIVENS ROTATION MATRICES IN MULTIPLE-INPUT,MULTIPLEOUTPUT COMMUNICATION CHANNELS." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604510.

Full text
Abstract:
ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada
Multiple-Input, Multiple-Output (MIMO) communication systems promise to provide significantly higher data rates at no increase in transmitted power or bandwidth. Unfortunately it is challenging to locate space-time codes which achieve these gains. It was recently shown that codes based on Givens Rotation Matrices (GRM) out perform many of the more conventional space-time codes at extreme values of signal to noise ratio (SNR). This paper investigates the performance of GRM codes over a wider range of SNR, to determine their usefulness in MIMO applications of interest to the telemetry community.
APA, Harvard, Vancouver, ISO, and other styles
6

Panagos, Adam, Chris Potter, and Kurt Kosbar. "New Results in Unitary Space-Time Code Construction and Comparison to Upper Bounds." International Foundation for Telemetering, 2008. http://hdl.handle.net/10150/606192.

Full text
Abstract:
ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California
Unitary space-time codes are a coding technique for unknown (i.e. non-coherent) multiple-input multiple-output (MIMO) channels. The unitary constellation symbol-error rate performance is determined by the diversity product and diversity sum metrics of the constellation. Numerous techniques have been presented over the last few years for constructing unitary space-time codes with continually improving diversity products and sums. Other work has focused on determining bounds on the optimal diversity product and sum for a given number of transmit antennas and constellation size. This paper presents a comprehensive survey of known construction techniques and bounds for unitary space-time codes, and also reports a variety of new constellations that have been constructed with improved diversity product or sum. These new constellations are documented along with a list of the currently best known codes and bounds. In many cases, a large gap between the bound and best known constellation exist. This result suggests areas of focus for improved constructions or tighter bounds.
APA, Harvard, Vancouver, ISO, and other styles
7

LIN, CHE-MIN, and 林哲民. "Decoding Algorithms for Unitary Space-Time Trellis Codes." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/72303748049863073593.

Full text
Abstract:
碩士
國立中央大學
通訊工程研究所
91
In this paper, we study the decoding algorithms for unitary space-time trellis codes. We use decision feedback algorithms for decoding. The improvement of error performance are verified by computer simulations with different observed length. We also propose to decode by reducing the state of optimal trellis. The error performance of using different number of trellis states are compared also. This decoding algorithms are applied to differential space-time codes as well. The channel considered here in are quasi-static flat fading channel and continuous flat fading channels.
APA, Harvard, Vancouver, ISO, and other styles
8

Elkhazin, Akrum. "Space-time Coded Modulation Design in Slow Fading." Thesis, 2009. http://hdl.handle.net/1807/19320.

Full text
Abstract:
This dissertation examines multi-antenna transceiver design over flat-fading wireless channels. Bit Interleaved Coded Modulation (BICM) and MultiLevel Coded Modulation (MLCM) transmitter structures are considered, as well as the used of an optional spatial precoder under slow and quasi-static fading conditions. At the receiver, MultiStage Decoder (MSD) and Iterative Detection and Decoding (IDD) strategies are applied. Precoder, mapper and subcode designs are optimized for different receiver structures over the different antenna and fading scenarios. Under slow and quasi-static channel conditions, fade resistant multi-antenna transmission is achieved through a combination of linear spatial precoding and non-linear multi-dimensional mapping. A time-varying random unitary precoder is proposed, with significant performance gains over spatial interleaving. The fade resistant properties of multidimensional random mapping are also analyzed. For MLCM architectures, a group random labelling strategy is proposed for large antenna systems. The use of complexity constrained receivers in BICM and MLCM transmissions is explored. Two multi-antenna detectors are proposed based on a group detection strategy, whose complexity can be adjusted through the group size parameter. These detectors show performance gains over the the Minimum Mean Squared Error (MMSE)detector in spatially multiplexed systems having an excess number of transmitter antennas. A class of irregular convolutional codes is proposed for use in BICM transmissions. An irregular convolutional code is formed by encoding fractions of bits with different puncture patterns and mother codes of different memory. The code profile is designed with the aid of extrinsic information transfer charts, based on the channel and mapping function characteristics. In multi-antenna applications, these codes outperform convolutional turbo codes under independent and quasi-static fading conditions. For finite length transmissions, MLCM-MSD performance is affected by the mapping function. Labelling schemes such as set partitioning and multidimensional random labelling generate a large spread of subcode rates. A class of generalized Low Density Parity Check (LDPC) codes is proposed, to improve low-rate subcode performance. For MLCM-MSD transmissions, the proposed generalized LDPC codes outperform conventional LDPC code construction over a wide range of channels and design rates.
APA, Harvard, Vancouver, ISO, and other styles
9

Rajan, G. Susinder. "Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks." Thesis, 2008. http://hdl.handle.net/2005/742.

Full text
Abstract:
It is well known that communication using multiple antennas provides high data rate and reliability. Coding across space and time is necessary to fully exploit the gains offered by multiple input multiple output (MIMO) systems. One such popular method of coding for MIMO systems is space-time block coding. In applications where the terminals do not have enough physical space to mount multiple antennas, relaying or cooperation between multiple single antenna terminals can help achieve spatial diversity in such scenarios as well. Relaying techniques can also help improve the range and reliability of communication. Recently it has been shown that certain space-time block codes (STBCs) can be employed in a distributed fashion in single antenna relay networks to extract the same benefits as in point to point MIMO systems. Such STBCs are called distributed STBCs. However an important practical issue with STBCs and DSTBCs is its associated high maximum likelihood (ML) decoding complexity. The central theme of this thesis is to systematically construct STBCs and DSTBCs applicable for various scenarios such that are amenable for low decoding complexity. The first part of this thesis provides constructions of high rate STBCs from crossed product algebras that are minimum mean squared error (MMSE) optimal, i.e., achieves the least symbol error rate under MMSE reception. Moreover several previous constructions of MMSE optimal STBCs are found to be special cases of the constructions in this thesis. It is well known that STBCs from orthogonal designs offer single symbol ML decoding along with full diversity but the rate of orthogonal designs fall exponentially with the number of transmit antennas. Thus it is evident that there exists a tradeoff between rate and ML decoding complexity of full diversity STBCs. In the second part of the thesis, a definition of rate of a STBC is proposed and the problem of optimal tradeoff between rate and ML decoding complexity is posed. An algebraic framework based on extended Clifford algebras is introduced to study the optimal tradeoff for a class of multi-symbol ML decodable STBCs called ‘Clifford unitary weight (CUW) STBCs’ which include orthogonal designs as a special case. Code constructions optimally meeting this tradeoff are also obtained using extended Clifford algebras. All CUW-STBCs achieve full diversity as well. The third part of this thesis focusses on constructing DSTBCs with low ML decoding complexity for two hop, amplify and forward based relay networks under various scenarios. The symbol synchronous, coherent case is first considered and conditions for a DSTBC to be multi-group ML decodable are first obtained. Then three new classes of four-group ML decodable full diversity DSTBCs are systematically constructed for arbitrary number of relays. Next the symbol synchronous non-coherent case is considered and full diversity, four group decodable distributed differential STBCs (DDSTBCs) are constructed for power of two number of relays. These DDSTBCs have the best error performance compared to all previous works along with low ML decoding complexity. For the symbol asynchronous, coherent case, a transmission scheme based on orthogonal frequency division multiplexing (OFDM) is proposed to mitigate the effects of timing errors at the relay nodes and sufficient conditions for a DSTBC to be applicable in this new transmission scheme are given. Many of the existing DSTBCs including the ones in this thesis are found to satisfy these sufficient conditions. As a further extension, differential encoding is combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full diversity in symbol asynchronous, non-coherent relay networks with no knowledge of the timing errors at the relay nodes. The DDSTBCs in this thesis are proposed for application in the proposed transmission scheme for symbol asynchronous, non-coherent relay networks. As a parallel to the non-coherent schemes based on differential encoding, we also propose non-coherent schemes for symbol synchronous and symbol asynchronous relay networks that are based on training. This training based transmission scheme leverages existing coherent DSTBCs for non-coherent communication in relay networks. Simulations show that this training scheme when used along with the coherent DSTBCs in this thesis outperform the best known DDSTBCs in the literature. Finally, in the last part of the thesis, connections between multi-group ML decodable unitary weight (UW) STBCs and groups with real elements are established for the first time. Using this connection, we translate the necessary and sufficient conditions for multi-group ML decoding of UW-STBCs entirely in group theoretic terms. We discuss various examples of multi-group decodable UW-STBCs together with their associated groups and list the real elements involved. These examples include orthogonal designs, quasi-orthogonal designs among many others.
APA, Harvard, Vancouver, ISO, and other styles
10

Chien, Shao-Lun, and 簡紹倫. "Code Searches of Unitary Space-time Modulation." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/47497346452180681992.

Full text
Abstract:
碩士
國立中央大學
通訊工程研究所
99
Unitary space-time modulation(USTM) is well tailored for flat fading channels where neither the transmitter nor the receiver knows the fading coefficients. In this thesis, we propose a new schemes of unitary space-time modulation. Different from the past proposed systematic codeword, we consider the unitary space-time codeword which don’t have the algebraic structure. Then we use asymptotic union bound and diversity product to search unitary space-time codeword.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Unitary space-time codes"

1

Panagos, A., and K. Kosbar. "A GRASP for unitary space-time codes." In GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. IEEE, 2005. http://dx.doi.org/10.1109/glocom.2005.1578387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Xinjia, Ernest Walker, Pradeep Bhattacharya, and Jiecai Luo. "Optimization of MIMO unitary space-time codes." In SPIE Defense, Security, and Sensing, edited by Sohail A. Dianat and Michael D. Zoltowski. SPIE, 2009. http://dx.doi.org/10.1117/12.818653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Mengfan, Xizheng Ke, and Sichen Lei. "Unitary space-time codes in free-space optical communications." In Asia Communications and Photonics Conference. Washington, D.C.: OSA, 2015. http://dx.doi.org/10.1364/acpc.2015.asu2a.88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Panagos, Adam, Kurt Kosbar, and Asif Iqbal Mohammad. "WLC21-4: Weak-Group Unitary Space-Time Codes." In IEEE Globecom 2006. IEEE, 2006. http://dx.doi.org/10.1109/glocom.2006.736.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Creignou, Jean, and Herve Diet. "Linear programming bounds for unitary space time codes." In 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595152.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hassibi, Babak, and Yindi Jing. "Unitary space-time codes and the Cayley transform." In Proceedings of ICASSP '02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.5745132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hassibi and Yindi Jing. "Unitary space-time codes and the Cayley transform." In IEEE International Conference on Acoustics Speech and Signal Processing ICASSP-02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.1005170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Panagos, Adam, and Kurt Kosbar. "A new design metric for unitary space-time codes." In Proceeding of the 2006 international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1143549.1143683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Xinjia, and Ernest Walker. "Noncoherent unitary space-time codes for wireless MIMO communications." In SPIE Defense, Security, and Sensing, edited by Sohail A. Dianat and Michael D. Zoltowski. SPIE, 2013. http://dx.doi.org/10.1117/12.2015058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tran, L. C., A. Mertins, E. Dutkiewicz, and X. Huang. "Unitary differential space-time-frequency codes for MB-OFDM UWB." In 2009 9th International Symposium on Communications and Information Technology (ISCIT). IEEE, 2009. http://dx.doi.org/10.1109/iscit.2009.5341104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Unitary space-time codes' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography