Spelling suggestions: "subject:"aeronautics mobile telemetry""
1 |
Performance Comparison of Aeronautical Telemetry in S-Band and C-BandTemple, Kip, Selbrede, Robert 10 1900 (has links)
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, California / This paper compares telemetry link performance of the PCM/FM waveform when simultaneously transmitting in two different frequency bands, S-Band and C-Band. A description of the aircraft and ground station is presented followed by flight test results. These results are presented in the form of received signal strength and accumulated bit errors, versus time and link availability, over the flight paths. Conclusions are drawn based upon the presented flight test results.
|
2 |
Spectrum Sharing: Overview and Challenges of Small Cells Innovation in the Proposed 3.5 GHz BandOyediran, David 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 / Spectrum sharing between Federal and commercial users is a technique proposed by the FCC and NTIA to open up the 3.5 GHz band for wireless broadband use and small cell technology is one of the candidates for its' realization. The traffic on small cells is temporal and their chances of interfering with other services in shared spectrum are limited. DoD has a documented requirement of 865 MHz by 2025 to support telemetry but only 445 MHz is presently available. DoD is conducting researches to realize test and evaluation spectrum efficient technology with the aim to develop, demonstrate, and evaluate technology components required to enable flight and ground test telemetry operations. This paper will provide an overview on spectrum sharing using small cell technology for LTE-Advanced and dynamic spectrum access would be briefly described. Research challenges for protocols and algorithms would be addressed for future studies.
|
3 |
Space-Time Block-Encoded 16-APSK in Aeronautical Mobile TelemetryTwitchell, Autumn 02 August 2022 (has links)
The two-antenna problem in aeronautical mobile telemetry is created by the reception of two copies of the same RF waveform with different phases and time delays. Alamouti and Alamouti-like space time block codes can solve the two-antenna problem, but the decoder/detector needs to account for the different time delays between the signals received from the two transmit antennas. In this thesis, a comparison is made between the performance of Alamouti space-time block codes and time-reversed space-time block codes with 16-APSK to solve the two-antenna problem. The maximum likelihood decoder/detector for Alamouti-encoded 16-APSK is a sequence detector operating on a trellis with a large number of states. A practical state-reduction technique is presented. The results produce a trellis with 256 states and a small loss in bit error rate performance as long as the delay difference is not too big. The decoder/detector for the time-reversed space time block requires only waveform manipulations and channel matched filtering in the case where the two channels are simple delays. For the more general case of multipath propagation between the two transmit antennas and the receiver, the decoder/detector requires an equalizer; simulation results using a channel pair measured at a test range show that the decoder/detector is capable of achieving near AWGN performance with a modest equalizer.
|
4 |
Multipath Mitigation in Frequency Selective Channels with an Emphasis on 5G Cellular Mobile Networks and Aeronautical Mobile Telemetry ApplicationsArabian, Farah 16 March 2022 (has links)
This dissertation explores the role of polarization, combining, and equalization operating over frequency-selective channels to improve the reliability of wireless communications systems in terms of BER for two applications: 5G mobile networks (operating in the mmWave band and NR FR1), and aeronautical mobile telemetry systems (operating in L band). The equivalent discrete-time models for a variety of spatial combining techniques at 5G mmWave bands were derived to investigate the performance of co-located cross-polarized antenna elements when polarization diversity is used and also when a combination of spatial and cross-polarized antennas is exploited. In both cases, ML combining has the lowest BER and EPC produced the worst results. The use of co-located cross-polarized antenna elements also is examined in 5G FR1 assuming post-FFT processing of the two antenna element outputs in a mobile-to-mobile setting. The optimum strategy, in the ML sense, for incorporating the two antenna outputs is developed. The optimum combining strategy together with a FDE is compared to the traditional combining techniques: MRC, EGC, and SC, where the last two also require a FDE. Computer simulations performed over a stochastic channel model with polarization state information show that the difference between ML detection and MRC (the best performing methods) and SC with FDE (the worst performing method) is 2 dB. The similar results were observed with pilot based channel estimators, however the difference in this case was the presence of a BER floor at low values of $N_0$ and caused by channel estimation errors. In aeronautical mobile telemetry applications, the ML combiner is derived and shown to be equivalent to the summing the outputs of two filters matched to the channels in the horizontal and vertical polarization states. For historical reasons, current systems combine right-hand and left-hand circularly polarized antenna feed outputs using a MRC. To compare the two combining approaches, the aeronautical telemetry multipath channel was extended to include polarization state information. The simulation results for SOQPSK-TG with a CMA equalizer show that the post-equalizer BER for the two approaches is the same.
|
5 |
Space-Time Coded ARTM CPM for Aeronautical Mobile TelemetryJosephson, Chad Carl 11 November 2021 (has links)
This dissertation explores the application of Silvester's space-time block code to the multi-index CPM called "ARTM CPM" in the IRIG 106 standard to solve the "two antenna problem"---the use of two transmit antennas to provide full spatial coverage on an airborne test article and the accompanying self interference due to different delays between the two transmit antennas and the ground-based receive antenna. A symbol-level encoding scheme is derived that allows the burst-based space-time block code to operate in a continuously streaming mode. The results show that the space-time block code can solve the two antenna problem with differential delays, but that the differential delays generate a substantial increase in the computational complexity of the detector. Complexity-reducing techniques are applied and analyzed. The results show that the complexity reductions required to produce a practically realizable detector render the bit error probability performance sensitive to the differential delay. Numerical results are presented to quantify the performance loss due to the differential delay. The use of space-time coded ARTM CPM to solve the two-antenna problem in aeronautical mobile telemetry requires estimates of the parameters that define the propagation environment. The maximum likelihood estimator problem is defined and used to motivate reduced-complexity estimators suitable for use in a real system. A modified gradient descent algorithm performs the search required to find the delay parameters. An "inner" phase lock loop operating with an "outer" frequency lock loop computes decision-directed estimates of the frequency offset. Computer simulations were used to assess the impact on bit error rate performance introduced by the estimators. The simulation results show the combined joint estimator for the delays, channel gains, and frequency offset imposes a 1.15 dB loss in performance. This loss is approximately the same as the 1.1 dB loss due to the complexity-reducing techniques used by the decoder/detector.
|
6 |
Securing Wireless Communication via Information-Theoretic Approaches: Innovative Schemes and Code Design TechniquesShoushtari, Morteza 21 June 2023 (has links) (PDF)
Historically, wireless communication security solutions have heavily relied on computational methods, such as cryptographic algorithms implemented in the upper layers of the network stack. Although these methods have been effective, they may not always be sufficient to address all security threats. An alternative approach for achieving secure communication is the physical layer security approach, which utilizes the physical properties of the communication channel through appropriate coding and signal processing. The goal of this Ph.D. dissertation is to leverage the foundations of information-theoretic security to develop innovative and secure schemes, as well as code design techniques, that can enhance security and reliability in wireless communication networks. This dissertation includes three main phases of investigation. The first investigation analyzes the finite blocklength coding problem for the wiretap channel model which is equipped with the cache. The objective was to develop and analyze a new wiretap coding scheme that can be used for secure communication of sensitive data. Secondly, an investigation was conducted into information-theoretic security solutions for aeronautical mobile telemetry (AMT) systems. This included developing a secure coding technique for the integrated Network Enhanced Telemetry (iNET) communications system, as well as examining the potential of post-quantum cryptography approaches as future secrecy solutions for AMT systems. The investigation focused on exploring code-based techniques and evaluating their feasibility for implementation. Finally, the properties of nested linear codes in the wiretap channel model have been explored. Investigation in this phase began by exploring the duality relationship between equivocation matrices of nested linear codes and their corresponding dual codes. Then a new coding algorithm to construct the optimum nested linear secrecy codes has been invented. This coding algorithm leverages the aforementioned duality relationship by starting with the worst nested linear secrecy codes from the dual space. This approach enables us to derive the optimal nested linear secrecy code more efficiently and effectively than through a brute-force search for the best nested linear secrecy codes directly.
|
Page generated in 0.1139 seconds