0 - FTP Directory Listing - Nato
0 - FTP Directory Listing - Nato
0 - FTP Directory Listing - Nato
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
6 SYSIXM SYNCHRONIZATION ALGORITHM<br />
In a mticd en- it is parunount thrt the ovdl<br />
synchroniutiaa time be kept to a minimum while<br />
simultaneously providing capacity to synchronize many<br />
users U axe Thb god CUI be rcannplis! hough a<br />
combination of judicious kip d the initid pumtu<br />
cstimatim caprbilitiw of the GT, selectiun of a robust<br />
synchronizaticm dgcnilhm and optimization of the<br />
puunetcrs of the synchmiutim algorithm Irrtrtirlg<br />
synchrcmiuticm limc Tk availability at be ground<br />
[ermind y~urue TOD urnition. an accunte<br />
ephemeris algorithm will PI& duce the spatialtemporal<br />
surch region, alloAg rapid acquisition<br />
Howeva the algorithm must be robiust in h scnu hat if<br />
ao~unte initial estimates arc available. the GT will still<br />
acquire the paylod In addition to minimizing he<br />
acquisition time, thc algorithm mut also simrlltmeously<br />
minimi7~ the probability of false synchroni7~tion<br />
Cansidering the DL md UL acquisition proce*ua<br />
separately. the overall probability of correct<br />
synchroniution and false synchroni7+tion ue given by<br />
in which PdJlL), PD(UL). PpA(DL), md PpA(UL) uc the<br />
probabilities of dcteaion and fa1.w alarm for he DL hnd<br />
tJL synchrdzation pmcessu. Figure 4 illusmuid a<br />
simplified stlie diagrun of the overall synchronization<br />
process. The design of the synchronization algorithm<br />
involves choosing the vdues of POL). P W), P,(DL),<br />
and PpA(UL) so w to minimize thc acquisition lime unda<br />
the desired tactical operating Ctditim.<br />
For the ovdl probability of dctection defined in quation<br />
(5). thc dcla~tion rtquirem~ CM be equally putitioncd<br />
to the UL and the 3L U a starting point in the design.<br />
Howeva, it may be dwirable to have a higher P, on be<br />
DL urd 1 Iowa Po the UL ~ d certain a operating<br />
conditions. A DL receive only mode of operation is an<br />
example of such a rrccnuio. T!w DL detectiori procew<br />
ilself is canyosed of the comae and fine spatid and lime<br />
rcquisithn ;*recesses described in sections 4 md 5 above.<br />
Thus P nL) un be pprtitimed into a function of the<br />
values of PD and P, fa thc individual conrsc and fine<br />
In aqkdon (6). the fvat tam cm be neglected. since it is<br />
extranely unlikely lhlt che m wil nrccusfully acquire if<br />
17-7<br />
the DL is not proply synchronized The daminant tam<br />
in the ovadl process is the d term, which is Ihe<br />
probability of frlse syldumizrtion of UL timing given the<br />
DL is correaly quid. 'Ibe third tam is d l in<br />
comph to Ihc Mcond tam if P,(DL) lnd P,(UL) ut<br />
nrsonably c& It should be noted th.1 cyen hough the<br />
rust term U negligible. a large vdue of PJDL) will<br />
significuuly impact llrc acquisition time, since Lhe DL<br />
acquisition p a s will bc dcpcndcnt on h e UL v s<br />
to detect false alums. which is obviously a poor design.<br />
In orda to be robust in the presave of junming, he<br />
CO= and fure sync dctcction processing will require a<br />
verification stage. The verification stage in genad will be<br />
an m choare n type of decision. in which m of n expected<br />
sync hops will have to be dctcclcd in ader for thc given<br />
stage of the dctection poce~s to be declued vdid It<br />
should be noted hac a high P, md low P, for the system<br />
docs no( neceasuily imply a requiremall for high a Po md<br />
low P, on individual colvsc or fine DL sync hops. For<br />
example. if he system requirts npid acquisition. Lhen the<br />
vrlw of P, ud P, for Ihe individual sync hops must be<br />
close IO the Po d the wcrlll system, to ennve thu lhere<br />
lre few Nse &teaionS. otherwise the synchroniution<br />
process will expaEd limc vaifying false dctcctioru This<br />
would require m md n chosen to be luge. Such an<br />
implementation would limit Iht number of sync hops that<br />
the system could support relative to its d.l. capacity. or<br />
limit the numk of theatres that the payload could provide<br />
synchronization hops to. On thc otha hand thc ovadl P,<br />
and P, could be met by Iowa values of m id n, which<br />
would result in morc false alrrnu and verification steps.<br />
md potcntially a Imger acquisition time. The design<br />
choscn will depend not d y on the capacity of the datalink<br />
structure to support the algaihn. but the siFe of the<br />
terminals. Acquisition by larger taminals in clear sky<br />
conditions can be s*ipported by M algorithm with low m<br />
of n, however maller taminrls will requirk longer<br />
acquisition times, pdcululy in a TACSAT enviraunent<br />
in which thc DL SNR is limited.<br />
7 CONCLUSION<br />
This paper has exarnined the systan design coruidtrations<br />
for synchroniution of an EHP MDR sysm employing a