Organization of single frequency DRM digital radio broadcasting networks. Features and results of practical tests

Varlamov, O. V.

doi:10.1109/synchroinfo.2018.8456925

Cited by 28 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the early period, research on radio and host programs’ communication paths focused on the operation mode and broadcast content. As an essential link and core issue of operation development, the line planning of broadcasting and hosting programs play a critical role in improving the practical value of broadcasting and hosting programs ( Freeman, Hess & Waller, 2018 ; Varlamov, 2018 ).…”

Section: Introductionmentioning

confidence: 99%

Sustainable development of multi-media communication path of broadcasting and hosting with a dynamic environment

Hu¹

2023

PeerJ Computer Science

View full text Add to dashboard Cite

To enrich people’s lifestyles at home, the research on the transmission path of new media broadcasting and hosting programs has become a hot topic. The traditional statistical regression model has low prediction accuracy and weak generalization ability on such issues. Therefore, we propose an improved comprehensive path planning algorithm based on an ant colony algorithm to search for the optimal path of the multi-media transmission for broadcasting and hosting programs in a dynamic environment. Firstly, we improve the bidirectional search strategy, optimize the probability transition and extend the early search scope. Then, we utilize the allocation strategy of the wolf to change the updating rules of the pheromone. Finally, we take the shortest process time for listeners to obtain the broadcast program as the optimization goal and construct a comprehensive evaluation model. We also solve the optimal parameters to improve the overall performance of our method for finding out the excellent path of multi-media transmission in a dynamic environment. Experiment results show that our method can achieve the optimal route plans and we can demonstrate that the path planned by the improved ant colony algorithm is more reasonable, which can effectively avoid the optimum local problem and shorten the solution.

show abstract

Section: Introductionmentioning

confidence: 99%