Generalized Satellite Beam-Switching Modes

Yiu Kwok THAM

Generalized Satellite Beam-Switching Modes

Yiu Kwok THAM

Full Text Views

0

Cite this

Summary :

Satellite beam-switching problems are studied where there are m up-link beams, n down-link beams and multiple carriers per beam. By augmenting a traffic matrix with an extra row and column, it is possible to find a sequence of switching modes ((0,1)-matrices with genrally multiple unit entries in each row and column) that realize optimal transmission time. Switching modes generated are shown to be linearly independent. The number of switching modes required for an mn matrix is bounded by (m1)(n1)1. For an augmented (m1)(n1) matrix, the bound is then mn1. The bounds on the number of switching modes and the computational complexity for a number of related satellite transmission scheduling problems are lowered. In simplified form, the results (particularly the linear independence of permutation matrices generated) apply to algorithmic decomposition of doubly stochastic matrices into convex combinations of permutation matrices.

Publication: IEICE TRANSACTIONS on Communications Vol.E80-B No.10 pp.1523-1528

Publication Date: 1997/10/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Switching and Communication Processing

Cite this

Copy

Yiu Kwok THAM, "Generalized Satellite Beam-Switching Modes" in IEICE TRANSACTIONS on Communications, vol. E80-B, no. 10, pp. 1523-1528, October 1997, doi: .
Abstract: Satellite beam-switching problems are studied where there are m up-link beams, n down-link beams and multiple carriers per beam. By augmenting a traffic matrix with an extra row and column, it is possible to find a sequence of switching modes ((0,1)-matrices with genrally multiple unit entries in each row and column) that realize optimal transmission time. Switching modes generated are shown to be linearly independent. The number of switching modes required for an mn matrix is bounded by (m1)(n1)1. For an augmented (m1)(n1) matrix, the bound is then mn1. The bounds on the number of switching modes and the computational complexity for a number of related satellite transmission scheduling problems are lowered. In simplified form, the results (particularly the linear independence of permutation matrices generated) apply to algorithmic decomposition of doubly stochastic matrices into convex combinations of permutation matrices.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_10_1523/_p

Copy

@ARTICLE{e80-b_10_1523,
author={Yiu Kwok THAM, },
journal={IEICE TRANSACTIONS on Communications},
title={Generalized Satellite Beam-Switching Modes},
year={1997},
volume={E80-B},
number={10},
pages={1523-1528},
abstract={Satellite beam-switching problems are studied where there are m up-link beams, n down-link beams and multiple carriers per beam. By augmenting a traffic matrix with an extra row and column, it is possible to find a sequence of switching modes ((0,1)-matrices with genrally multiple unit entries in each row and column) that realize optimal transmission time. Switching modes generated are shown to be linearly independent. The number of switching modes required for an mn matrix is bounded by (m1)(n1)1. For an augmented (m1)(n1) matrix, the bound is then mn1. The bounds on the number of switching modes and the computational complexity for a number of related satellite transmission scheduling problems are lowered. In simplified form, the results (particularly the linear independence of permutation matrices generated) apply to algorithmic decomposition of doubly stochastic matrices into convex combinations of permutation matrices.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Generalized Satellite Beam-Switching Modes
T2 - IEICE TRANSACTIONS on Communications
SP - 1523
EP - 1528
AU - Yiu Kwok THAM
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1997
AB - Satellite beam-switching problems are studied where there are m up-link beams, n down-link beams and multiple carriers per beam. By augmenting a traffic matrix with an extra row and column, it is possible to find a sequence of switching modes ((0,1)-matrices with genrally multiple unit entries in each row and column) that realize optimal transmission time. Switching modes generated are shown to be linearly independent. The number of switching modes required for an mn matrix is bounded by (m1)(n1)1. For an augmented (m1)(n1) matrix, the bound is then mn1. The bounds on the number of switching modes and the computational complexity for a number of related satellite transmission scheduling problems are lowered. In simplified form, the results (particularly the linear independence of permutation matrices generated) apply to algorithmic decomposition of doubly stochastic matrices into convex combinations of permutation matrices.
ER -