Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 3
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

In this paper, we estimate the upper limit of the transmission data rate in airborne ultrasonic communications, under condition of the optimal power allocation. The presented method is based on frequency response of a channel in case of single-path LOS propagation under different climatic conditions and AWGN background noise model, and it can be easily extended to the case of frequency-dependent noise. The obtained results go beyond the discrete distances for which experimental SNR values were available, and are more accurate than the previous calculations in the literature, due to the inclusion of the channel frequency response and its changes over the distance. The impact of air temperature, relative humidity and the atmospheric pressure on the channel capacity is also investigated. The presented results can serve as a reference during the design of airborne ultrasonic communication systems operating in the far-field region.

Go to article

Authors and Affiliations

Gustaw Mazurek
Download PDF Download RIS Download Bibtex

Abstract

The paper analyzes the prospects for the formation and implementation of digital data transmission technologies on railways of Kazakhstan, taking into account the potential for the development of high-speed railway transport (HSRWT), as well as new approaches for solving the development problems of advanced automated dispatch control systems (ADCS). It was shown that the solution of these problems is possible by automatization of the train traffic coordination based on the use of the potential of the GPRS data transmission technology. The work further developed models and algorithms used in ADCS of the railway transport. There has been carried out the formalization of the tasks of navigation data transmission for ADCS and for the subsystems of the railway rolling stock movement coordination, including HSRWT using GPRS data transmission technology. Also, the article describes a modernized algorithm for simulation of the GPRS channels operation in ADCS. The proposed algorithm differs from the existing ones by the ability to make predictive estimates for determination of the railway rolling stock location. Also, the developed algorithm provides opportunities for coordination of the trains movement, taking into account the optimization of the GPRS resources use.

Go to article

Authors and Affiliations

Bakhytzhan Akhmetov
Valeriy Lakhno
Gulzada Yerkeldessova
Taizhan Sarzhanov
Dmitriy Issaikin
Download PDF Download RIS Download Bibtex

Abstract

This paper presents the design of a compact protocol for fixed-latency, high-speed, reliable, serial transmission between simple field-programmable gate arrays (FPGA) devices. Implementation of the project aims to delineate word boundaries, provide randomness to the electromagnetic interference (EMI) generated by the electrical transitions, allow for clock recovery and maintain direct current (DC) balance. An orthogonal concatenated coding scheme is used for correcting transmission errors using modified Bose–Chaudhuri–Hocquenghem (BCH) code capable of correcting all single bit errors and most of the double-adjacent errors. As a result all burst errors of a length up to 31 bits, and some of the longer group errors, are corrected within 256 bits long packet. The efficiency of the proposed solution equals 46.48%, as 119 out of 256 bits are fully available to the user. The design has been implemented and tested on Xilinx Kintex UltraScale+ KCU116 Evaluation Kit with a data rate of 28.2 Gbps. Sample latency analysis has also been performed so that user could easily carry out calculations for different transmission speed. The main advancement of the work is the use of modified BCH(15, 11) code that leads to high error correction capabilities for burst errors and user friendly packet length.

Go to article

Authors and Affiliations

Michał Kruszewski
Wojciech Marek Zabołotny

This page uses 'cookies'. Learn more