Development of algorithm for receiving and decoding input signal using MTD decoder for subscriber terminals operating with low-orbit spacecraft
The relevance of the topic is determined by the need to increase the speed of data transmission in satellite telecommunication systems through the use of noise-proof coding. The speed of data transmission in a radio channel is actually determined by the level of interference present due to the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Omsk State Technical University, Federal State Autonoumos Educational Institution of Higher Education
2021-03-01
|
| Series: | Омский научный вестник |
| Subjects: | |
| Online Access: | https://www.omgtu.ru/general_information/media_omgtu/journal_of_omsk_research_journal/files/arhiv/2021/%20%E2%84%96%201%20(175)%20(%D0%9E%D0%9D%D0%92)/59-63%20%D0%A1%D0%B5%D0%B4%D1%83%D0%BD%D0%BE%D0%B2%20%D0%94.%20%D0%9F.,%20%D0%96%D1%83%D0%BD%D1%83%D1%81%D0%BE%D0%B2%D0%B0%20%D0%90.%20%D0%A1..pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The relevance of the topic is determined by the need
to increase the speed of data transmission in satellite
telecommunication systems through the use of noise-proof
coding. The speed of data transmission in a radio channel
is actually determined by the level of interference present
due to the fact that the radio transmission medium is a
public environment and other electronic devices operate
in it. The purpose of the article is to develop an algorithm
for encoding and decoding the input signal using a multithreshold decoder (MTD) of rigid solutions for subscriber
terminals operating with low-orbit spacecraft (NCA),
and its comparison with a conventional PC decoder
«Messi». The comparison allows us to conclude that the
application of the developed algorithm is justified in
systems where more stringent requirements are imposed
on the probability of an error in the communication
channel, while the «Messi» decoder is more appropriate
to use in the presence of restrictions on computational
complexity. |
|---|---|
| ISSN: | 1813-8225 2541-7541 |