Meteorological-satellite service

Meteorological-satellite service (also: meteorological-satellite radiocommunication service) is – according to Article 1.52 of the International Telecommunication Union´s (ITU) Radio Regulations (RR)[1] – defined as « An earth exploration-satellite service for meteorological purposes.»

See also
Weather observation satellite-system, NOAA-M spacecrft

Classification

This radiocommunication service is classified in accordance with ITU Radio Regulations (article 1) as follows:
Fixed service (article 1.20)

Frequency allocation

The allocation of radio frequencies is provided according to Article 5 of the ITU Radio Regulations (edition 2012).[2]

In order to improve harmonisation in spectrum utilisation, the majority of service-allocations stipulated in this document were incorporated in national Tables of Frequency Allocations and Utilisations which is with-in the responsibility of the appropriate national administration. The allocation might be primary, secondary, exclusive, and shared.

  • primary allocation: is indicated by writing in capital letters (see example below)
  • secondary allocation: is indicated by small letters
  • exclusive or shared utilization: is within the responsibility of administrations
Example of frequency allocation
Allocation to services
Region 1Region 2Region 3
401-402 MHz       METEOROLOGICAL AIDS
SPACE OPERATION (space-to-Earth)
EARTH EXPLORATION-SATELLITE (Earth-to-space)
METEOROLOGICAL-SATELLITE (Earth-to-space)
Fixed
Mobile except aeronautical mobile
8 175-8 215 MHz METEOROLOGICAL-SATELLITE (Earth-to-space)
and other services

References / sources
  1. ITU Radio Regulations, Section IV. Radio Stations and Systems – Article 1.52, definition: meteorological-satellite service / meteorological-satellite radiocommunication service
  2. ITU Radio Regulations, CHAPTER II – Frequencies, ARTICLE 5 Frequency allocations, Section IV – Table of Frequency Allocations
  • International Telecommunication Union (ITU)
  • Earth exploration-satellite service. ITU, Genf 2011. ISBN 92-61-13761-X
gollark: My thing works by building a weirdly structured finite-state machine which matches permutations of "regex", then converting it to a different flat one usable by the `greenery` library, then using it to very slowly convert that into a regex.
gollark: I made a regex which matches all anagrams of regex: `e(e(g(rx|xr)|r(gx|xg)|x(gr|rg))|g(e(rx|xr)|r(ex|xe)|x(er|re))|r(e(gx|xg)|g(ex|xe)|x(eg|ge))|x(e(gr|rg)|g(er|re)|r(eg|ge)))|g(e(e(rx|xr)|r(ex|xe)|x(er|re))|r(e(ex|xe)|xe{2})|x(e(er|re)|re{2}))|r(e(e(gx|xg)|g(ex|xe)|x(eg|ge))|g(e(ex|xe)|xe{2})|x(e(eg|ge)|ge{2}))|x(e(e(gr|rg)|g(er|re)|r(eg|ge))|g(e(er|re)|re{2})|r(e(eg|ge)|ge{2}))`.
gollark: Depends on the database you're using and what the driver code does. In general no.
gollark: ... what?
gollark: It's probably fine if it isn't running anything hugely important and provides funlolz™.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.