Minimizing transmission time of almanac for GLONASS users in the next generation navigation messages

М.М. Valikhanov; U.B. Voloshko; А.S. Pustoshilov; S.P. Tsarev

doi:10.18127/j20700784–201812–05

Minimizing transmission time of almanac for GLONASS users in the next generation navigation messages

М.М. Valikhanov¹, U.B. Voloshko², А.S. Pustoshilov³, S.P. Tsarev⁴

research article UDC 519.87; 527.62; 621.37 Pages: 25-29 doi.org/10.18127/j20700784–201812–05

¹ Ph.D. (Eng.), Associate Professor, Siberian Federal University (Krasnoyarsk)
² Leading Engineer, JSC Academician M.F. Reshetnev Information Satellite Systems (Zheleznogorsk)
³ Post-graduate Student, Siberian Federal University (Krasnoyarsk)
⁴ Dr.Sc. (Phys.-Math.), Professor, Siberian Federal University (Krasnoyarsk)

Keywords: optimization GLONASS pseudoframe navigation message

Abstract

We propose an algorithm for minimization of transmission time of almanac for GLONASS satellites for all users globally, which allows collection of the complete almanac in 12 seconds for navigation messages with CDMA. We give a simplified algorithm for composition of transmission tables which are close to the optimal ones but does not require recalculation of the table for a long period.

How to cite

Валиханов М.М., Волошко Ю.Б., Пустошилов А.С., Царев С.П. Минимизация времени сбора альманаха ГЛОНАСС потребителями при строковой передаче цифровой информации // Успехи современной радиоэлектроники. 2018. № 12. С. 25–29. DOI: https://doi.org/10.18127/j20700784–201812–05

References

INTERFACE CONTROL DOCUMENT General Description of Code Division Multiple Access Signal System, Edition 1.0. Moscow. 2016. URL: http://russianspacesystems.ru/wp-content/uploads/2016/08/IKD-L1-s-kod.-razd.-Red-1.0-2016.pdf
Information and Analysis Center GLONASS. URL: https://www.glonass-iac.ru/
Schrijver A. Theory of Linear and Integer Programming. John Wiley & Sons. 1998.
Bellman R. Dynamic Programming. Princeton Univ. Press. 1957.
Conway R.W., Maxwell W.L., Miller L.W. Theory of scheduling. Courier Corporation. 2003.
Onn S. Nonlinear discrete optimization. EMS. 2010.
De Loera J.A., Hemmeke R., Koeppe M. Algebraic and geometric ideas in the theory of discrete optimization. SIAM. 2013.
Vielma J.P. Mixed integer linear programming formulation techniques. Siam Review. 2015. V. 57. № 1. P. 3–57.
CBC (Coin-or branch and cut) – an open-source mixed integer programming solver. URL: https://projects.coin-or.org/Cbc
GLPK (GNU Linear Programming Kit) solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. URL: http://www.gnu.org/software/glpk/

[1] INTERFACE CONTROL DOCUMENT General Description of Code Division Multiple Access Signal System, Edition 1.0. Moscow. 2016. URL: http://russianspacesystems.ru/wp-content/uploads/2016/08/IKD-L1-s-kod.-razd.-Red-1.0-2016.pdf

[2] Information and Analysis Center GLONASS. URL: https://www.glonass-iac.ru/

[3] Schrijver A. Theory of Linear and Integer Programming. John Wiley & Sons. 1998.

[4] Bellman R. Dynamic Programming. Princeton Univ. Press. 1957.

[5] Conway R.W., Maxwell W.L., Miller L.W. Theory of scheduling. Courier Corporation. 2003.

[6] Onn S. Nonlinear discrete optimization. EMS. 2010.

[7] De Loera J.A., Hemmeke R., Koeppe M. Algebraic and geometric ideas in the theory of discrete optimization. SIAM. 2013.

[8] Vielma J.P. Mixed integer linear programming formulation techniques. Siam Review. 2015. V. 57. № 1. P. 3–57.

[9] CBC (Coin-or branch and cut) – an open-source mixed integer programming solver. URL: https://projects.coin-or.org/Cbc

[10] GLPK (GNU Linear Programming Kit) solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. URL: http://www.gnu.org/software/glpk/

Abstract

How to cite

Related articles