Automatic digital gain ranging system
AssigneeGrumman Aerospace Corporation
InventorEdmund G. Hanson
Life of this patent
Estimating the term…
Abstract
An automatic digital gain ranging system wherein the zeros are eliminated preceding the most significant nonzero bit and the shortened encoded word that results includes a gain code designation according to the number of zeros eliminated plus a predetermined number of data bits determined in accordance with the position of the most significant nonzero bit.
Claims4
An apparatus for digital code compression whereby certain zero bits of an incoming word having i data bits are eliminated comprising:
- (a) input means for receiving said incoming word;
- (b) most significant bit detector means coupled to said input means for receiving the r-1 most significant incoming data bits and for determining whether the most significant nonzero bit is among said r-1 most significant incoming data bits, and if so, the location of said most significant nonzero bit and producing a one out of r-1 signal;
- (c) gain encoder means coupled to said most significant bit detector means and receiving said one out of r-1 signal for converting it to an n bit digital signal indicative of the number of zero bits included in said r-1 most significant incoming data bits, to be eliminated in said code compression;
- (d) data bit selector means coupled to said input means and said most significant bit detector means and receiving said one out of r-1 signal for selecting m bits from said incoming word, said m bits consisting of said most significant nonzero bit and the m-1 next lesser significant bits when said most significant nonzero bit is one of said r-1 incoming data bits, said m bits consisting of the r.sup.th most significant incoming data bit and the m-1 next lesser significant data bits when said most significant nonzero bit is said r.sup.th or a lesser significant data bit;
- and
- (e) output circuit means coupled to said gain encoder means and said data bit selector means for providing at its output an encoded word including said n bit digital signal and said m data bits;
- said most significant bit detector being a parallel logic circuit constructed to provide M.sub.a -M.sub.r indicators of the nonzero bit location:
- M.sub.a =a
- M.sub.b =a+b
- M.sub.c =a+b+c
- M.sub.r -1=a+b+c-r-1
- M.sub.r =a+b+c-r-1
- wherein a is the most significant bit of said incoming word, b, c-r are successively lesser bits, and r=2.sup.n.
An apparatus for digital code compression whereby certain zero bits of an incoming word having i data bits are eliminated comprising:
- (a) input means for receiving said incoming word;
- (b) most significant bit detector means coupled to said input means for receiving the r-1 most significant incoming data bits and for determining whether the most significant nonzero bit is among said r-1 most significant incoming data bits, and if so, the location of said most significant nonzero bit and producing a one out of r-1 signal;
- (c) gain encoder means coupled to said most significant bit detector means receiving said one out of r-1 signal for converting it to an n bit digital signal indicative of the number of zero bits, included in said r-1 most significant incoming data bits, to be eliminated in said code compression;
- (d) data bit selector means coupled to said input means and said most significant bit detector means and receiving said one out of r-1 signal for selecting m bits from said incoming word, said m bits consisting of the m next lesser significant bits following said most significant nonzero bit when said most significant nonzero bit is one of said r-1 incoming data bits, said m bits consisting of the r.sup.th most significant incoming data bit and the m-1 next lesser significant data bits when said most significant nonzero bit is said r.sup.th or a lesser significant data bit;
- and
- (e) output circuit means coupled to said gain encoder means and said data bit selector means for providing at its output an encoded word including said n bit digital signal and said m data bits;
- said most significant bit detecter being a parallel logic circuit constructed to provide M.sub.a -M.sub.r indicators of the nonzero bit location:
- M.sub.a =a
- M.sub.b =a+b
- M.sub.c =a+b+c
- M.sub.r -1=a+b+c-r-1
- M.sub.r =a+b+c-r-1
- wherein a is the most significant bit of said incoming word, b, c-r are successively lesser bits, and r=2.sup.n.
Dependencies are inferred from the claim text.