To see the other types of publications on this topic, follow the link: Space-Time Block Code (STBC).
Dissertations / Theses on the topic 'Space-Time Block Code (STBC)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Space-Time Block Code (STBC).'
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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Acharya, Om Nath, and Sabin Upadhyaya. "Space Time Coding For Wireless Communication." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-19424.
Full textAbstract:
As the demand of high data rate is increasing, a lot of research is being conducted in the field of wireless communication. A well-known channel coding technique called Space-Time Coding has been implemented in the wireless Communication systems using multiple antennas to ensure the high speed communication as well as reliability by exploiting limited spectrum and maintaining the power. In this thesis, Space-Time Coding is discussed along with other related topics with special focus on Alamouti Space-Time Block Code. The Alamouti Codes show good performance in terms of bit error rate over Rayleigh fading channel. The performance of Altamonte’s code and MIMO capacity is evaluated by using MATLAB simulation.
2
Colavito, Leonard R. "Evaluation of Space-Time Block Codes Under Controlled Fading Conditions Using Hardware Simulation." Diss., Temple University Libraries, 2010. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/66976.
Full textAbstract:
EngineeringPh.D.
Space time block codes (STBC) are a type of multiple input multiple output (MIMO) communications system that encode blocks of information into symbol sequences sent simultaneously from multiple antennas. MIMO communications systems have shown channel capacity improvement in multipath digital communications environments. The STBC class of MIMO communications systems can be easily decoded using linear combination and is resilient in the face of multipath channel effects. MIMO systems have traditionally been studied using theoretical analyses, simulations and real signal based experiments. Probabilistic models simulate channel effects as random variables, but are only estimates of actual conditions. Real signal experiments evaluate system performance under real-world conditions, but are not readily repeatable. Both modeling methods evaluate system performance in terms of the aggregate results. This dissertation research presents an approach that introduces controlled attenuation and delay to probabilistic channel models. This method allows the evaluation of MIMO system performance under specific channel conditions. The approach is demonstrated with a hardware accelerated STBC system model that is used to evaluate the performance of a MIMO system under controlled path conditions. The STBC system model utilizes a Xilinix® programmable gate array (PGA) device as a hardware accelerator. The model exploits the parallel processing capability of the PGA to simulate a nine path channel model and a three antenna rate ½ STBC. Novel implementations are developed for the additive white Gaussian noise (AWGN) sources and the linear MIMO decoding in PGA hardware. The model allows specification of overall noise and multipath fading effects for the channel as well as attenuation and phase delay for each channel path. Performance of the communications system is evaluated in terms of bit error rate (BER) versus signal-to-noise ratio (SNR). Hardware acceleration greatly reduces the time required to obtain simulation results. Reduced simulation time improves the use of the model by allowing evaluation of system performance under a greater number of conditions, greater performance curve resolution and evaluation at lower BER. The processing rate of the hardware accelerated model is compared to an equivalent software model. The model also provides an extensible platform for future research in communications theory.
Temple University--Theses
3
Ganji, Saichand. "Space-Time Block Coding to Achieve Spatial Diversity in a Multiple Input Multiple Output System." Ohio University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1534432423784957.
Full text
4
Saglam, Halil Derya. "Simulation performance of multiple-input multiple-output systems employing single-carrier modulation and orthogonal frequency division multiplexing." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FSaglam.pdf.
Full textAbstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, Dec. 2004.Thesis advisor(s): Murali Tummala, Roberto Cristi. Includes bibliographical references (p. 69-71). Also available online.
5
Qaja, Walid. "Distributed space time block coding and application in cooperative cognitive relay networks." Thesis, Loughborough University, 2015. https://dspace.lboro.ac.uk/2134/18832.
Full textAbstract:
The design and analysis of various distributed space time block coding schemes for cooperative relay networks is considered in this thesis. Rayleigh frequency flat and selective fading channels are assumed to model the links in the networks, and interference suppression techniques together with an orthogonal frequency division multiplexing (OFDM) type transmission approach are employed to mitigate synchronization errors at the destination node induced by the different delays through the relay nodes. Closed-loop space time block coding is first considered in the context of decode-and-forward (regenerative) networks. In particular, quasi orthogonal and extended orthogonal coding techniques are employed for transmission from four relay nodes and parallel interference cancellation detection is exploited to mitigate synchronization errors. Availability of a direct link between the source and destination nodes is studied. Outer coding is then added to gain further improvement in end-to-end performance and amplify-and-forward (non regenerative) type networks together with distributed space time coding are considered to reduce relay node complexity. A novel detection scheme is then proposed for decode-and-forward and amplify-and-forward networks with closed-loop extended orthogonal coding and closed-loop quasi-orthogonal coding which reduce the computational complexity of the parallel interference cancellation. The near-optimum detector is presented for relay nodes with single or dual antennas. End-to-end bit error rate simulations confirm the potential of the approach and its ability to mitigate synchronization errors.
6
Wang, Ruoyu. "Performance of Space-Time Block Code in MISO-OFDM system." Thesis, California State University, Long Beach, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10196062.
Full textAbstract:
Space-Time Code (STC) has caused wide public concern in the field of wireless communications over the recent years. Due to interference or signal attenuation, it may cause errors or data loss when the data stream is transmitted through a wireless channel. The Space-Time Block Code (STBC), which combines the technique of channel coding and antenna diversity, is an effective approach of increasing the capacity of a wireless channel by increasing both the coding gain and diversity gain. Using STBC in Orthogonal Frequency-Division Multiplexing (OFDM), multiple antennas transmit multiple copies of the data stream, and the receiver can integrate these copies for optimal data. In this system, the wireless signal is more reliable and able to meet more remote wireless transmissions. In this project, three STBCs are applied in 2x1, 3x1, and 4x1 OFDM system respectively, to provide different data rates and reliability.
7
Rice, Michael, Md Shah Afran, and Mohammed Saquib. "On the Application of Time-Reversed Space-Time Block Code to Aeronautical Telemetry." International Foundation for Telemetering, 2014. http://hdl.handle.net/10150/577453.
Full textAbstract:
ITC/USA 2014 Conference Proceedings / The Fiftieth Annual International Telemetering Conference and Technical Exhibition / October 20-23, 2014 / Town and Country Resort & Convention Center, San Diego, CAGeneralized time-reversed space-time block codes (GTR-STBC) are introduced as a conceptual tool to examine the impact of unequal power allocation in aeronautical telemetry channels. Two transmitting antennas are employed to exploit partial channel state information. GTR-STBC are observed to perform the best trade-off between the signal-to-noise ratio and inter symbol interference. It is also observed that the optimum transmitter power profile for the measured channel is significantly different than that in the statistical channel model.
8
Baker, Dirk A. "Space-time block coding with imperfect channel estimates." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=1843.
Full textAbstract:
Thesis (M.S.)--West Virginia University, 2001.Title from document title page. Document formatted into pages; contains iv, 74 p. : ill. Includes abstract. Includes bibliographical references (p. 73-74).
9
Chen, J., and K. Djouani. "A multi-user cooperative diversity for wireless local area networks." Scientific Research Publishing, 2008. http://encore.tut.ac.za/iii/cpro/DigitalItemViewPage.external?sp=1000783.
Full textAbstract:
In this paper, an idea of using space-time block coding (STBC) in multi-user cooperative diversity has been
exploited to improve the performance of the transmission in wireless local area networks. The theoretical
and simulation results show that, using STBC approaches can always achieve the better performance than
existing techniques without introducing the space-time coding. By analyzing the throughput and frame error
ratio (FER) of the two different STBC cooperative schemes, we find the trade-off between throughput and
reliability. The location of the relay is crucial to the performance, which supposes a rule for future crosslayer
design.
10
Chu, Alice Pin-Chen. "High-Rate Space-Time Block Codes in Frequency-Selective Fading Channels." Thesis, University of Canterbury. Electrical and Computer Engineering, 2012. http://hdl.handle.net/10092/10360.
Full textAbstract:
The growing popularity of wireless communications networks has resulted in greater bandwidth contention and therefore spectrally efficient transmission schemes are highly sought after by designers.
Space-time block codes (STBCs) in multiple-input, multiple-output (MIMO) systems are able to increase channel capacity as well as reduce error rate. A general linear space-time structure known as linear dispersion codes (LDCs) can be designed to achieve high-data rates and has been researched extensively for flat fading channels. However, very little research has been done on frequency-selective fading channels. The combination of ISI, signal interference from other transmitters and noise at the receiver mean that maximum likelihood sequence estimation (MLSE) requires high computational complexity. Detection schemes that can mitigate the signal interference can significantly reduce the complexity and allow intersymbol interference (ISI) equalization to be performed by a Viterbi decoder.
In this thesis, detection of LDCs on frequency-selective channels is investigated. Two predominant detection schemes are investigated, namely linear processing and zero forcing (ZF). Linear processing depends on code orthogonality and is only suited for short channels and small modulation schemes. ZF cancels interfering signals when a sufficient number of receive antennas is deployed. However, this number increases with the channel length. Channel decay profiles are investigated for high-rate LDCs to ameliorate this limitation. Performance improves when the equalizer assumes a shorter channel than the actual length provided the truncated taps carry only a small portion of the total channel power.
The LDC is also extended to a multiuser scenario where two independent users cooperate over half-duplex frequency-selective channels to achieve cooperative gain. The cooperative scheme transmits over three successive block intervals. Linear and zero-forcing detection are considered.
11
Hassan, Mohamed Abdulla S. "Channel Estimation and Equalisation for Multicarrier Systems Employing Orthogonal Space-Time Block Code." Thesis, University of Newcastle Upon Tyne, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.519490.
Full text
12
Nehete, Viraj Dileep. "Experimental evaluation of 2 x 2 MIMO in LOS and NLOS channels using NI USRP-2953R." Thesis, Queensland University of Technology, 2016. https://eprints.qut.edu.au/100019/1/Viraj%20Dileep_Nehete_Thesis.pdf.
Full textAbstract:
This research study investigates the performance of multiple antenna system with space-time block coding on a software defined radio platform. The method is based on the measurement of average bit error rate at different antenna spacing in line-of-sight and non-line-of-sight wireless channel conditions. Theoretical analysis and measurements results conclude that optimal antenna array spacing at the receiver side can significantly improve the performance of the wireless link.
13
Anoh, Kelvin Ogbonnaya Okorie. "Advanced MIMO-OFDM technique for future high speed braodband wireless communications : a study of OFDM design, using wavelet transform, fractional fourier transform, fast fourier transform, doppler effect, space-time coding for multiple input, multiple output wireless communications systems." Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14400.
Full textAbstract:
This work concentrates on the application of diversity techniques and space time block coding for future high speed mobile wireless communications on multicarrier systems. At first, alternative multicarrier kernels robust for high speed doubly-selective fading channel are sought. They include the comparisons of discrete Fourier transform (DFT), fractional Fourier transform (FrFT) and wavelet transform (WT) multicarrier kernels. Different wavelet types, including the raised-cosine spectrum wavelets are implemented, evaluated and compared. From different wavelet families, orthogonal wavelets are isolated from detailed evaluations and comparisons as suitable for multicarrier applications. The three transforms are compared over a doubly-selective channel with the WT significantly outperforming all for high speed conditions up to 300 km/hr. Then, a new wavelet is constructed from an ideal filter approximation using established wavelet design algorithms to match any signal of interest; in this case under bandlimited criteria. The new wavelet showed better performance than other traditional orthogonal wavelets. To achieve MIMO communication, orthogonal space-time block coding, OSTBC, is evaluated next. First, the OSTBC is extended to assess the performance of the scheme over extended receiver diversity order. Again, with the extended diversity conditions, the OSTBC is implemented for a multicarrier system over a doubly-selective fading channel. The MIMO-OFDM systems (implemented using DFT and WT kernels) are evaluated for different operating frequencies, typical of LTE standard, with Doppler effects. It was found that, during high mobile speed, it is better to transmit OFDM signals using lower operating frequencies. The information theory for the 2-transmit antenna OSTBC does not support higher order implementation of multi-antenna systems, which is required for the future generation wireless communications systems. Instead of the OSTBC, the QO-STBC is usually deployed to support the design of higher order multi-antenna systems other than the 2-transmit antenna scheme. The performances of traditional QO-STBC methods are diminished by some off-diagonal (interference) terms such that the resulting system does not attain full diversity. Some methods for eliminating the interference terms have earlier been discussed. This work follows the construction of cyclic matrices with Hadamard matrix to derive QO-STBC codes construction which are N-times better than interference free QO-STBC, where N is the number of transmit antenna branches.
14
Anoh, Kelvin O. O. "Advanced MIMO-OFDM technique for future high speed braodband wireless communications. A study of OFDM design, using wavelet transform, fractional fourier transform, fast fourier transform, doppler effect, space-time coding for multiple input, multiple output wireless communications systems." Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14400.
Full textAbstract:
This work concentrates on the application of diversity techniques and space time block coding
for future high speed mobile wireless communications on multicarrier systems.
At first, alternative multicarrier kernels robust for high speed doubly-selective fading channel are
sought. They include the comparisons of discrete Fourier transform (DFT), fractional Fourier
transform (FrFT) and wavelet transform (WT) multicarrier kernels. Different wavelet types,
including the raised-cosine spectrum wavelets are implemented, evaluated and compared.
From different wavelet families, orthogonal wavelets are isolated from detailed evaluations and
comparisons as suitable for multicarrier applications. The three transforms are compared over a
doubly-selective channel with the WT significantly outperforming all for high speed conditions up
to 300 km/hr.
Then, a new wavelet is constructed from an ideal filter approximation using established wavelet
design algorithms to match any signal of interest; in this case under bandlimited criteria. The
new wavelet showed better performance than other traditional orthogonal wavelets.
To achieve MIMO communication, orthogonal space-time block coding, OSTBC, is evaluated
next. First, the OSTBC is extended to assess the performance of the scheme over extended
receiver diversity order. Again, with the extended diversity conditions, the OSTBC is
implemented for a multicarrier system over a doubly-selective fading channel. The MIMO-OFDM
systems (implemented using DFT and WT kernels) are evaluated for different operating
frequencies, typical of LTE standard, with Doppler effects. It was found that, during high mobile
speed, it is better to transmit OFDM signals using lower operating frequencies.
The information theory for the 2-transmit antenna OSTBC does not support higher order
implementation of multi-antenna systems, which is required for the future generation wireless
communications systems. Instead of the OSTBC, the QO-STBC is usually deployed to support
the design of higher order multi-antenna systems other than the 2-transmit antenna scheme.
The performances of traditional QO-STBC methods are diminished by some off-diagonal
(interference) terms such that the resulting system does not attain full diversity. Some methods
for eliminating the interference terms have earlier been discussed. This work follows the
construction of cyclic matrices with Hadamard matrix to derive QO-STBC codes construction
which are N-times better than interference free QO-STBC, where N is the number of transmit
antenna branches.
15
Diameh, Yousef A. "The optimization of multiple antenna broadband wireless communications. A study of propagation, space-time coding and spatial envelope correlation in Multiple Input, Multiple Output radio systems." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/6361.
Full textAbstract:
This work concentrates on the application of diversity techniques and space time block coding for future mobile wireless communications.
The initial system analysis employs a space-time coded OFDM transmitter over a multipath Rayleigh channel, and a receiver which uses a selection combining diversity technique. The performance of this combined scenario is characterised in terms of the bit error rate and throughput. A novel four element QOSTBC scheme is introduced, it is created by reforming the detection matrix of the original QOSTBC scheme, for which an orthogonal channel matrix is derived. This results in a computationally less complex linear decoding scheme as compared with the original QOSTBC. Space time coding schemes for three, four and eight transmitters were also derived using a Hadamard matrix.
The practical optimization of multi-antenna networks is studied for realistic indoor and mixed propagation scenarios. The starting point is a detailed analysis of the throughput and field strength distributions for a commercial dual band 802.11n MIMO radio operating indoors in a variety of line of sight and non-line of sight scenarios. The physical model of the space is based on architectural schematics, and realistic propagation data for the construction materials. The modelling is then extended and generalized to a multi-storey indoor environment, and a large mixed site for indoor and outdoor channels based on the Bradford University campus.
The implications for the physical layer are also explored through the specification of antenna envelope correlation coefficients. Initially this is for an antenna module configuration with two independent antennas in close proximity. An operational method is proposed using the scattering parameters of the system and which incorporates the intrinsic power losses of the radiating elements. The method is extended to estimate the envelope correlation coefficient for any two elements in a general (N,N) MIMO antenna array. Three examples are presented to validate this technique, and very close agreement is shown to exist between this method and the full electromagnetic analysis using the far field antenna radiation patterns.
16
Dia'meh, Yousef Ali. "The optimization of multiple antenna broadband wireless communications : a study of propagation, space-time coding and spatial envelope correlation in Multiple Input, Multiple Output radio systems." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/6361.
Full textAbstract:
This work concentrates on the application of diversity techniques and space time block coding for future mobile wireless communications. The initial system analysis employs a space-time coded OFDM transmitter over a multipath Rayleigh channel, and a receiver which uses a selection combining diversity technique. The performance of this combined scenario is characterised in terms of the bit error rate and throughput. A novel four element QOSTBC scheme is introduced, it is created by reforming the detection matrix of the original QOSTBC scheme, for which an orthogonal channel matrix is derived. This results in a computationally less complex linear decoding scheme as compared with the original QOSTBC. Space time coding schemes for three, four and eight transmitters were also derived using a Hadamard matrix. The practical optimization of multi-antenna networks is studied for realistic indoor and mixed propagation scenarios. The starting point is a detailed analysis of the throughput and field strength distributions for a commercial dual band 802.11n MIMO radio operating indoors in a variety of line of sight and non-line of sight scenarios. The physical model of the space is based on architectural schematics, and realistic propagation data for the construction materials. The modelling is then extended and generalized to a multi-storey indoor environment, and a large mixed site for indoor and outdoor channels based on the Bradford University campus. The implications for the physical layer are also explored through the specification of antenna envelope correlation coefficients. Initially this is for an antenna module configuration with two independent antennas in close proximity. An operational method is proposed using the scattering parameters of the system and which incorporates the intrinsic power losses of the radiating elements. The method is extended to estimate the envelope correlation coefficient for any two elements in a general (N,N) MIMO antenna array. Three examples are presented to validate this technique, and very close agreement is shown to exist between this method and the full electromagnetic analysis using the far field antenna radiation patterns.
17
Vía, Rodríguez Javier. "Estima e igualación ciega de canales MIMO con y sin redundancia espacial." Doctoral thesis, Universidad de Cantabria, 2007. http://hdl.handle.net/10803/10666.
Full textAbstract:
La mayor parte de los sistemas de comunicaciones requieren el conocimiento previo del canal, el cual se suele estimar a partir de una secuencia de entrenamiento. Sin embargo, la transmisión de símbolos piloto se traduce en una reducción de la eficiencia espectral del sistema, lo que imposibilita que se alcancen los límites predichos por la Teoría de la Información. Este problema ha motivado el desarrollo de un gran número de técnicas para la estima e igualación ciega de canal, es decir, para la obtención del canal o la fuente sin necesidad de transmitir una señal de entrenamiento. Normalmente, estas técnicas se basan en el conocimiento previo de ciertas características de la señal, tales como su pertenencia a un alfabeto finito, o sus estadísticos de orden superior. Sin embargo, en el caso de sistemas de múltiples entradas y salidas (MIMO), se ha demostrado que los estadísticos de segundo orden de las observaciones proporcionan la información suficiente para resolver el problema ciego.El objetivo de esta Tesis consiste en la obtención de nuevas técnicas para la estima e igualación ciega de canales MIMO, tanto en sistemas con redundancia espacial, como en casos más generales en los que las fuentes no presentan ningún tipo particular de estructura. De manera general, los métodos propuestos se basan en los estadísticos de segundo orden de las observaciones. Sin embargo, las técnicas se presentan desde un punto de vista determinista, es decir, los algoritmos propuestos explotan directamente la estructura de las matrices de datos, lo que permite obtener resultados más precisos cuando se dispone de un número reducido de observaciones. Adicionalmente, la reformulación de los criterios propuestos como problemas clásicos del análisis estadístico de señales, ha permitido la obtención de algoritmos adaptativos eficientes para la estima e igualación de canales MIMO. En primer lugar se aborda el caso de sistemas sin redundancia. Más concretamente, se analiza el problema de igualación ciega de canales MIMO selectivos en frecuencia, el cual se reformula como un conjunto de problemas de análisis de correlaciones canónicas (CCA). La solución de los problemas CCA se puede obtener de manera directa mediante un problema de autovalores generalizado. Además, en esta Tesis se presenta un algoritmo adaptativo basado en la reformulación de CCA como un conjunto de problemas de regresión lineal acoplados. De esta manera, se obtienen nuevos algoritmos bloque y adaptativos para la igualación ciega de canales MIMO de una manera sencilla. Finalmente, el método propuesto se basa, como muchas otras técnicas ciegas, en el conocimiento a priori del orden del canal, lo que constituye un problema casi tan complicado como el de la estima o igualación ciega. Así, en el caso de canales de una entrada y varias salidas (SIMO), la combinación de la técnica propuesta con otros métodos para la estima ciega del canal permite obtener un nuevo criterio para extracción del orden de este tipo de canalesEn segundo lugar se considera el problema de estima ciega de canal en sistemas con algún tipo de redundancia o estructura espacial, con especial interés en el caso de sistemas con codificación espacio-temporal por bloques (STBC). Específicamente, se propone una nueva técnica para la estima ciega del canal, cuya complejidad se reduce a la extracción del autovector principal de una matriz de correlación modificada. El principal problema asociado a este tipo de sistemas viene dado por la existencia de ciertas ambigüedades a la hora de estimar el canal. En esta Tesis se plantea el problema de identificabilidad de una manera general, y en el caso de códigos ortogonales (OSTBCs) se presentan varios nuevos teoremas que aseguran la identificabilidad del canal en un gran número de casos. Adicionalmente, se proponen varias técnicas para la resolución de las ambigüedades, tanto en el caso OSTBC como para códigos más generales. En concreto, se introduce el concepto de diversidad de código, que consiste en la combinación de varios códigos STBC. Esta técnica permite resolver las indeterminaciones asociadas a un gran número de problemas, y en su versión más sencilla se reduce a una precodificación no redundante consistente en una simple rotación o permutación de las antenas transmisoras.En definitiva, en esta Tesis se abordan los problemas de estima e igualación ciega de canal en sistemas MIMO, y se presentan varias técnicas ciegas, cuyas prestaciones se evalúan mediante un gran número de ejemplos de simulación.The majority of communication systems need the previous knowledge of the channel, which is usually estimated by means of a training sequence. However, the transmission of pilot symbols provokes a reduction in bandwidth efficiency, which precludes the system from reaching the limits predicted by the Information Theory. This problem has motivated the development of a large number of blind channel estimation and equalization techniques, which are able to obtain the channel or the source without the need of transmitting a training signal. Usually, these techniques are based on the previous knowledge of certain properties of the signal, such as its belonging to a finite alphabet, or its higher-order statistics. However, in the case of multiple-input multiple-output (MIMO) systems, it has been proven that the second order statistics of the observations provide the sufficient information for solving the blind problem.The aim of this Thesis is the development of new blind MIMO channel estimation and equalization techniques, both in systems with spatial redundancy, and in more general cases where the sources do not have any particular spatial structure. In general, the proposed methods are based on the second order statistics of the observations. However, the techniques are presented from a deterministic point of view, i.e., the proposed algorithms directly exploit the structure of the data matrices, which allows us to obtain more accurate results when only a reduced number of observations is available. Additionally, the reformulation of the proposed criteria as classical statistical signal processing problems is exploited to obtain efficient adaptive algorithms for MIMO channel estimation and equalization.Firstly, we consider the case of systems without spatial redundancy. Specifically, we analyze the problem of blind equalization of frequency selective MIMO channels, which is reformulated as a set of canonical correlation analysis (CCA) problems. The solution of the CCA problems can be obtained by means of a generalized eigenvalue problem. In this Thesis, we present a new adaptive algorithm based on the reformulation of CCA as a set of coupled linear regression problems. Therefore, new batch and adaptive algorithms for blind MIMO channel equalization are easily obtained. Finally, the proposed method, as well as many other blind techniques, is based on the previous knowledge of the channel order, which is a problem nearly as complicated as the blind channel estimation or equalization. Thus, in the case of single-input multiple-output (SIMO) channels, the combination of the proposed technique with other blind channel estimation methods provides a new criterion for the order extraction of this class of channels.Secondly, we consider the problem of blind channel estimation in systems with some kind of redundancy or spatial structure, with special interest in space-time block coded (STBC) systems. Specifically, a new blind channel estimation technique is proposed, whose computational complexity reduces to the extraction of the principal eigenvector of a modified correlation matrix. The main problem in these cases is due to the existence of certain ambiguities associated to the blind channel estimation problem. In this Thesis the general identifiability problem is formulated and, in the case of orthogonal codes (OSTBCs), we present several new theorems which ensure the channel identifiability in a large number of cases. Additionally, several techniques for the resolution of the ambiguities are proposed, both in the OSTBC case as well as for more general codes. In particular, we introduce the concept of code diversity, which consists in the combination of several STBCs. This technique avoids the ambiguities associated to a large number of problems, and in its simplest version it reduces to a non-redundant precoding consisting of a single rotation or permutation of the transmit antennas.In summary, in this Thesis the blind MIMO channel estimation and equalization problems are analyzed, and several blind techniques are presented, whose performance is evaluated by means of a large number of simulation examples.
18
Ferré, Guillaume. "Codage spatio-temporel et techniques de décodage itératives pour systèmes multi-antennes : diversité temps espace, turbo détection, systèmes en couches." Limoges, 2006. https://aurore.unilim.fr/theses/nxfile/default/c6c2657a-ec3b-4d9b-8c63-ec8142d254f7/blobholder:0/2006LIMO0043.pdf.
Full textAbstract:
Dans ce mémoire nous étudions des techniques de réception multi-antennes capables de supprimer au mieux les interférences. Tout d'abord, nous avons généralisé le concept des codes SOSTTC, au cas de systèmes de transmission à trois antennes en utilisant des algorithmes de partitionnement des constellations transmises. Nous avons alors obtenu des codes spatio-temporels en treillis qui utilisent des codes spatio-temporels comme composants de base et qui présentent des gains de codage supérieurs aux STTC de la littérature. Nous avons ensuite étudié la concaténation parallèle et série de tels codes pour obtenir des turbo récepteurs. Nous finissons par l'étude des systèmes en couches. Nous étudions la structure d'un turbo-annuleur d'interférences concaténé avec des codes de type LDPC,. Puis nous généralisons l'utilisation des codes STTC qui utilisent des STBC comme composants de base au contexte des systèmes en couches pour un nombre d'antennes d'émission multiple de troisThis work, propose some system architectures which are able to suppress as better as possible the MIMO system interferences. First we have generalized SOSTTC concept, for three transmit antenna case, by using set partitioning. We propose a new STBC design for the case of three transmit antennas. Our goal is to show that it is possible to build powerful STTC codes with STBC designs with maximum transmission rate, even in the case where orthogonality is broken. Then, we studied serial and parallel concatenation to obtain turbo receivers. We found that if we use our new code in a serial concatenation with the Vucetic's turbo STTC, we are able to obtain outstanding performances. At the end, we present two new architectures of layered space-time codes. First we show a combination of BLAST architecture and of special STTC codes which are developed in the previous part, and second, we combine irregular LDPC codes with BLAST architecture
19
Sharma, G. V. V. "Performance Analysis Of Space-Time Coded Multiuser Detectors." Thesis, 2004. https://etd.iisc.ac.in/handle/2005/1203.
Full text
20
Sharma, G. V. V. "Performance Analysis Of Space-Time Coded Multiuser Detectors." Thesis, 2004. http://etd.iisc.ernet.in/handle/2005/1203.
Full text
21
Sripati, U. "Space-Time-Block Codes For MIMO Fading Channels From Codes Over Finite Fields." Thesis, 2004. https://etd.iisc.ac.in/handle/2005/1195.
Full text
22
Sripati, U. "Space-Time-Block Codes For MIMO Fading Channels From Codes Over Finite Fields." Thesis, 2004. http://etd.iisc.ernet.in/handle/2005/1195.
Full text
23
Dama, Yousef A. S., Hassan S. O. Migdadi, Wafa S. A. Shuaieb, Elmahdi A. Elkhazmi, E. A. Abdulmula, Raed A. Abd-Alhameed, W. Hammoudeh, and A. Masri. "A new approach for implementing QO-STBC over OFDM." 2015. http://hdl.handle.net/10454/9138.
Full textAbstract:
NoA new approach for implementing QO-STBC and DHSTBC over OFDM for four, eight and sixteen transmitter antennas is presented, which eliminates interference from the detection matrix and improves performance by increasing the diversity order on the transmitter side. The proposed code promotes diversity gain in comparison with the STBC scheme, and also reduces Inter Symbol Interference.
24
Natarajan, Lakshmi Prasad. "Low-Complexity Decoding and Construction of Space-Time Block Codes." Thesis, 2013. http://etd.iisc.ac.in/handle/2005/3372.
Full textAbstract:
Space-Time Block Coding is an efficient communication technique used in multiple-input multiple-output wireless systems. The complexity with which a Space-Time Block Code (STBC) can be decoded is important from an implementation point of view since it directly affects the receiver complexity and speed. In this thesis, we address the problem of designing low complexity decoding techniques for STBCs, and constructing STBCs that achieve high rate and full-diversity with these decoders. This thesis is divided into two parts; the first is concerned with the optimal decoder, viz. the maximum-likelihood (ML) decoder, and the second with non-ML decoders.
An STBC is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into several groups such that each symbol group can be ML decoded independently of the others, and thereby admitting low complexity ML decoding. In this thesis, we first give a new framework for constructing low ML decoding complexity STBCs using codes over the Klein group, and show that almost all known low ML decoding complexity STBCs can be obtained by this method. Using this framework we then construct new full-diversity STBCs that have the least known ML decoding complexity for a large set of choices of number of transmit antennas and rate. We then introduce the notion of Asymptotically-Good (AG) multigroup ML decodable codes, which are families of multigroup ML decodable codes whose rate increases linearly with the number of transmit antennas. We give constructions for full-diversity AG multigroup ML decodable codes for each number of groups g > 1. For g > 2, these are the first instances of g-group ML decodable codes that are AG or have rate more than 1. For g = 2 and identical delay, the new codes match the known families of AG codes in terms of rate. In the final section of the first part we show that the upper triangular matrix R encountered during the sphere-decoding of STBCs can be rank-deficient, thus leading to higher sphere-decoding complexity, even when the rate is less than the minimum of the number of transmit antennas and the number receive antennas. We show that all known AG multigroup ML decodable codes suffer from such rank-deficiency, and we explicitly derive the sphere-decoding complexities of most known AG multigroup ML decodable codes.
In the second part of this thesis we first study a low complexity non-ML decoder introduced by Guo and Xia called Partial Interference Cancellation (PIC) decoder. We give a new full-diversity criterion for PIC decoding of STBCs which is equivalent to the criterion of Guo and Xia, and is easier to check. We then show that Distributed STBCs (DSTBCs) used in wireless relay networks can be full-diversity PIC decoded, and we give a full-diversity criterion for the same. We then construct full-diversity PIC decodable STBCs and DSTBCs which give higher rate and better error performance than known multigroup ML decodable codes for similar decoding complexity, and which include other known full-diversity PIC decodable codes as special cases. Finally, inspired by a low complexity essentially-ML decoder given by Sirianunpiboon et al. for the two and three antenna Perfect codes, we introduce a new non-ML decoder called Adaptive Conditional Zero-Forcing (ACZF) decoder which includes the technique of Sirianunpiboon et al. as a special case. We give a full-diversity criterion for ACZF decoding, and show that the Perfect codes for two, three and four antennas, the Threaded Algebraic Space-Time code, and the 4 antenna rate 2 code of Srinath and Rajan satisfy this criterion. Simulation results show that the proposed decoder performs identical to ML decoding for these five codes. These STBCs along with ACZF decoding have the best error performance with least complexity among all known STBCs for four or less transmit antennas.
25
Natarajan, Lakshmi Prasad. "Low-Complexity Decoding and Construction of Space-Time Block Codes." Thesis, 2013. http://etd.iisc.ernet.in/2005/3372.
Full textAbstract:
Space-Time Block Coding is an efficient communication technique used in multiple-input multiple-output wireless systems. The complexity with which a Space-Time Block Code (STBC) can be decoded is important from an implementation point of view since it directly affects the receiver complexity and speed. In this thesis, we address the problem of designing low complexity decoding techniques for STBCs, and constructing STBCs that achieve high rate and full-diversity with these decoders. This thesis is divided into two parts; the first is concerned with the optimal decoder, viz. the maximum-likelihood (ML) decoder, and the second with non-ML decoders.
An STBC is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into several groups such that each symbol group can be ML decoded independently of the others, and thereby admitting low complexity ML decoding. In this thesis, we first give a new framework for constructing low ML decoding complexity STBCs using codes over the Klein group, and show that almost all known low ML decoding complexity STBCs can be obtained by this method. Using this framework we then construct new full-diversity STBCs that have the least known ML decoding complexity for a large set of choices of number of transmit antennas and rate. We then introduce the notion of Asymptotically-Good (AG) multigroup ML decodable codes, which are families of multigroup ML decodable codes whose rate increases linearly with the number of transmit antennas. We give constructions for full-diversity AG multigroup ML decodable codes for each number of groups g > 1. For g > 2, these are the first instances of g-group ML decodable codes that are AG or have rate more than 1. For g = 2 and identical delay, the new codes match the known families of AG codes in terms of rate. In the final section of the first part we show that the upper triangular matrix R encountered during the sphere-decoding of STBCs can be rank-deficient, thus leading to higher sphere-decoding complexity, even when the rate is less than the minimum of the number of transmit antennas and the number receive antennas. We show that all known AG multigroup ML decodable codes suffer from such rank-deficiency, and we explicitly derive the sphere-decoding complexities of most known AG multigroup ML decodable codes.
In the second part of this thesis we first study a low complexity non-ML decoder introduced by Guo and Xia called Partial Interference Cancellation (PIC) decoder. We give a new full-diversity criterion for PIC decoding of STBCs which is equivalent to the criterion of Guo and Xia, and is easier to check. We then show that Distributed STBCs (DSTBCs) used in wireless relay networks can be full-diversity PIC decoded, and we give a full-diversity criterion for the same. We then construct full-diversity PIC decodable STBCs and DSTBCs which give higher rate and better error performance than known multigroup ML decodable codes for similar decoding complexity, and which include other known full-diversity PIC decodable codes as special cases. Finally, inspired by a low complexity essentially-ML decoder given by Sirianunpiboon et al. for the two and three antenna Perfect codes, we introduce a new non-ML decoder called Adaptive Conditional Zero-Forcing (ACZF) decoder which includes the technique of Sirianunpiboon et al. as a special case. We give a full-diversity criterion for ACZF decoding, and show that the Perfect codes for two, three and four antennas, the Threaded Algebraic Space-Time code, and the 4 antenna rate 2 code of Srinath and Rajan satisfy this criterion. Simulation results show that the proposed decoder performs identical to ML decoding for these five codes. These STBCs along with ACZF decoding have the best error performance with least complexity among all known STBCs for four or less transmit antennas.
26
Shashidhar, V. "High-Rate And Information-Lossless Space-Time Block Codes From Crossed-Product Algebras." Thesis, 2004. https://etd.iisc.ac.in/handle/2005/314.
Full textAbstract:
It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. It has been shown that coding across both spatial and temporal domains together, called Space-Time Coding (STC), achieves, a diversity order equal to the product of the number of transmit and receive antennas. Space-Time Block Codes (STBC) achieving the maximum diversity is called full-diversity STBCs. An STBC is called information-lossless, if the structure of it is such that the maximum mutual information of the resulting equivalent channel is equal to the capacity of the channel.
This thesis deals with high-rate and information-lossless STBCs obtained from certain matrix algebras called Crossed-Product Algebras. First we give constructions of high-rate STBCs using both commutative and non-commutative matrix algebras obtained from appropriate representations of extensions of the field of rational numbers. In the case of commutative algebras, we restrict ourselves to fields and call the STBCs obtained from them as STBCs from field extensions. In the case of non-commutative algebras, we consider only the class of crossed-product algebras.
For the case of field extensions, we first construct high-rate; full-diversity STBCs for arbitrary number of transmit antennas, over arbitrary apriori specified signal sets. Then we obtain a closed form expression for the coding gain of these STBCs and give a tight lower bound on the coding gain of some of these STBCs. This lower bound in certain cases indicates that some of the STBCs from field extensions are optimal m the sense of coding gain. We then show that the STBCs from field extensions are information-lossy. However, we also show that the finite-signal-set capacity of the STBCs from field extensions can be improved by increasing the symbol rate of the STBCs. The simulation results presented show that our high-rate STBCs perform better than the rate-1 STBCs in terms of the bit error rate performance.
Then we proceed to present a construction of high-rate STBCs from crossed-product algebras. After giving a sufficient condition on the crossed-product algebras under which the resulting STBCs are information-lossless, we identify few classes of crossed-product algebras that satisfy this sufficient condition and also some classes of crossed-product algebras which are division algebras which lead to full-diversity STBCs. We present simulation results to show that the STBCs from crossed-product algebras perform better than the well-known codes m terms of the bit error rate.
Finally, we introduce the notion of asymptotic-information-lossless (AILL) designs and give a necessary and sufficient condition under which a linear design is an AILL design. Analogous to the condition that a design has to be a full-rank design to achieve the point corresponding to the maximum diversity of the optimal diversity-multiplexing tradeoff, we show that a design has to be AILL to achieve the point corresponding to the maximum multiplexing gain of the optimal diversity-multiplexing tradeoff. Using the notion of AILL designs, we give a lower bound on the diversity-multiplexing tradeoff achieved by the STBCs from both field extensions and division algebras. The lower bound for STBCs obtained from division algebras indicates that they achieve the two extreme points, 1 e, zero multiplexing gain and zero diversity gain, of the optimal diversity-multiplexing tradeoff. Also, we show by simulation results that STBCs from division algebras achieves all the points on the optimal diversity-multiplexing tradeoff for n transmit and n receive antennas, where n = 2, 3, 4.
27
Shashidhar, V. "High-Rate And Information-Lossless Space-Time Block Codes From Crossed-Product Algebras." Thesis, 2004. http://hdl.handle.net/2005/314.
Full textAbstract:
It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. It has been shown that coding across both spatial and temporal domains together, called Space-Time Coding (STC), achieves, a diversity order equal to the product of the number of transmit and receive antennas. Space-Time Block Codes (STBC) achieving the maximum diversity is called full-diversity STBCs. An STBC is called information-lossless, if the structure of it is such that the maximum mutual information of the resulting equivalent channel is equal to the capacity of the channel.
This thesis deals with high-rate and information-lossless STBCs obtained from certain matrix algebras called Crossed-Product Algebras. First we give constructions of high-rate STBCs using both commutative and non-commutative matrix algebras obtained from appropriate representations of extensions of the field of rational numbers. In the case of commutative algebras, we restrict ourselves to fields and call the STBCs obtained from them as STBCs from field extensions. In the case of non-commutative algebras, we consider only the class of crossed-product algebras.
For the case of field extensions, we first construct high-rate; full-diversity STBCs for arbitrary number of transmit antennas, over arbitrary apriori specified signal sets. Then we obtain a closed form expression for the coding gain of these STBCs and give a tight lower bound on the coding gain of some of these STBCs. This lower bound in certain cases indicates that some of the STBCs from field extensions are optimal m the sense of coding gain. We then show that the STBCs from field extensions are information-lossy. However, we also show that the finite-signal-set capacity of the STBCs from field extensions can be improved by increasing the symbol rate of the STBCs. The simulation results presented show that our high-rate STBCs perform better than the rate-1 STBCs in terms of the bit error rate performance.
Then we proceed to present a construction of high-rate STBCs from crossed-product algebras. After giving a sufficient condition on the crossed-product algebras under which the resulting STBCs are information-lossless, we identify few classes of crossed-product algebras that satisfy this sufficient condition and also some classes of crossed-product algebras which are division algebras which lead to full-diversity STBCs. We present simulation results to show that the STBCs from crossed-product algebras perform better than the well-known codes m terms of the bit error rate.
Finally, we introduce the notion of asymptotic-information-lossless (AILL) designs and give a necessary and sufficient condition under which a linear design is an AILL design. Analogous to the condition that a design has to be a full-rank design to achieve the point corresponding to the maximum diversity of the optimal diversity-multiplexing tradeoff, we show that a design has to be AILL to achieve the point corresponding to the maximum multiplexing gain of the optimal diversity-multiplexing tradeoff. Using the notion of AILL designs, we give a lower bound on the diversity-multiplexing tradeoff achieved by the STBCs from both field extensions and division algebras. The lower bound for STBCs obtained from division algebras indicates that they achieve the two extreme points, 1 e, zero multiplexing gain and zero diversity gain, of the optimal diversity-multiplexing tradeoff. Also, we show by simulation results that STBCs from division algebras achieves all the points on the optimal diversity-multiplexing tradeoff for n transmit and n receive antennas, where n = 2, 3, 4.
28
Raj, Kumar K. "Construction Of High-Rate, Reliable Space-Time Codes." Thesis, 2005. https://etd.iisc.ac.in/handle/2005/1413.
Full text
29
Raj, Kumar K. "Construction Of High-Rate, Reliable Space-Time Codes." Thesis, 2005. http://etd.iisc.ernet.in/handle/2005/1413.
Full text
30
Kiran, T. "Coding For Multi-Antenna Wireless Systems And Wireless Relay Networks." Thesis, 2006. https://etd.iisc.ac.in/handle/2005/399.
Full textAbstract:
Communication over a wireless channel is a challenging task because of the inherent fading effects. Any wireless communication system employs some form of diversity improving techniques in order to improve the reliability of the channel. This thesis deals with efficient code design for two different spatial diversity techniques, viz, diversity by employing multiple antennas at the transmitter and/or the receiver, and diversity through cooperative commu-
nication between users. In other words, this thesis deals with efficient code design for (1) multiple-input multiple-output (MIMO) channels, and (2) wireless relay channels. Codes for the MIMO channel are termed space-time (ST) codes and those for the relay channels are called distributed ST codes.
The first part of the thesis focuses on ST code construction for MIMO fading channel with perfect channel state information (CSI) at the receiver, and no CSI at the transmitter. As a measure of performance we use the rate-diversity tradeoff and the Diversity-Multiplexing Gain (D-MG) Tradeoff,
which are two different tradeoffs characterizing the tradeoff between the rate
and the reliability achievable by any ST code. We provide two types of code
constructions that are optimal with respect to the rate-diversity tradeoff; one is based on the rank-distance codes which are traditionally applied as codes for storage devices, and the second construction is based on a matrix representation of a cayley algebra. The second contribution in ST code constructions is related to codes with
a certain nonvanishing determinant (NVD) property. Motivation for these constructions is a recent result on the necessary and sufficient conditions for an ST code to achieve the D-MG tradeoff. Explicit code constructions satisfying these conditions are provided for certain number of transmit antennas.
The second part of the thesis focuses on distributed ST code construction for wireless relay channel. The transmission protocol follows a two-hop model wherein the source broadcasts a vector in the first hop and in the second hop the relays transmit a vector that is a transformation of the received vector by a relay-specific unitary transformation. While the source and relays do not have CSI, at the destination we assume two different scenarios (a) destina-
tion with complete CSI (b) destination with only the relay-destination CSI. For both these scenarios, we derive a Chernoff bound on the pair-wise error probability and propose code design criteria. For the first case, we provide explicit construction of distributed ST codes with lower decoding complexity compared to codes based on some earlier system models. For the latter case,
we propose a novel differential encoding and differential decoding technique and also provide explicit code constructions.
At the heart of all these constructions is the cyclic division algebra (CDA) and its matrix representations. We translate the problem of code construction in each of the above scenarios to the problem of constructing CDAs satisfying certain properties. Explicit examples are provided to illustrate each of these constructions.
31
Kiran, T. "Coding For Multi-Antenna Wireless Systems And Wireless Relay Networks." Thesis, 2006. http://hdl.handle.net/2005/399.
Full textAbstract:
Communication over a wireless channel is a challenging task because of the inherent fading effects. Any wireless communication system employs some form of diversity improving techniques in order to improve the reliability of the channel. This thesis deals with efficient code design for two different spatial diversity techniques, viz, diversity by employing multiple antennas at the transmitter and/or the receiver, and diversity through cooperative commu-
nication between users. In other words, this thesis deals with efficient code design for (1) multiple-input multiple-output (MIMO) channels, and (2) wireless relay channels. Codes for the MIMO channel are termed space-time (ST) codes and those for the relay channels are called distributed ST codes.
The first part of the thesis focuses on ST code construction for MIMO fading channel with perfect channel state information (CSI) at the receiver, and no CSI at the transmitter. As a measure of performance we use the rate-diversity tradeoff and the Diversity-Multiplexing Gain (D-MG) Tradeoff,
which are two different tradeoffs characterizing the tradeoff between the rate
and the reliability achievable by any ST code. We provide two types of code
constructions that are optimal with respect to the rate-diversity tradeoff; one is based on the rank-distance codes which are traditionally applied as codes for storage devices, and the second construction is based on a matrix representation of a cayley algebra. The second contribution in ST code constructions is related to codes with
a certain nonvanishing determinant (NVD) property. Motivation for these constructions is a recent result on the necessary and sufficient conditions for an ST code to achieve the D-MG tradeoff. Explicit code constructions satisfying these conditions are provided for certain number of transmit antennas.
The second part of the thesis focuses on distributed ST code construction for wireless relay channel. The transmission protocol follows a two-hop model wherein the source broadcasts a vector in the first hop and in the second hop the relays transmit a vector that is a transformation of the received vector by a relay-specific unitary transformation. While the source and relays do not have CSI, at the destination we assume two different scenarios (a) destina-
tion with complete CSI (b) destination with only the relay-destination CSI. For both these scenarios, we derive a Chernoff bound on the pair-wise error probability and propose code design criteria. For the first case, we provide explicit construction of distributed ST codes with lower decoding complexity compared to codes based on some earlier system models. For the latter case,
we propose a novel differential encoding and differential decoding technique and also provide explicit code constructions.
At the heart of all these constructions is the cyclic division algebra (CDA) and its matrix representations. We translate the problem of code construction in each of the above scenarios to the problem of constructing CDAs satisfying certain properties. Explicit examples are provided to illustrate each of these constructions.
32
Tsai, Jih-Lin, and 蔡季霖. "Performance Analysis of Space-Time Block Code and Space-Frequency Block Code over Wireless Fading Channel." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/61053280341956313881.
Full textAbstract:
碩士國立中興大學
通訊工程研究所
96
Space-time coding had improved the performance of wireless transmission. And this technology had been implemented into many wireless transmission standards. The reason that we choose this subject as our research field is because of the WiMAX technol-ogy. We take the STBC and OFDM system to simulate the performance results of both STBC only and STBC-OFDM system. The environment is using the European standard COST 207 as the channel to transmit datas. First, we will take the STBC schemes proposed by Alamouti and Tarokh to transmit through the flat-fading channel to see the system performance. Then implying the OFDM system to substitute the transmission in time domain to transmission in fre- quency domain. Later on, we will simulate the system transmission without OFDM and with OFDM over multipath fading channel, to see the improvement of the performance.
33
Paul, Prabal. "On The Peak-To-Average-Power-Ratio Of Affine Linear Codes." Thesis, 2006. https://etd.iisc.ac.in/handle/2005/350.
Full textAbstract:
Employing an error control code is one of the techniques to reduce the Peak-to-Average Power Ratio (PAPR) in an Orthogonal Frequency Division Multiplexing system; a well known class of such codes being the cosets of Reed-Muller codes. In this thesis, classes of such coset-codes of arbitrary linear codes are considered. It has been proved that the size of such a code can be doubled with marginal/no increase in the PAPR. Conditions for employing this method iteratively have been enunciated. In fact this method has enabled to get the optimal coset-codes. The PAPR of the coset-codes of the extended codes is obtained from the PAPR of the corresponding coset-codes of the parent code. Utility of a special type of lengthening is established in PAPR studies
34
Paul, Prabal. "On The Peak-To-Average-Power-Ratio Of Affine Linear Codes." Thesis, 2006. http://hdl.handle.net/2005/350.
Full textAbstract:
Employing an error control code is one of the techniques to reduce the Peak-to-Average Power Ratio (PAPR) in an Orthogonal Frequency Division Multiplexing system; a well known class of such codes being the cosets of Reed-Muller codes. In this thesis, classes of such coset-codes of arbitrary linear codes are considered. It has been proved that the size of such a code can be doubled with marginal/no increase in the PAPR. Conditions for employing this method iteratively have been enunciated. In fact this method has enabled to get the optimal coset-codes. The PAPR of the coset-codes of the extended codes is obtained from the PAPR of the corresponding coset-codes of the parent code. Utility of a special type of lengthening is established in PAPR studies
35
Jithamithra, G. R. "Space-Time Block Codes With Low Sphere-Decoding Complexity." Thesis, 2013. https://etd.iisc.ac.in/handle/2005/2612.
Full textAbstract:
One of the most popular ways to exploit the advantages of a multiple-input multiple-output (MIMO) system is using space time block coding. A space time block code (STBC) is a finite set of complex matrices whose entries consist of the information symbols to be transmitted. A linear STBC is one in which the information symbols are linearly combined to form a two-dimensional code matrix. A well known method of maximum-likelihood (ML) decoding of such STBCs is using the sphere decoder (SD).
In this thesis, new constructions of STBCs with low sphere decoding complexity are presented and various ways of characterizing and reducing the sphere decoding complexity of an STBC are addressed. The construction of low sphere decoding complexity STBCs is tackled using irreducible matrix representations of Clifford algebras, cyclic division algebras and crossed-product algebras. The complexity reduction algorithms for the STBCs constructed are explored using tree based search algorithms. Considering an STBC as a vector space over the set of weight matrices, the problem of characterizing the sphere decoding complexity is addressed using quadratic form representations. The main results are as follows.
A sub-class of fast decodable STBCs known as Block Orthogonal STBCs (BOSTBCs) are explored. A set of sufficient conditions to obtain BOSTBCs are explained. How the block orthogonal structure of these codes can be exploited to reduce the SD complexity of the STBC is then explained using a depth first tree search algorithm. Bounds on the SD complexity reduction and its relationship with the block orthogonal structure are then addressed. A set of constructions to obtain BOSTBCs are presented next using Clifford unitary weight designs (CUWDs), Coordinate-interleaved orthogonal designs (CIODs), cyclic division algebras and crossed product algebras which show that a lot of codes existing in literature exhibit the block orthogonal property.
Next, the dependency of the ordering of information symbols on the SD complexity is discussed following which a quadratic form representation known as the Hurwitz-Radon quadratic form (HRQF) of an STBC is presented which is solely dependent on the weight matrices of the STBC and their ordering. It is then shown that the SD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization). It is also shown that the SD complexity is completely captured into a single matrix obtained from the HRQF.
Also, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least SD complexity is presented using the HRQF matrix.
36
Jithamithra, G. R. "Space-Time Block Codes With Low Sphere-Decoding Complexity." Thesis, 2013. http://etd.iisc.ernet.in/handle/2005/2612.
Full textAbstract:
One of the most popular ways to exploit the advantages of a multiple-input multiple-output (MIMO) system is using space time block coding. A space time block code (STBC) is a finite set of complex matrices whose entries consist of the information symbols to be transmitted. A linear STBC is one in which the information symbols are linearly combined to form a two-dimensional code matrix. A well known method of maximum-likelihood (ML) decoding of such STBCs is using the sphere decoder (SD).
In this thesis, new constructions of STBCs with low sphere decoding complexity are presented and various ways of characterizing and reducing the sphere decoding complexity of an STBC are addressed. The construction of low sphere decoding complexity STBCs is tackled using irreducible matrix representations of Clifford algebras, cyclic division algebras and crossed-product algebras. The complexity reduction algorithms for the STBCs constructed are explored using tree based search algorithms. Considering an STBC as a vector space over the set of weight matrices, the problem of characterizing the sphere decoding complexity is addressed using quadratic form representations. The main results are as follows.
A sub-class of fast decodable STBCs known as Block Orthogonal STBCs (BOSTBCs) are explored. A set of sufficient conditions to obtain BOSTBCs are explained. How the block orthogonal structure of these codes can be exploited to reduce the SD complexity of the STBC is then explained using a depth first tree search algorithm. Bounds on the SD complexity reduction and its relationship with the block orthogonal structure are then addressed. A set of constructions to obtain BOSTBCs are presented next using Clifford unitary weight designs (CUWDs), Coordinate-interleaved orthogonal designs (CIODs), cyclic division algebras and crossed product algebras which show that a lot of codes existing in literature exhibit the block orthogonal property.
Next, the dependency of the ordering of information symbols on the SD complexity is discussed following which a quadratic form representation known as the Hurwitz-Radon quadratic form (HRQF) of an STBC is presented which is solely dependent on the weight matrices of the STBC and their ordering. It is then shown that the SD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization). It is also shown that the SD complexity is completely captured into a single matrix obtained from the HRQF.
Also, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least SD complexity is presented using the HRQF matrix.
37
Zhuang, Wen-Hao, and 莊雯皓. "Space-Time-Frequency Block Code for Wireless Communication." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/75297184421154922874.
Full textAbstract:
碩士中原大學
電子工程研究所
94
In the wireless communication system, space time block code (STBC) has been proved that it is a coding technology to combat fading channel effectively and it has a low complexity in decoding. OFDM system is well-known to be effective against multipath distortion. Space-Time-Frequency Block coded OFDM scheme combines OFDM and STBC so that the diversity in space, time and frequency is exploited to provide high quality of transmission for wireless communications over frequency selective fading channel and it has low complexity in decoding. Previous works assume that known channel state information is available for decoding processes, but it is not the case in practice. Therefore, we apply the pilot tone technique to estimate channel state in decoding. Finally, we will get our simulation results according to some important parameters.
38
Sapenov, Yerzhan. "Performance Analysis of DC-offset STBCs for MIMO Optical Wireless Communications." Thesis, 2017. http://hdl.handle.net/10754/623421.
Full textAbstract:
In this report, an optical wireless multiple-input multiple-output communication system employing intensity-modulation direct-detection is considered. The performance of direct current offset space-time block codes (DC-STBC) is studied in terms of pairwise error probability (PEP). It is shown that among the class of DC-STBCs, the worst case PEP corresponding to the minimum distance between two codewords is minimized by repetition coding (RC), under both electrical and optical individual power constraints. It follows that among all DC-STBCs, RC is optimal in terms of worst-case PEP for static channels and also for varying channels under any turbulence statistics. This result agrees with previously published numerical results showing the superiority of RC in such systems. It also agrees with previously published analytic results on this topic under log-normal turbulence and further extends it to arbitrary turbulence statistics. This shows the redundancy of the time-dimension of the DCSTBC in this system. This result is further extended to sum power constraints with static and turbulent channels, where it is also shown that the time dimension is redundant, and the optimal DC-STBC has a spatial beamforming structure. Numerical
results are provided to demonstrate the difference in performance for systems with different numbers of receiving apertures and different throughput.
39
Das, Smarajit. "Low-PAPR, Low-delay, High-Rate Space-Time Block Codes From Orthogonal Designs." Thesis, 2009. https://etd.iisc.ac.in/handle/2005/1046.
Full textAbstract:
It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. Some of the design criteria of the space-time block codes (STBCs) for multiple input multiple output (MIMO)communication system are that these codes should attain large transmit diversity, high data-rate, low decoding-complexity, low decoding –delay and low peak-to-average power ratio (PAPR). STBCs based on real orthogonal designs (RODs) and complex orthogonal designs (CODs) achieve full transmit diversity and in addition, these codes are single-symbol maximum-likelihood (ML) decodable. It has been observed that the data-rate (in number of information symbols per channel use) of the square CODs falls exponentially with increase in number of antennas and it has led to the construction of rectangular CODs with high rate.
We have constructed a class of maximal-rate CODs for n transmit antennas with rate if n is even and if n is odd. The novelty of the above construction is that they 2n+1 are constructed from square CODs. Though these codes have a high rate, this is achieved at the expense of large decoding delay especially when the number of antennas is 5or more. Moreover the rate also converges to half as the number of transmit antennas increases. We give a construction of rate-1/2 CODs with a substantial reduction in decoding delay when compared with the maximal- rate codes.
Though there is a significant improvement in the rate of the codes mentioned above when compared with square CODs for the same number of antennas, the decoding delay of these codes is still considerably high. For certain applications, it is desirable to construct codes which are balanced with respect to both rate and decoding delay. To this end, we have constructed high rate and low decoding-delay RODs and CODs from Cayley-Dickson Algebra.
Apart from the rate and decoding delay of orthogonal designs, peak-to-average power ratio (PAPR) of STBC is very important from implementation point of view. The standard constructions of square complex orthogonal designs contain a large number of zeros in the matrix result in gin high PAPR. We have given a construction for square complex orthogonal designs with lesser number of zero entries than the known constructions. When a + 1 is a power of 2, we get codes with no zero entries. Further more, we get complex orthogonal designs with no zero entry for any power of 2 antennas by introducing co- ordinate interleaved variables in the design matrix. These codes have significant advantage over the existing codes in term of PAPR. The only sacrifice that is made in the construction of these codes is that the signaling complexity (of these codes) is marginally greater than the existing codes (with zero entries) for some of the entries in the matrix consist of co-ordinate interleaved variables. Also a class of maximal-rate CODs
(For mathematical equations pl see the pdf file)
40
Das, Smarajit. "Low-PAPR, Low-delay, High-Rate Space-Time Block Codes From Orthogonal Designs." Thesis, 2009. http://hdl.handle.net/2005/1046.
Full textAbstract:
It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. Some of the design criteria of the space-time block codes (STBCs) for multiple input multiple output (MIMO)communication system are that these codes should attain large transmit diversity, high data-rate, low decoding-complexity, low decoding –delay and low peak-to-average power ratio (PAPR). STBCs based on real orthogonal designs (RODs) and complex orthogonal designs (CODs) achieve full transmit diversity and in addition, these codes are single-symbol maximum-likelihood (ML) decodable. It has been observed that the data-rate (in number of information symbols per channel use) of the square CODs falls exponentially with increase in number of antennas and it has led to the construction of rectangular CODs with high rate.
We have constructed a class of maximal-rate CODs for n transmit antennas with rate if n is even and if n is odd. The novelty of the above construction is that they 2n+1 are constructed from square CODs. Though these codes have a high rate, this is achieved at the expense of large decoding delay especially when the number of antennas is 5or more. Moreover the rate also converges to half as the number of transmit antennas increases. We give a construction of rate-1/2 CODs with a substantial reduction in decoding delay when compared with the maximal- rate codes.
Though there is a significant improvement in the rate of the codes mentioned above when compared with square CODs for the same number of antennas, the decoding delay of these codes is still considerably high. For certain applications, it is desirable to construct codes which are balanced with respect to both rate and decoding delay. To this end, we have constructed high rate and low decoding-delay RODs and CODs from Cayley-Dickson Algebra.
Apart from the rate and decoding delay of orthogonal designs, peak-to-average power ratio (PAPR) of STBC is very important from implementation point of view. The standard constructions of square complex orthogonal designs contain a large number of zeros in the matrix result in gin high PAPR. We have given a construction for square complex orthogonal designs with lesser number of zero entries than the known constructions. When a + 1 is a power of 2, we get codes with no zero entries. Further more, we get complex orthogonal designs with no zero entry for any power of 2 antennas by introducing co- ordinate interleaved variables in the design matrix. These codes have significant advantage over the existing codes in term of PAPR. The only sacrifice that is made in the construction of these codes is that the signaling complexity (of these codes) is marginally greater than the existing codes (with zero entries) for some of the entries in the matrix consist of co-ordinate interleaved variables. Also a class of maximal-rate CODs
(For mathematical equations pl see the pdf file)
41
Lin, Shin Yung, and 林新詠. "A Diagonally Weighted Space-Time Block Code OFDM with Channel Estimation." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/urwybq.
Full textAbstract:
碩士國立交通大學
電信工程系所
94
Space-time block coded orthogonal frequency division multiplexing (STBC OFDM) has become popular recently for its high data rate transmission and diversity gain. In this thesis, we focus on STBCs with four transmit antennas and discuss about whether their transmission matrices are orthogonal and their transmission rate. A novel kind of complex non-orthogonal STBC called Block Diagonal (BD) will be proposed. The semi-blind channel estimation proposed by Giannakis is adopted for the STBC OFDM. To improve the performance of estimator, we use phase direct (PD), which is to solve phase ambiguities after the channel power response is obtained. We get channel power response through matrix and vector computation in STBC OFDM. In complex non-orthogonal STBCs, however, channel power response cannot be obtained when transmission matrix is singular. To solve this problem, we multiply a positive real constant to the diagonal elements of their transmission matrices, not only in non-orthogonal models but also in all STBCs that can be implemented in the semi-blind channel estimation. Finally, in computer simulations, we can see that PD really improves the estimator. The effect of on channel estimate mean square error, noise and bit error rate performance will also be exhibited and discussed.
42
CHANG, CHIA-JUI, and 張家睿. "Semi-blind Equalization for TWIN-QPSK Orthogonal Space Time Block Code." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/03380377386767067358.
Full textAbstract:
碩士中原大學
電子工程研究所
96
To solve multi-path propagation is an important problem in wireless communication. It induces an intersymbol interference(ISI), the channel estimation combined with the equalizer in the receiver is the way to reduce the ISI. In the early time, it needs a training sequence to identify the channel coefficient; the drawback is to decrease the channel bandwidth efficient. Blind equalization method doesn’t need any training sequence instead to know the statistic of transmit signal. Space-time block code is combine time diversity and space diversity technology. It is not only bandwidth efficient but also the outperformance in the decoding. Under the condition of unknown channel, the blind and semi-blind zero-forcing equalizer was proposed by Swindlehurst, to solve the generalized space-time block code. A TWIN-QPSK orthogonal space time block code with four transmit antennas was presented, by Lin-Yi Su[5]. We can solve the TWIN-QPSK orthogonal space time block code, by semi-blind equalization technology. The result known that the performance by TWIN-QPSK space time blocks code has better performance than other space time block code.
43
Chen, Hsuan-Hung, and 陳宣宏. "Study of Space Time Block Code Decoding Algorithms for Wideband Code Division Multiple Access Systems." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/14073585868223808783.
Full textAbstract:
碩士國立中正大學
通訊工程研究所
90
In mobile radio systems, multipath fading causes system performance degradation. In WCDMA system, a new technique, called Space Time block coding based Transmit antenna Diversity (STTD), is provided to overcome multipath fading and improve system performance and capacity. However, space time block decoding algorithms so far are designed for flat fading channels in the literature. In this paper we propose two new schemes, with zero forcing detector and orthogonal detector, for the multipath fading channels. We show that for dual antennas with STTD encoding, either zero forcing detector or orthogonal detector at the mobile gives better performance then single antenna system by computer simulation.
44
Chen, Yue-Lin, and 陳岳麟. "Space-Time Block Code with Interblock Memory for LTE-Advanced Frame Structure." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/56xv4a.
Full textAbstract:
碩士國立臺北科技大學
電機工程系所
105
In the specification of 4th generation wireless system(4G) project Long Term Evolution Advanced(LTE-Advanced), the up-transmit code frames in the base stations (BS) are required to meet the standard of two antennas and three time slots. In this thesis, we proposed a new coding scheme called Space-Time Block Code with Interblock Memory for LTE-Advanced Frame Structure. The proposed scheme is designed by the combination of interblock memory code and multilevel STBC. The simulation result shows that this new scheme can achieve full diversity, full rate transmission and good error performance. Besides, the coding design provides more flexibility and low decoding complexity.
45
Wu, Yu-Wei, and 吳育維. "Low Complexity for Downlink MIMO-SCMA Systems using Space-Time Block Code." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/nhe5gg.
Full textAbstract:
碩士國立中山大學
通訊工程研究所
107
Using Non-Orthogonal Multiple Access (NOMA) such as Sparse Code Multiple Access (SCMA) system will be an important development of the 5th Generation Wireless Communication System (5G). If we can incorporate MIMO and SCMA, we can further boost the spectrum efficiency of mobile systems and achieve better error performance. This thesis proposes a novel MIMO-SCMA downlink system by adopting Orthogonal Space Time Block Code (OSTBC) to transmit codewords over different antennas and time slots. The receiver eliminates part of interference and consequently simplifies the factor graph by leveraging the orthogonal property of OSTBC. The data stream is then decoded using Message Passing Algorithm (MPA) to deal with the residual interference. With the proposed two-stage decoding procedure, we can reduce the computational complexity at the receiver and attain spatial diversity gain. By simulation results, we compare the proposed method with an existing MIMO-SCMA scheme where spatial multiplexing and a MPA decoding with fully-connected factor graph are adopted. It shows that the proposed method can effectively reduce the complexity form exponential growth to linear growth with the antenna numbers at the receiver, which shows. Therefore, the proposed method has better scalability to MIMO systems with increasing number of antennas because of low complexity. Furthermore, the proposed method can also attain lower error rate and better diversity gain at high SNR regime.
46
Chiang, Ping-Yu, and 江秉豫. "Research on 2×2 Time Reversal Space Time Block Code Generalized Frequency Division Multiplexing Systems." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/x98nvd.
Full textAbstract:
碩士國立臺灣科技大學
電機工程系
107
In the 4th Generation of mobile communication system (4G), the communication standard is dominated by orthogonal frequency division multiplexing technology, although it relies on effective frequency selective attenuation channels, strong resistance to inter-code interference, achieve simplicity and many other advantages.However, the disadvantage is the high-frequency external overflow and the peak-to-average power ratio. These shortcomings are inconsistent with the conditions set by the 5th Generation of mobile communication system (5G). With the rise of the Internet of Things, next-generation mobile communication systems will face new challenges, not only to increase throughput, but also to require low latency for the Internet, and to handle robustness in handling large coverage areas. In addition, any waveform of the next generation communication system needs to be compatible with Multi-Input Multi-Ouput (MIMO). Generalized Frequency Division Multiplexing (GFDM) is a candidate that can flexibly respond to the upcoming needs of future networks. It has low-frequency out-of-band and low-to-peak power ratio (PAPR). Features, and can effectively use the TV white space, so that today's scattered frequency bands can be effectively utilized. In this paper, we use a variety of decoding methods for performance analysis in time-reversed space-time block codes (TR-STBC). At the same time, a variety of Transforms are used to discuss the PAPR and Bit error rate (BER) of GFDM and also discuss the complexity of each decoding method. The BER performance simulation will be performed in different filter, channel model, and modulation method environments of the GFDM system to analyze the impact of each method in different situations. Keyword：GFDM、STBC、Linear Transform、Complexity、PAPR、Decoder
47
"Design of low decoding complexity asynchronous space-time block code for cooperative communication." 2014. http://repository.lib.cuhk.edu.hk/en/item/cuhk-1291600.
Full textAbstract:
Liu, Yun.Thesis Ph.D. Chinese University of Hong Kong 2014.
Includes bibliographical references (leaves 139-154).
Abstracts also in Chinese.
Title from PDF title page (viewed on 27, October, 2016).
48
Chen, Yu-Chia, and 陳佑嘉. "Low Complexity Adaptive Semi-blind Space-time Block Code MIMO CDMA Receiver Design." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/dpu66n.
Full textAbstract:
碩士淡江大學
電機工程學系碩士班
103
In this thesis, we consider the space-time block coding (ST-BC) MIMO-CDMA transceiver framework, associated with the hybrid non-zero padding assisted chip-spreading codes in the transmitter. The MIMO-CDMA system considered here is an extension of the works proposed by Chern and Hunag. The phase ambiguity is known to be one of the primary problems in conventional blind receiver design; usually it is ignored by assuming that the initial value of channel estimator is available. Unfortunately, this assumption is not true in practical applications since the true channel state information is not available in the receiver, and the scaling process is impractical. As described earlier, in the works proposed by Chern and Huang, they proposed a new hybrid non-zero-padding chip-spreading code sequences for the corresponding transmit-antennas to resolve the phase ambiguity problem. Also, in the receiver, by removing these coded sequences, the effect of inter-block interference (IBI) could be partially alleviated. Furthermore, the Min/Max criterion based linearly constrained constant modulus (LCCM) algorithm is proposed for optimal two-branch filter- bank design and implemented with the adaptive constrained RLS algorithm with the generalized side-lobe canceller (GSC) framework. It is basically a two-steps optimal receiver design. In the first step, the output power of the filter-bank receiver us minimized, while in the second step, the optimization procedure is performed to find the maximized the eigenvalue of the corresponding output covariance matrix of the filtered output vector, obtained after the first-step, yields the channel vector estimation results. In this thesis, we propose a new approach by using the natural power method instead of the conventional power method associated with the initial channel estimation results obtained by the proposed hybrid non-zero-padding chip-spreading code sequences to perform the semi-blind channel estimation. Associated with the modification of the received signal model to assure the unit norm constraint, to complete the channel estimation and to achieve better bit error rate (BER) performance. The complexity of using the natural power method is O(4n),that is much less compared to the complexity of conventional power method, it required O(n) for estimating the channel vector.
49
Chen, Yu-Ching, and 陳郁青. "Comparison and Performance Analysis of Different Quasi-Orthogonal Space Time Block Code Decoders." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/91516737870554401811.
Full textAbstract:
碩士國立臺灣海洋大學
通訊與導航工程系
98
In the conventional STBC scheme, system cannot achieve full diversity and full rate for more than two transmitting antennas. Quasi-Orthogonal Space-Time Block Code has been proposed to improve the diversity and full rate for the STBC. This paper surveys several QOSTBC decoding methods. Through the theoretic analyses and computer simulations, a simple QOSTBC decode with low computational complexity and satisfactory bit error rate (BER) performance is proposed in this paper.
50
Chiang, Ho-Yo, and 江厚滺. "The Analysis of Space-Time Block Code for Four Transmit Antennas Over Time-Varying Fading Channels." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/51718884118980935553.
Full textAbstract:
碩士中原大學
電機工程研究所
96
In this paper, we propose an implementation of channel-orthogonalized space-time block code(CO-STBC) over time-varying flat-fading channels. When signal modulation is complex constellation, CO-STBC can achieve both the orthogonal property of simple decoding algorithm and the rate one of the maximum data transmission. Its SER performance is better than the others. But the previous STBC decoding algorithms are obtained under the assumption of quasi-static flat-fading channels. The complexity of MLD decoding algorithm is increasing too much to change simple linear one and its SER performance is worse because of not perfect channel estimation, so we propose a simpler and the most closed MLD receiver design method. First we use pilot-symbol-assisted modulation(PSAM) to put pilot symbols periodically for channel estimation in order to decrease the error of the channel gains. Second at the received end, we design the phase estimator generates proper phase value to sustain the orthogonality of the CO-STBC, then we depend the mathematical method to design the interference cancellation(IC) detector to detect the transmitted symbol. Finally we simulate the overall communication system by C++ programming language and MATLAB and will find the design method proposed in this paper is the most closed MLD and the BER is better than the one of the Alamouti code over time-varying flat-fading channels.