MULTISAMPLING WITH REDUCED BIT SAMPLES

• US 20110037738A1
• Filed: 10/22/2010
• Published: 02/17/2011
• Est. Priority Date: 05/12/2003
• Status: Active Grant

• Current Assignee: Kwang-Bo Cho
• Original Assignee: Kwang-Bo Cho
• Inventors: Cho, Kwang-Bo
• Granted Patent: US 8,200,031 B2
• Time in Patent Office: Days
• US Class Current: 345/204
• CPC Class Codes: H04N 25/00 Circuitry of solid-state image sensors [SSIS]; Control thereof
• CPC Class Codes: H04N 25/60 Noise processing, e.g. detecting, correcting, reducing or removing noise

Abstract

A relatively non-complex signal processor supporting an active pixel sensor imaging system is disclosed. The signal processor only requires the first sample from a group of samples in a multiple sample to be transmitted to the signal processor at full resolution. The subsequent samples in that group can be transmitted using only a subset of least significant bits. The minimum number of required LSBs is based upon the level of noise in the system. In one embodiment, the number of LSBs transmitted is k+2 per sample, where k indicates the number bits corresponding to peak noise. In an alternative embodiment, each subsequent sample is transmitted using only k+1 bits.

Claims

1-10. -10. (canceled)

11. A method for recovering information represented by a plurality of untransmitted most significant bits in a subsequent sample of a group of samples where the first transmitted sample of the group is transmitted with full bit resolution and a noise value in the group of samples is equivalent to a k-bit signal, said method comprising:

if a (k+2)-bit and a (k+1)-bit of the subsequent sample are respectively equal to 0 and 0, and if the (k+2)-bit of a first one of the plurality of samples is equal to 1, setting said untransmitted plurality of most significant bits to be equal to a corresponding set of most significant bits in said first one of the plurality of samples plus one;

otherwise if the (k+2)-bit and (k+1)-bit of the subsequent sample are respectively equal to 1 and 1, and if the (k+2)-bit of the first one of the plurality of samples is equal to 0, setting said untransmitted plurality of most significant bits to be equal the corresponding set of most significant bits in said plurality of samples minus one; and

otherwise setting said untransmitted plurality of most significant bits to be equal to the corresponding set of most significant bits in said first one of the plurality of samples.

12. A method for recovering information represented by a plurality of untransmitted most significant bits in a subsequent sample of a group of samples where the first transmitted sample of the group is transmitted with full bit resolution and a noise value in the group of samples is equivalent to a k-bit signal, said method comprising:

if a (k+1)-bit and a k-bit of the subsequent sample are respectively equal to 0 and 0, and if a (k+1)-bit and k-bit of a first sample are respectively equal to 1,1, setting said untransmitted plurality of most significant bits to be equal to a corresponding set of most significant bits in said first one of the plurality of samples plus 1;

otherwise if the (k+1)-bit and the k-bit of the subsequent sample are respectively equal to 0 and 1, and if the (k+1)-bit, k-bit, and (k−

1)-bit are respectively equal to 1, 1, and 1, setting said untransmitted plurality of most significant bits to be equal to a corresponding set of most significant bits in said first one of the plurality of samples plus 1;

otherwise if the (k+1)-bit and the k-bit of the subsequent sample are respectively equal to 1 and 0, and if the (k+1)-bit, k-bit, and (k−

1)-bit are respectively equal to 0, 0, and 0, setting said untransmitted plurality of most significant bits to be equal to a corresponding set of most significant bits in said first one of the plurality of samples minus 1;

otherwise if the (k+1)-bit and the k-bit of the subsequent sample are respectively equal to 1 and 1, and if the (k+1)-bit, and k-bit are respectively equal to 0 and 0, setting said untransmitted plurality of most significant bits to be equal to a corresponding set of most significant bits in said first one of the plurality of samples minus 1;

otherwise if the (k+1)-bit and the k-bit of the subsequent sample are respectively equal to 1 and 1, and if the (k+1)-bit, k-bit, and (k−

1)-bit are respectively equal to 0, 1, and 0, setting said untransmitted plurality of most significant bits to be equal to a corresponding set of most significant bits in said first one of the plurality of samples minus 1; and

otherwise setting said untransmitted plurality of most significant bits to be equal to the corresponding set of most significant bits in said first one of the plurality of samples.

13. A method for computing the sum of a plurality of sample values, comprising:

calculating a sum of only a same number of least significant bits of each sample value;

calculating a magnitude from a subset of bits of said plurality of sample values;

shifting and zero-filling said magnitude;

combining said sum and said magnitude to produce a least significant bits portion of a result;

shifting and zero-filling a most significant bits portion of a first one of said plurality of samples to produce a most significant bits portion of the result; and

forming said sum of a plurality of sample values using said least significant bits portion of the result with said most significant bits portion of the result.

14. The method of claim 13, wherein said same number is equal to k+2, wherein a peak noise of the signal samples can be characterized by a k-bit signal.

15. The method of claim 14, wherein said same number is equal to 5.

16. The method of claim 13, wherein the number of samples is 4.

17. The method of claim 13, wherein each sample is a 10-bit sample.

18. The method of claim 13, wherein said step of calculating a magnitude comprises:

setting an intermediate result to zero;

for each sample,

if a (k+2)-bit of a first one of said plurality of samples is equal to 0, and if the (k+2)-bit and (k+1) bit are respectively 1 and 1, summing said intermediate result and 1 and storing said sum in said intermediate result; and

setting said magnitude to said intermediate result.

19. The method of claim 13, wherein said magnitude is left shifted and zero filled until said magnitude is 7 bits wide.

20. The method of claim 13, where said step of combining comprises:

if a (k+2)-bit of a first of said plurality of samples is equal to 0, subtracting said sum of said same number of least significant bits from magnitude after said shifting and zero-filling;

or

if the (k+2)-bit of said first of said plurality of samples is equal to 1, summing said sum of said same number of least significant bits with said magnitude after said shifting and zero-filling.

21-42. -42. (canceled)

43. A method for sampling a plurality of values, each having N bits, the values indicating a sensed input, comprising:

sampling all N bits of a first value;

for a subsequent value, sampling M least significant bits where M is less than N; and

combining the N bits of the first value with the M bits of the subsequent value to obtain an average value for the sensed input.

44. A method for processing multiple digital samples of a pixel signal, said method comprising:

receiving all bits of one of said multiple digital samples;

receiving a predetermined number of least significant bits of the remaining ones of said multiple digital samples, said predetermined number being related to the magnitude of signal difference among said multiple digital samples; and

processing said received bits to produce a digital signal representing a combination of said multiple digital samples.

45. A method for recovering information represented by a plurality of untransmitted most significant bits in a subsequent sample of a group of samples where the first transmitted sample of the group is transmitted with full bit resolution and a noise value in the group of samples is equivalent to a k-bit signal, said method comprising:

subtracting from the transmitted portion of a subsequent sample a corresponding portion of the first transmitted sample to arrive at an intermediate result;

recovering the untransmitted portion of the subsequent sample as being equal to the corresponding portion of the first transmitted sample if the intermediate result is less than the maximum value of a k-bit signal and greater than the minimum value of negative one times the maximum value of a k-bit signal;

recovering the untransmitted portion of the subsequent sample as being equal to the corresponding portion of the first transmitted sample minus one if the intermediate result is greater than the maximum value of a k-bit signal; and

recovering the untransmitted portion of the subsequent sample as being equal to the corresponding portion of the first transmitted sample plus one if the intermediate result is less than negative one times the maximum value of a k-bit signal.