Spelling suggestions: "subject:"space / time"" "subject:"apace / time""
41 |
Space Time Coding For Wireless CommunicationAcharya, Om Nath, Upadhyaya, Sabin January 2012 (has links)
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.
|
42 |
Design and performance analysis of distributed space time coding schemes for cooperative wireless networksOwojaiye, Gbenga Adetokunbo January 2012 (has links)
In this thesis, space-time block codes originally developed for multiple antenna systems are extended to cooperative multi-hop networks. The designs are applicable to any wireless network setting especially cellular, adhoc and sensor networks where space limitations preclude the use of multiple antennas. The thesis first investigates the design of distributed orthogonal and quasi-orthogonal space time block codes in cooperative networks with single and multiple antennas at the destination. Numerical and simulation results show that by employing multiple receive antennas the diversity performance of the network is further improved at the expense of slight modification of the detection scheme. The thesis then focuses on designing distributed space time block codes for cooperative networks in which the source node participates in cooperation. Based on this, a source-assisting strategy is proposed for distributed orthogonal and quasi-orthogonal space time block codes. Numerical and simulation results show that the source-assisting strategy exhibits improved diversity performance compared to the conventional distributed orthogonal and quasi-orthogonal designs.Motivated by the problem of channel state information acquisition in practical wireless network environments, the design of differential distributed space time block codes is investigated. Specifically, a co-efficient vector-based differential encoding and decoding scheme is proposed for cooperative networks. The thesis then explores the concatenation of differential strategies with several distributed space time block coding schemes namely; the Alamouti code, square-real orthogonal codes, complex-orthogonal codes, and quasiorthogonal codes, using cooperative networks with different number of relay nodes. In order to cater for high data rate transmission in non-coherent cooperative networks, differential distributed quasi-orthogonal space-time block codes which are capable of achieving full code-rate and full diversity are proposed. Simulation results demonstrate that the differential distributed quasi-orthogonal space-time block codes outperform existing distributed space time block coding schemes in terms of code rate and bit-error-rate performance. A multidifferential distributed quasi-orthogonal space-time block coding scheme is also proposed to exploit the additional diversity path provided by the source-destination link.A major challenge is how to construct full rate codes for non-coherent cooperative broadband networks with more than two relay nodes while exploiting the achievable spatial and frequency diversity. In this thesis, full rate quasi-orthogonal codes are designed for noncoherent cooperative broadband networks where channel state information is unavailable. From this, a generalized differential distributed quasi-orthogonal space-frequency coding scheme is proposed for cooperative broadband networks. The proposed scheme is able to achieve full rate and full spatial and frequency diversity in cooperative networks with any number of relays. Through pairwise error probability analysis we show that the diversity gain of the proposed scheme can be improved by appropriate code construction and sub-carrier allocation. Based on this, sufficient conditions are derived for the proposed code structure at the source node and relay nodes to achieve full spatial and frequency diversity. In order to exploit the additional diversity paths provided by the source-destination link, a novel multidifferential distributed quasi-orthogonal space-frequency coding scheme is proposed. The overall objective of the new scheme is to improve the quality of the detected signal at the destination with negligible increase in the computational complexity of the detector.Finally, a differential distributed quasi-orthogonal space-time-frequency coding scheme is proposed to cater for high data rate transmission and improve the performance of noncoherent cooperative broadband networks operating in highly mobile environments. The approach is to integrate the concept of distributed space-time-frequency coding with differential modulation, and employ rotated constellation quasi-orthogonal codes. From this, we design a scheme which is able to address the problem of performance degradation in highly selective fading environments while guaranteeing non-coherent signal recovery and full code rate in cooperative broadband networks. The coding scheme employed in this thesis relaxes the assumption of constant channel variation in the temporal and frequency dimensions over long symbol periods, thus performance degradation is reduced in frequencyselective and time-selective fading environments. Simulation results illustrate the performance of the proposed differential distributed quasi-orthogonal space-time-frequency coding scheme under different channel conditions.
|
43 |
Performance Analysis Of Space-Time Coded Multiuser DetectorsSharma, G V V 01 1900 (has links) (PDF)
No description available.
|
44 |
A METHOD FOR FINDING BETTER SPACE-TIME CODES FOR MIMO CHANNELSPanagos, Adam G., Kosbar, Kurt 10 1900 (has links)
ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada / Multiple-input multiple output (MIMO) communication systems can have dramatically higher
throughput than single-input, single-output systems. Unfortunately, it can be difficult to find the
space-time codes these systems need to achieve their potential. Previously published results
located good codes by minimizing the maximum correlation between transmitted signals. This
paper shows how this min-max method may produce sub-optimal codes. A new method which
sorts codes based on the union bound of pairwise error probabilities is presented. This new
technique can identify superior MIMO codes, providing higher system throughput without
increasing the transmitted power or bandwidth requirements.
|
45 |
SPACE-TIME CODED SOQPSK IN THE PRESENCE OF DIFFERENTIAL DELAYSNelson, Tom 10 1900 (has links)
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / This paper presents a method of detecting the Tier I modulation SOQPSK when it is used in a space-time coded (STC) system in which there is a non-negligible differential delay between the received signals. Space-time codes are useful to eliminate data dropouts which occur on aeronautical telemetry channels in which transmit diversity is employed. The proposed detection algorithm employs a trellis to detect the data while accounting for the offset between the in-phase and quadrature-phase components of the signals as well as the differential delay. The performance of the system is simulated and presented and it is shown that the STC eliminates the BER floor which results from the data dropouts.
|
46 |
Space-Time Coding for Avionic Telemetry ChannelsWang, Jibing, Yao, Kung, Whiteman, Don 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Multiple antennas promise high data capacity for wireless communications. Most space-time coding schemes in literature focus on the rich scatter environment. In this paper, we argue that minimax criterion is a good design criterion for space-time codes over the avionic telemetry channels. This design criterion is different than those of space-time codes over rich scattering Rayleigh fading channels. Theoretical and numerical results show that the codes with optimal performance in Rayleigh fading channels do not necessarily have optimal performance in avionic telemetry channels. Therefore, the space-time codes should be carefully designed/selected when used in the avionic telemetry channels.
|
47 |
ALAMOUTI SPACE-TIME CODING FOR QPSK WITH DELAY DIFFERENTIALNelson, Tom 10 1900 (has links)
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Space-time coding (STC) for QPSK where the transmitted signals are received with the same delay is well known. This paper examines the case where the transmitted signals are received with a nonnegligible delay differential when the Alamouti 2x1 STC is used. Such a differential can be caused by a large spacing of the transmit antennas. In this paper, an expression for the received signal with a delay differential is derived and a decoding algorithm for that signal is developed. In addition, the performance of this new algorithm is compared to the standard Alamouti decoding algorithm for various delay differentials.
|
48 |
Can Space Time Encoding and Adaptive Equalization Benefit Rotary-Wing Missions at the Yuma Proving Ground?Diehl, Michael, Swain, Jason, Wilcox, Tab 10 1900 (has links)
ITC/USA 2015 Conference Proceedings / The Fifty-First Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2015 / Bally's Hotel & Convention Center, Las Vegas, NV / The US Army Yuma Proving Ground (YPG) utilizes telemetry in several critical ways. Data, video, and voice from test aircraft provides YPG the information necessary to effectively execute missions. This information must be displayed real-time for efficient use of available flight time, making a robust telemetry link vital. In seeking an increased telemetry downlink capability, YPG considered three new technologies: Space Time Coding (STC), Adaptive Equalization (EQ), and Low Density Parity Check (LDPC). These technologies have shown reduced multipath and increased datalink reliability on fixed-wing aircraft; however, YPG's concern was the technology's benefits on rotary wing aircraft tested here. To assess potential benefits of these technologies, YPG conducted flight tests using representative flight profiles and vendor-supplied equipment to collect quantitative and qualitative data.
|
49 |
Bistatic space-time adaptive processing for ground moving target indicationLim, Chin-Heng January 2006 (has links)
Space-time adaptive processing (STAP) for bistatic airborne radar offers several advantages, such as the higher possibility of detecting stealth targets. However, in a bistatic environment, the usual impediment and possible clutter in-homogeneity is further complicated by the rangedependent nature of the clutter ridge in the angle-Doppler plane induced by the physical geometry of the two aircrafts. This complicates the clutter suppression problem and leads to signi cant degradation in performance. The major objective of this thesis is to develop training methods for bistatic radar operation in a dense environment of ground-moving targets. The work is directed towards what may be called `small STAP', where the number of spatial channels is small and the array is non-uniform. The work is motivated by a desire to minimise the amount of navigational data associated with both the transmitter and receiver. Furthermore, it is directed towards environments where all range gates may contain targets. This thesis presents several novel STAP approaches, which can be classi ed into two main categories, to address the range dependency problem within a bistatic airborne radar framework. The rst category is on training strategies for joint-domain localised (JDL)-STAP in a bistatic environment. The JDL algorithm is originally proposed to reduce the computational complexity for monostatic radar by using a two-dimensional discrete Fourier transformation to transform the data from the space-time domain into the angle-Doppler domain. However, it has restrictions that essentially assume the receiving antenna to be an equi-spaced linear array of ideal, isotropic, point sensors. Two novel algorithms are proposed to overcome these two restrictions and they incorporate angle and Doppler compensation into the JDL processor to mitigate the bistatic clutter Doppler range dependency problem. In addition, a novel JDL in-the-gate processing approach is proposed, which forgoes the training data requirement and operates solely on the test data set. This single data set detection approach alleviates the high target density or heterogeneity problems associated with the training data requirement of conventional STAP algorithms. It is particularly applicable to heterogeneous environments where the clutter homogeneity assumption does not hold or independent training data is not readily available. The second category is on bistatic STAP training without navigation data. A novel technique is proposed to predict the range-dependent inverse covariance matrix, which is used to compute the STAP lter weights, by utilising linear prediction theory. The proposed technique provides mitigation against additional clutter notches resulting from range and Doppler ambiguities. It also allows for detection in other range gates under test without having to re-compute the prediction weights. Another novel technique is proposed to obtain an estimate of the rangedependent inverse covariance matrix by using an eigen-analysis based method. This technique involves applying eigen-decomposition to the covariance matrix in each range gate, sorting the eigenvalues by using maximum inner-product of the eigenvectors of the training range gate with respect to the test range gate and then averaging the resulting sorted eigenvalues. Both of the proposed techniques eliminate the requirement for a uniform linear array and can be applied to arrays of arbitrary con guration. No navigational data or parameter estimation is necessary as only the clutter data is required, thus reducing real-time computational costs.
|
50 |
The study on the space time block coding and its application in wireless communications. / CUHK electronic theses & dissertations collectionJanuary 2004 (has links)
Du Yinggang. / "September 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 113-119). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.
|
Page generated in 0.1299 seconds