Resolver Lo!{ic Operation

DetermininO" the numhe r of responde rs following a search is basically two-ste p op!'r lion ~equenced by the con trol pulse~, 1'.\, and E \' ,,: !) c\' gates Lhe Y vector out to t he A"-A J!J~ inputs to the tree, A,,, ,, al t he root (If Lhe tree th e n co nt a ins the va lue of OHing , '5, y, which is t rn por rily stored in the combinatorial logic and s to re block, Simulla­ rte(,usly, the "0" level at the f input to th root of the I I' rippl s out to lhe FJ",,-level hi" k where Il ls com bined with the An-A i!j~ inpu t: to form the (\I elor. ~) E r, I gates y. f over lhe An-A 191 inpuls to t he tree , Au"l 3t h~ root of the tree t hen con tains the value of ORin" ()' .1), '~, which is st ured and co mbi ned with the valu e of)' as p revi ()usly d escribed, to d et~r min e the n umber IIf ra ' ponders, CONCLU, ION An optim a l fra min" strategy a nd an ass ucia tive p ro ce; or imple m e n­ tation which call eliminate loss of frame synchroni /.aLion d ue to bit errors in t he fra m ing p [te rn and r d uce tim e 10 refra me followi ng loss of bit (;Ounl integril to its [,1inimum lue have been described , T be ted1l1ique elimmate, the ti me , pe nt d w Il ing at fa lsp fram pos it ions by si multa ­ neously searcbing all poss ible bit pos itions for the frame pat Tn, For Tl digi tal termi nals with fram e length s of 19:~ b its, a per iod of 125 !l S, and a I bit frame patt rn, th refram e tim e can b reduced from 49.5 ms to 1.5 ms. T he IllS in information is thus red uced fr m 396 fram es to 12 fram s, p roviding a significa nt imllrove ent in system pe rforman ce, ACKNOWLEDG lVtE 'T red it is due to C. A. Anderson for the d esign of the {·generator tree llsed fo r t.he multiple match resolution logic.