Relevant bibliographies by topics / Layered space-time code

Academic literature on the topic 'Layered space-time code'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

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

Select a source type:

Contents

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

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 "Layered space-time code"

1

Nasser, Youssef, and Jean-François Helard. "Layered space-time block code for hybrid satellite-terrestrial broadcasting systems." International Journal of Satellite Communications and Networking 30, no. 3 (March 15, 2012): 113–29. http://dx.doi.org/10.1002/sat.1001.

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

Park, Gun-Woong, and Ji-Won Jung. "A Study of MIMO FTN Scheme based on Layered Space Time Code using Turbo Code." Journal of the Korea Institute of Information and Communication Engineering 20, no. 5 (May 31, 2016): 895–901. http://dx.doi.org/10.6109/jkiice.2016.20.5.895.

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

Zhao, Zheng, Qinye Yin, Hong Zhang, and Aigang Feng. "A vertical layered space-time code and its closed-form blind symbol detection." Journal of Electronics (China) 20, no. 2 (March 2003): 102–9. http://dx.doi.org/10.1007/s11767-003-0004-z.

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

Minallah, Nasru, Ishtiaque Ahmed, Jaroslav Frnda, and Khurram S. Khattak. "Averting BER Floor with Iterative Source and Channel Decoding for Layered Steered Space-Time Codes." Sensors 21, no. 19 (September 29, 2021): 6502. http://dx.doi.org/10.3390/s21196502.

Full text
Abstract:
The widespread development in wireless technologies and the advancements in multimedia communication have brought about a positive impact on the performance of wireless transceivers. We investigate the performance of our three-stage turbo detected system using state-of-the-art high efficiency video coding (HEVC), also known as the H.265 video standard. The system makes use of sphere packing (SP) modulation with the combinational gain technique of layered steered space-time code (LSSTC). The proposed three-stage system is simulated for the correlated Rayleigh fading channel and the bit-error rate (BER) curve obtained after simulation is free of any floor formation. The system employs low complexity source-bit coding (SBC) for protecting the H.265 coded stream. An intermediate recursive unity-rate code (URC) with an infinite impulse response is employed as an inner precoder. More specifically, the URC assists in the prevention of the BER floor by distributing the information across the decoders. There is an observable gain in the BER and peak signal-to-noise ratio (PSNR) performances with the increasing value of minimum Hamming distance (dH,min) using the three-stage system. Convergence analysis of the proposed system is investigated through an extrinsic information transfer (EXIT) chart. Our proposed system demonstrates better performance of about 22 dB than the benchmarker utilizing LSSTC-SP for iterative source-channel detection, but without exploiting the optimized SBC schemes.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Chunli, Fengfan Yang, Rahim Umar, and Shoaib Mughal. "Two-Source Asymmetric Turbo-Coded Cooperative Spatial Modulation Scheme with Code Matched Interleaver." Electronics 9, no. 1 (January 16, 2020): 169. http://dx.doi.org/10.3390/electronics9010169.

Full text
Abstract:
This paper proposes, for the first time, a two-source asymmetric turbo-coded-cooperative spatial modulation (SM) scheme over the slow Rayleigh fading channel. As in any coded cooperative communication, the interleaver plays a vital role in mitigating the harsh effect of the wireless channel. Therefore, the code matched interleaver (CMI) is effectively used in the proposed design. The simulated results reveal that the bit error rate (BER) performance of the proposed coded cooperative communication system outperforms the asymmetric turbo-coded non-cooperative scheme under identical conditions. This prominent performance improvement has been made possible due to the joint asymmetric turbo decoding at the destination node. Furthermore, to check the effectiveness of the proposed scheme, we have also developed a two-source asymmetric turbo-coded cooperative scheme based on the vertical bell labs layered space-time (VBLAST), incorporating the CMI as the suitable benchmark. It is observed that the proposed scheme employing SM has a better BER performance than the VBLAST scheme under identical conditions.
APA, Harvard, Vancouver, ISO, and other styles
6

Phasouliotis, A., and D. K. C. So. "Layered space–time receiver for downlink multiple-input multiple-output multi-carrier code division multiple access systems." IET Communications 5, no. 13 (September 5, 2011): 1907–17. http://dx.doi.org/10.1049/iet-com.2010.0367.

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

Elabed, Salem. "COMPARATIVE ANALYSIS OF DIFFERENT RECEIVE ALGORITHMS FOR BLAST ARCHITECTURE IN MOBILE COMMUNICATION SYSTEMS." SYNCHROINFO JOURNAL 7, no. 4 (2021): 12–15. http://dx.doi.org/10.36724/2664-066x-2021-7-4-12-15.

Full text
Abstract:
The Layered Space-Time Processing approach to STC was first introduced by Lucent’s Bell Labs, with their BLAST family of STC structures. The information bits are demultiplexed into individual streams, which are then fed into individual encoders. These coders may be binary convolutional coders, or even no coding at all. The outputs of the coders are modulated and fed to the separate antennas, from which they are transmitted, using the same carrier-frequency/symbol waveform (TDMA) or Walsh code (CDMA). At the receiver, a spatial beamforming/nulling (zero-forcing) process is used at the front end in order to separate the individual coded streams, and feed them to their individual decoders. The outputs of the decoders are multiplexed back to reconstruct the estimate of the original information bitstream. Various receivers for communication system with Space-Time Coding in MIMO Channel are considered. Performance analysis was provided by statistical simulation for various parameters of communication system.
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Dong-gi, Myungjun Kim, Sang Joon Son, Chang Hyung Hong, and Hyunjung Shin. "Dementia key gene identification with multi-layered SNP-gene-disease network." Bioinformatics 36, Supplement_2 (December 2020): i831—i839. http://dx.doi.org/10.1093/bioinformatics/btaa814.

Full text
Abstract:
Abstract Motivation Recently, various approaches for diagnosing and treating dementia have received significant attention, especially in identifying key genes that are crucial for dementia. If the mutations of such key genes could be tracked, it would be possible to predict the time of onset of dementia and significantly aid in developing drugs to treat dementia. However, gene finding involves tremendous cost, time and effort. To alleviate these problems, research on utilizing computational biology to decrease the search space of candidate genes is actively conducted. In this study, we propose a framework in which diseases, genes and single-nucleotide polymorphisms are represented by a layered network, and key genes are predicted by a machine learning algorithm. The algorithm utilizes a network-based semi-supervised learning model that can be applied to layered data structures. Results The proposed method was applied to a dataset extracted from public databases related to diseases and genes with data collected from 186 patients. A portion of key genes obtained using the proposed method was verified in silico through PubMed literature, and the remaining genes were left as possible candidate genes. Availability and implementation The code for the framework will be available at http://www.alphaminers.net/. Supplementary information Supplementary data are available at Bioinformatics online.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Haiquan, Yabo Li, Xiang-Gen Xia, and Shunlan Liu. "Unitary and Non-Unitary Precoders for a Limited Feedback Precoded OSTBC System." Vehicular Technology, IEEE Transactions on 62, no. 4 (May 2013): 1646–54. http://dx.doi.org/10.1109/tvt.2012.2233508.

Full text
Abstract:
In this paper, a multiple-input-multiple-output (MIMO) system with finite-bit feedback first proposed by Love-Heath is considered, where a transmitted signal consists of a precode followed by an orthogonal space-time block code (OSTBC), such as Alamouti code. A new design criterion and a corresponding design method of precoders are proposed. Simulations show that the precoders obtained by our proposed criterion and method perform better than the existing ones. Furthermore, since our proposed precoders have a layered structure, their designs can be implemented in the simplest Grassmannian manifold. Moreover, a fast encoding algorithm can be applied, which can greatly reduce the complexity of codeword selection. In this paper, we also propose non-unitary precoders and their design criterion and method based on the performance analysis and the special property of an OSTBC. Interestingly, non-unitary precoders can significantly improve performance over unitary precoders.
APA, Harvard, Vancouver, ISO, and other styles
10

Ni, Liang Fang, Qing Qing Li, and Si Dan Du. "Complex Generalized Basis Reduction Assisted Successive Interference Cancellation Detection for SCBLAST Systems." Advanced Materials Research 366 (October 2011): 219–23. http://dx.doi.org/10.4028/www.scientific.net/amr.366.219.

Full text
Abstract:
Complex generalized basis reduction assisted successive interference cancellation is proposed for mitigating multi-stream interference of transmitted signals in single code Bell Laboratories layered space-time systems. Generalized basis reduction method is modified to better the complex channel matrix, which leads to the extended generalized reduction basis channel matrix with shorter and roughly orthogonal basis vectors in polynomial-time. This distinguished property guarantees the concatenated successive interference cancellation detector, based on the MMSE criterion, converges to the approximately global optimum estimation points. Emulation results have shown that the proposed detection scheme is superior to other suboptimum detection schemes considered in this paper in terms of two points. They are the mitigation of multi-stream interference and the diversity gain. Its performance is close to the sphere decoder but with a lower complexity.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Layered space-time code"

1

Karim, Md Anisul. "Weighted layered space-time code with iterative detection and decoding." Thesis, The University of Sydney, 2006. http://hdl.handle.net/2123/1095.

Full text
Abstract:
Multiple antenna systems are an appealing candidate for emerging fourth-generation wireless networks due to its potential to exploit space diversity for increasing conveyed throughput without wasting bandwidth and power resources. Particularly, layered space-time architecture (LST) proposed by Foschini, is a technique to achieve a significant fraction of the theoretical capacity with a reasonable implementation complexity. There has been a great deal of challenges in the detection of space-time signal; especially to design a low-complexity detector, which can efficiently remove multi-layer interference and approach the interference free bound. The application of iterative principle to joint detection and decoding has been a promising approach. It has been shown that, the iterative receiver with parallel interference canceller (PIC) has a low linear complexity and near interference free performance. Furthermore, it is widely accepted that the performance of digital communication systems can be considerably improved once the channel state information (CSI) is used to optimize the transmit signal. In this thesis, the problem of the design of a power allocation strategy in LST architecture to simultaneously optimize coding, diversity and weighting gains is addressed. A more practical scenario is also considered by assuming imperfect CSI at the receiver. The effect of channel estimation errors in LST architecture with an iterative PIC receiver is investigated. It is shown that imperfect channel estimation at an LST receiver results in erroneous decision statistics at the very first iteration and this error propagates to the subsequent iterations, which ultimately leads to severe degradation of the overall performance. We design a transmit power allocation policy to take into account the imperfection in the channel estimation process. The transmit power of various layers is optimized through minimization of the average bit error rate (BER) of the LST architecture with a low complexity iterative PIC detector. At the receiver, the PIC detector performs both interference regeneration and cancellation simultaneously for all layers. A convolutional code is used as the constituent code. The iterative decoding principle is applied to pass the a posteriori probability estimates between the detector and decoders. The decoder is based on the maximum a posteriori (MAP) algorithms. A closed-form optimal solution for power allocation in terms of the minimum BER is obtained. In order to validate the effectiveness of the proposed schemes, substantial simulation results are provided.
APA, Harvard, Vancouver, ISO, and other styles
2

Karim, Md Anisul. "Weighted layered space-time code with iterative detection and decoding." School of Electrical & Information Engineering, 2006. http://hdl.handle.net/2123/1095.

Full text
Abstract:
Master of Engineering (Research)
Multiple antenna systems are an appealing candidate for emerging fourth-generation wireless networks due to its potential to exploit space diversity for increasing conveyed throughput without wasting bandwidth and power resources. Particularly, layered space-time architecture (LST) proposed by Foschini, is a technique to achieve a significant fraction of the theoretical capacity with a reasonable implementation complexity. There has been a great deal of challenges in the detection of space-time signal; especially to design a low-complexity detector, which can efficiently remove multi-layer interference and approach the interference free bound. The application of iterative principle to joint detection and decoding has been a promising approach. It has been shown that, the iterative receiver with parallel interference canceller (PIC) has a low linear complexity and near interference free performance. Furthermore, it is widely accepted that the performance of digital communication systems can be considerably improved once the channel state information (CSI) is used to optimize the transmit signal. In this thesis, the problem of the design of a power allocation strategy in LST architecture to simultaneously optimize coding, diversity and weighting gains is addressed. A more practical scenario is also considered by assuming imperfect CSI at the receiver. The effect of channel estimation errors in LST architecture with an iterative PIC receiver is investigated. It is shown that imperfect channel estimation at an LST receiver results in erroneous decision statistics at the very first iteration and this error propagates to the subsequent iterations, which ultimately leads to severe degradation of the overall performance. We design a transmit power allocation policy to take into account the imperfection in the channel estimation process. The transmit power of various layers is optimized through minimization of the average bit error rate (BER) of the LST architecture with a low complexity iterative PIC detector. At the receiver, the PIC detector performs both interference regeneration and cancellation simultaneously for all layers. A convolutional code is used as the constituent code. The iterative decoding principle is applied to pass the a posteriori probability estimates between the detector and decoders. The decoder is based on the maximum a posteriori (MAP) algorithms. A closed-form optimal solution for power allocation in terms of the minimum BER is obtained. In order to validate the effectiveness of the proposed schemes, substantial simulation results are provided.
APA, Harvard, Vancouver, ISO, and other styles
3

Al-Ghadhban, Samir Naser. "Multi-layered Space Frequency Time Codes." Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/29498.

Full text
Abstract:
This dissertation focuses on three major advances on multiple-input multiple-output (MIMO) systems. The first studies and compares decoding algorithms for multi-layered space time coded (MLSTC) systems. These are single user systems that combine spatial multiplexing and transmit diversity. Each layer consists of a space time code. The detection algorithms are based on multi-user detection theory. We consider joint, interference nulling and cancellation, and spatial sequence estimation algorithms. As part of joint detection algorithms, the sphere decoder is studied and its complexity is evaluated over MIMO channels. The second part contributes to the field of space frequency time (SFT) coding for MIMO-OFDM systems. It proposes a full spatial and frequency diversity codes at much lower number of trellis states. The third part proposes and compares uplink scheduling algorithms for multiuser systems with spatial multiplexing. Several scheduling criteria are examined and compared. The capacity and error rate study of MLSTBC reveals the performance of the detection algorithms and their advantage over other open loop MIMO schemes. The results show that the nulling and cancellation operations limit the diversity of the system to the first detected layer in serial algorithms. For parallel algorithms, the diversity of the system is dominated by the performance after parallel nulling. Theoretically, parallel cancellation should provide full receive diversity per layer but error propagations as a result of cancellation prevent the system from reaching this goal. However, parallel cancellation provides some gains but it doesn't increase the diversity. On the other hand, joint detection provides full receive diversity per layer. It could be practically implemented with sphere decoding which has a cubic complexity at high SNR. The results of the SFT coding show the superiority of the IQ-SFT codes over other codes at the same number of sates. The IQ-SFT codes achieve full spatial and frequency diversity at much lower number of trellis states compared to conventional codes. For V-BLAST scheduling, we propose V-BLAST capacity maximizing scheduler and we show that scheduling based on optimal MIMO capacity doesn't work well for V-BLAST. The results also show that maximum minimum singularvalue (MaxMinSV) scheduling performs very close to the V-BLAST capacity maximizing scheduler since it takes into account both the channel power and the orthogonality of the channel.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
4

Wong, Wing Hin. "Nonuniform space-time codes for layered source coding." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000826.

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

Teekapakvisit, Chakree. "Low Complexity Adaptive Iterative Receivers for Layered Space-Time Coded and CDMA Systems." University of Sydney, 2007. http://hdl.handle.net/2123/1776.

Full text
Abstract:
Doctor of Philosophy(PhD)
In this thesis, we propose and investigate promising approaches for interference mitigation in multiple input multiple output (MIMO) and code division multiple access (CDMA) systems. Future wireless communication systems will have to achieve high spectral efficiencies in order to meet increasing demands for huge data rates in emerging Internet and multimedia services. Multiuser detection and space diversity techniques are the main principles, which enable efficient use of the available spectrum. The main limitation for the applicability of the techniques in these practical systems is the high complexity of the optimal receiver structures. The research emphasis in this thesis is on the design of a low complexity interference suppression/cancellation algorithm. The most important result of our research is the novel design of interference cancellation receivers which are adaptive and iterative and which are of low computational complexity. We propose various adaptive iterative receivers, based on a joint adaptive iterative detection and decoding algorithm. The proposed receiver can effectively suppress and cancel co-channel interference from the adjacent antennas in the MIMO system with a low computation complexity. The proposed adaptive detector, based on the adaptive least mean square (LMS) algorithm, is investigated and compared with the non-adaptive iterative receiver. Since the LMS algorithm has a slow convergence speed, a partially filtered gradient LMS (PFGLMS) algorithm, which has a faster convergence speed, is proposed to improve the convergence speed of the system. The performance and computational complexity of this receiver are also considered. To further reduce the computational complexity, we apply a frequency domain adaptation technique into the adaptive iterative receivers. The system performance and complexity are investigated. It shows that the computational complexity of the frequency domain based receiver is significantly lower than that of the time domain based receiver with the same system performance. We also consider applications of MIMO techniques in CDMA systems, called MIMO-CDMA. In the MIMO-CDMA, the presence of the co-channel interference (CCI) from the adjacent antennas and multiple access interference (MAI) from other users significantly degrades the system performance. We propose an adaptive iterative receiver, which provides the capability to effectively suppress the interference and cancel the CCI from the adjacent antennas and the MAI from other users so as to improve the system performance. The proposed receiver structure is also based on a joint adaptive detection and decoding scheme. The adaptive detection scheme employs an adaptive normalized LMS algorithm operating in the time and frequency domain. We have investigated and compared their system performance and complexity. Moreover, the system performance is evaluated by using a semi-analytical approach and compared with the simulation results. The results show that there is an excellent agreement between the two approaches.
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Runhua. "A layered space-time coded MIMO architecture for high-data-rate wireless communications /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202002%20CHEN.

Full text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.
Includes bibliographical references (leaves 84-88). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
7

Teekapakvisit, Chakree. "Low Complexity Adaptive Iterative Receivers for Layered Space-Time Coded and CDMA Systems." Thesis, The University of Sydney, 2006. http://hdl.handle.net/2123/1776.

Full text
Abstract:
In this thesis, we propose and investigate promising approaches for interference mitigation in multiple input multiple output (MIMO) and code division multiple access (CDMA) systems. Future wireless communication systems will have to achieve high spectral efficiencies in order to meet increasing demands for huge data rates in emerging Internet and multimedia services. Multiuser detection and space diversity techniques are the main principles, which enable efficient use of the available spectrum. The main limitation for the applicability of the techniques in these practical systems is the high complexity of the optimal receiver structures. The research emphasis in this thesis is on the design of a low complexity interference suppression/cancellation algorithm. The most important result of our research is the novel design of interference cancellation receivers which are adaptive and iterative and which are of low computational complexity. We propose various adaptive iterative receivers, based on a joint adaptive iterative detection and decoding algorithm. The proposed receiver can effectively suppress and cancel co-channel interference from the adjacent antennas in the MIMO system with a low computation complexity. The proposed adaptive detector, based on the adaptive least mean square (LMS) algorithm, is investigated and compared with the non-adaptive iterative receiver. Since the LMS algorithm has a slow convergence speed, a partially filtered gradient LMS (PFGLMS) algorithm, which has a faster convergence speed, is proposed to improve the convergence speed of the system. The performance and computational complexity of this receiver are also considered. To further reduce the computational complexity, we apply a frequency domain adaptation technique into the adaptive iterative receivers. The system performance and complexity are investigated. It shows that the computational complexity of the frequency domain based receiver is significantly lower than that of the time domain based receiver with the same system performance. We also consider applications of MIMO techniques in CDMA systems, called MIMO-CDMA. In the MIMO-CDMA, the presence of the co-channel interference (CCI) from the adjacent antennas and multiple access interference (MAI) from other users significantly degrades the system performance. We propose an adaptive iterative receiver, which provides the capability to effectively suppress the interference and cancel the CCI from the adjacent antennas and the MAI from other users so as to improve the system performance. The proposed receiver structure is also based on a joint adaptive detection and decoding scheme. The adaptive detection scheme employs an adaptive normalized LMS algorithm operating in the time and frequency domain. We have investigated and compared their system performance and complexity. Moreover, the system performance is evaluated by using a semi-analytical approach and compared with the simulation results. The results show that there is an excellent agreement between the two approaches.
APA, Harvard, Vancouver, ISO, and other styles
8

Tsai, Meng-Ying (Brady). "Iterative joint detection and decoding of LDPC-Coded V-BLAST systems." Thesis, Kingston, Ont. : [s.n.], 2008. http://hdl.handle.net/1974/1304.

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

Fan, Yang-Jay, and 范揚傑. "Performance Study of Various Layered Space-Time Codes." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/80273803568256653535.

Full text
Abstract:
碩士
國立雲林科技大學
通訊工程研究所碩士班
99
In recent years, wireless networks using multiple antenna systems have been drawn much attention. Transceivers with multiple antennas can provide very high throughput.Space-time codes (STCs) are used to exploit such high capacity for multiple-antenna systems. To make STCs feasible, the coding complexity is one of the most important factors to be considered. Among many STC schemes, layered space-time codes (LSTCs) can effectively reduce the coding complexity, since they can employ one dimensional signal processing approach to deal with higher dimensional signals. At the receiver side,both zero-forcing (ZF) and minimum mean-square error (MMSE) decoding methods are considered. In this thesis, we will investigate performance comparison between various architectures of LSTCs under different decoding methods. Simulation results show that the bit error rate (BER) performance can be improved significantly as the number of antennas increases. Moreover, it is also found that the LSTCs benefit greatly by the architecture with both cross-temporal and spatial interleaving.
APA, Harvard, Vancouver, ISO, and other styles
10

Tooher, Patrick. "Space-time layered block codes : bridging the gap between maximum rate and full diversity." Thesis, 2004. http://spectrum.library.concordia.ca/8100/1/MQ94713.pdf.

Full text
Abstract:
Impairments found in the wireless channel, such as destructive multipath fading, cannot be fully addressed by using coding alone, despite its recent advances. Recent results show that gains in capacity can be obtained by using multiple antenna elements at the transmitter and the receiver. Instead of mitigating the effects of the multipath fading, multiple-input multiple-output (MIMO) systems use the rich scattering channel to increase the capacity at no bandwidth cost. Methods include BLAST, which maximizes the rate, and space-time coding, which maximizes the diversity. In this thesis, the fundamental trade-off between rate and diversity is derived for binary codes. Simple codes that can perform at any realizable rate/diversity are designed. These codes are referred to as Space-Time Layered Block Codes (STLBC), since they are in effect a 1-dimensional code layered into a space-time code. By selecting speck 1-D codes, the required diversity can be achieved at the maximal allowable rate. In order to detect the new STLBC codes, an iterative MMSE detector is used jointly with a soft input soft-output decoder. This detector/decoder uses a principle similar to Turbo decoding. STLBC codes introduce the concept of coding between layers, which requires a detector capable of dealing with possibly dependent layers. The classical multiuser detector is modified to allow for dependence. Lastly, techniques to improve the performance of STLBC are presented. These are based on a new design criterion that ensures codebooks of high average rank, as well as making certain the information is spread out over the two available dimensions.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Layered space-time code"

1

Sellathurai, Mathini. Space-time layered information processing for wireless communications. Hoboken, N.J: Wiley, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Haykin, Simon, and Mathini Sellathurai. Space-Time Layered Information Processing for Wireless Communications. Wiley & Sons, Incorporated, John, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Layered space-time code"

1

Xie, Bingyu, and Xiaofeng Liu. "Performance Analysis and FPGA Implementation of Layered Space–Time Code for Mobile Satellite Communication." In Lecture Notes in Electrical Engineering, 1294–99. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8411-4_171.

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

Margaria, Tiziana, Hafiz Ahmad Awais Chaudhary, Ivan Guevara, Stephen Ryan, and Alexander Schieweck. "The Interoperability Challenge: Building a Model-Driven Digital Thread Platform for CPS." In Lecture Notes in Computer Science, 393–413. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-89159-6_25.

Full text
Abstract:
AbstractWith the heterogeneity of the industry 4.0 world, and more generally of the Cyberphysical Systems realm, the quest towards a platform approach to solve the interoperability problem is front and centre to any system and system-of-systems project. Traditional approaches cover individual aspects, like data exchange formats and published interfaces. They may adhere to some standard, however they hardly cover the production of the integration layer, which is implemented as bespoke glue code that is hard to produce and even harder to maintain. Therefore, the traditional integration approach often leads to poor code quality, further increasing the time and cost and reducing the agility, and a high reliance on the individual development skills. We are instead tackling the interoperability challenge by building a model driven/low-code Digital Thread platform that 1) systematizes the integration methodology, 2) provides methods and techniques for the individual integrations based on a layered Domain Specific Languages (DSL) approach, 3) through the DSLs it covers the integration space domain by domain, technology by technology, and is thus highly generalizable and reusable, 4) showcases a first collection of examples from the domains of robotics, IoT, data analytics, AI/ML and web applications, 5) brings cohesiveness to the aforementioned heterogeneous platform, and 6) is easier to understand and maintain, even by not specialized programmers. We showcase the power, versatility and the potential of the Digital Thread platform on four interoperability case studies: the generic extension to REST services, to robotics through the UR family of robots, to the integration of various external databases (for data integration) and to the provision of data analytics capabilities in R.
APA, Harvard, Vancouver, ISO, and other styles
3

Deepa, T., and R. Kumar. "Alamouti Space Time Coded Design for OFDMA Systems Based Layered FFT Structure." In Advances in Intelligent Systems and Computing, 427–34. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-01778-5_44.

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

Leydesdorff, Loet. "Towards a Calculus of Redundancy." In Qualitative and Quantitative Analysis of Scientific and Scholarly Communication, 67–86. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-59951-5_4.

Full text
Abstract:
AbstractIn this chapter, I extend Shannon’s linear model of communication into a model in which communication is differentiated both vertically and horizontally (Simon, 1973). Following Weaver (1949), three layers are distinguished operating in relation to one another: (i) at level A, the events are sequenced historically along the arrow of time, generating Shannon-type information (that is, uncertainty); (ii) the incursion of meanings at level B is referential to (iii) horizons of meaning spanned by codes in the communication at level C. In other words, relations at level A are first distinguished from correlations among patterns of relations and non-relations at level B. The correlations span a vector space on top of the network of relations. Relations are positioned in this vector space and can then be provided with meaning. Different positions provide other perspectives and horizons of meaning. Perspectives can overlap, for example, in Triple-Helix relations. Overlapping perspectives can generate redundancies—that is, new options—as a result of synergies.
APA, Harvard, Vancouver, ISO, and other styles
5

"Layered Space-Time Codes." In Space-Time Coding, 185–222. Chichester, UK: John Wiley & Sons, Ltd, 2005. http://dx.doi.org/10.1002/047001413x.ch6.

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

"Layered Space-Time Codes (LSTC)." In Encyclopedia of Ocean Engineering, 922. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-10-6946-8_300409.

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

"Space-Time Turbo Codes and Turbo Decoding Principles." In Space-Time Layered Information Processing for Wireless Communications, 83–109. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2008. http://dx.doi.org/10.1002/9780470443637.ch4.

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

Cortez, Joaquin, and Miguel Bazdresch. "High-Rate, Reliable Communications with Hybrid Space-Time Codes." In Mobile and Wireless Communications Physical Layer Development and Implementatiom. InTech, 2010. http://dx.doi.org/10.5772/7690.

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

Sang, Aimin, Guosen Yue, Xiaodong Wang, and Mohammad Madihian. "Cross-Layer Performance of Scheduling and Power Control Schemes in Space-Time Block Coded Downlink Packet Systems." In Handbook on Advancements in Smart Antenna Technologies for Wireless Networks, 374–97. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-59904-988-5.ch018.

Full text
Abstract:
In this chapter, we consider a cellular downlink packet data system employing the space-time block coded (STBC) multiple- input-multiple-output (MIMO) scheme. Taking the CDMA high data rate (HDR) system for example, we evaluate the cross-layer performance of typical scheduling algorithms and a point-to-point power control scheme over a time division multiplexing (TDM)-based shared MIMO channel. Our evaluation focuses on the role of those schemes in multi-user diversity gain, and their impacts on medium access control (MAC) and physical layer performance metrics for delay-tolerant data services, such as throughput, fairness, and bit or frame error rate. The cross-layer evaluation shows that the multi-user diversity gain, which comes from opportunistic scheduling schemes exploiting independent channel oscillations among multiple users, can increase the aggregate throughput and reduce the transmission error rate. It also shows that STBC/MIMO and one-bit and multi-bit power control can indeed help the physical and MAC layer performance but only at a risk of limiting the multiuser diversity gain or the potential throughput of schedulers for delay-tolerant bursty data services.
APA, Harvard, Vancouver, ISO, and other styles
10

Pedrycz, Witold, and Athanasios Vasilakos. "Granular Models." In Novel Developments in Granular Computing, 243–63. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-324-1.ch010.

Full text
Abstract:
In contrast to numeric models, granular models produce results coming in a form of some information granules. Owing to the granularity of information these constructs dwell upon, such models become highly transparent and interpretable as well as operationally effective. Given also the fact that information granules come with a clearly defined semantics, granular models are often referred to as linguistic models. The crux of the design of the linguistic models studied in this paper exhibits two important features. First, the model is constructed on a basis of information granules which are assembled in the form of a web of associations between the granules formed in the output and input spaces. Given the semantics of information granules, we envision that a blueprint of the granular model can be formed effortlessly and with a very limited computing overhead. Second, the interpretability of the model is retained as the entire construct dwells on the conceptual entities of a well-defined semantics. The granulation of available data is accomplished by a carefully designed mechanism of fuzzy clustering which takes into consideration specific problem-driven requirements expressed by the designer at the time of the conceptualization of the model. We elaborate on a so-called context – based (conditional) Fuzzy C-Means (cond-FCM, for brief) to demonstrate how the fuzzy clustering is engaged in the design process. The clusters formed in the input space become induced (implied) by the context fuzzy sets predefined in the output space. The context fuzzy sets are defined in advance by the designer of the model so this design facet provides an active way of forming the model and in this manner becomes instrumental in the determination of a perspective at which a certain phenomenon is to be captured and modeled. This stands in a sharp contrast with most modeling approaches where the development is somewhat passive by being predominantly based on the existing data. The linkages between the fuzzy clusters induced by the given context fuzzy set in the output space are combined by forming a blueprint of the overall granular model. The membership functions of the context fuzzy sets are used as granular weights (connections) of the output processing unit (linear neuron) which subsequently lead to the granular output of the model thus identifying a feasible region of possible output values for the given input. While the above design is quite generic addressing a way in which information granules are assembled in the form of the model, we discuss further refinements which include (a) optimization of the context fuzzy sets, (b) inclusion of bias in the linear neuron at the output layer.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Layered space-time code"

1

Ormondroyd, R. F., and J. S. Dhanoa. "Comparison of space-time block code and layered space-time MIMO systems for an underwater acoustic channel." In Oceans 2005 - Europe. IEEE, 2005. http://dx.doi.org/10.1109/oceanse.2005.1511721.

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

Gun-Woong Park and Ji-Won Jung. "A study on MIMO-FTN scheme based on layered space time code using turbo codes." In 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2016. http://dx.doi.org/10.1109/icufn.2016.7537084.

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

Kuang, M. Y., Jinhong Yuan, and P. B. Rapajic. "Chebyshev detection of layered space time codes." In Proceedings of 2003 International Conference on Neural Networks and Signal Processing. IEEE, 2003. http://dx.doi.org/10.1109/icnnsp.2003.1281143.

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

Zheng, H., and K. J. R. Liu. "Power optimized space-time code for layer coded multimedia over wireless channels." In Proceedings of 6th International Conference on Image Processing (ICIP'99). IEEE, 1999. http://dx.doi.org/10.1109/icip.1999.817076.

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

El-Hajjar, Mohammed, Osamah Alamri, and Lajos Hanzo. "Layered Steered Space-Time Codes Using Iterative Detection." In 2007 IEEE Workshop on Signal Processing Systems. IEEE, 2007. http://dx.doi.org/10.1109/sips.2007.4387513.

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

Prasad, N., and M. K. Varanasi. "Optimum efficiently decodable layered space-time block codes." In Conference Record. Thirty-Fifth Asilomar Conference on Signals, Systems and Computers. IEEE, 2001. http://dx.doi.org/10.1109/acssc.2001.986910.

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

Kuo, Chih-Hung, Chang-Su Kim, and C. C. Jay Kuo. "Layered video transmission over space-time-coded systems." In International Symposium on Optical Science and Technology, edited by Andrew G. Tescher. SPIE, 2001. http://dx.doi.org/10.1117/12.449778.

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

Salim, Ahmad S., Salam A. Zummo, and Samir N. Al-Ghadhban. "Layered Steered Space Time Codes in multi-user systems." In 2010 4th International Conference on Signal Processing and Communication Systems (ICSPCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/icspcs.2010.5709683.

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

Bilen, Cagdas, Elza Erkip, and Yao Wang. "Layered video multicast using diversity embedded space time codes." In 2009 IEEE Sarnoff Symposium (SARNOFF). IEEE, 2009. http://dx.doi.org/10.1109/sarnof.2009.4850306.

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

Jihoon Kim and Inkyu Lee. "Coded layered space-time transmission with signal space diversity in OFDM systems." In GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. IEEE, 2005. http://dx.doi.org/10.1109/glocom.2005.1578494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Layered space-time code' 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