Patent US5802600A successfully refreshed from Google Patents.
Patent US5617506A successfully refreshed from Google Patents.
US5617506A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for communicating a value over a transmission medium and for decoding same
Assignee: Samsung Electronics Co Ltd
•
Filing: 1994-06-29
•
Granted: 1997-04-01
•
Expires: 2014-06-29
Abstract
Abstract A method and apparatus for a 2:1 compression of a digital audio signal including 1) a compression operation for compressing a sixteen bit sample of the audio signal as both an exact value and a delta value, and 2) a regeneration operation for regenerating the compressed exact and delta values once again into a sixteen bit word. The regenerated exact and delta values are then compared against the original sample. Whichever regenerated value most closely matches the original sample has its corresponding compressed value encoded onto a storage medium.
Inventors
- 👤 Phil L. Burk
- 👤 Robert J. Mical
- 👤 Steven E. Hayes
- 👤 David C. Platt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 00:16
CPC Classifications
H; H04; H04B; H04B14/00; H04B14/02; H04B14/04; H04B14/046; H04B14/048; G; G11; G11B; G11B20/00; G11B20/00007
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
278 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein the function e 1 ( ) is defined by e 1 (s)=sign(s)*|s| 1/n , rounded to the nearest discrete value in said first transmission value space, and the function d 1 ( ) is defined by d 1 (s)=sign(s)*|s| 1/n , rounded to the nearest discrete value in said second transmission value space, n being an integer greater than 1.
Claim 2
Independent Claim
278 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein the function e 1 ( ) is defined by e 1 (s)=sign(s)*|s| 1/n , rounded to the nearest discrete value in said first transmission value space, and the function d 1 ( ) is defined by d 1 (s)=sign(s)*|s| 1/n , rounded to the nearest discrete value in said second transmission value space, n being an integer greater than 1.
Claim 3
Independent Claim
271 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to at first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein the function e 1 ( ) is defined by e 1 (s)=sign(s)*|s| 1/2 , rounded to the nearest discrete value in said first transmission value space, and the function d 1 ( ) is defined by d 1 (s)=sign(s)*|s| 1/2 , rounded to the nearest discrete value in said second transmission value space.
Claim 4
Independent Claim
271 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to at first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein the function e 1 ( ) is defined by e 1 (s)=sign(s)*|s| 1/2 , rounded to the nearest discrete value in said first transmission value space, and the function d 1 ( ) is defined by d 1 (s)=sign(s)*|s| 1/2 , rounded to the nearest discrete value in said second transmission value space.
Claim 5
Independent Claim
252 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein said selection decision selects the value f i (s i ) as whichever of the candidate values in said group of candidate values minimizes |s i -f i -1 (f i (s i ))|.
Claim 6
Independent Claim
252 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein said selection decision selects the value f i (s i ) as whichever of the candidate values in said group of candidate values minimizes |s i -f i -1 (f i (s i ))|.
Claim 7
Independent Claim
308 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein said first transmission value space is the space of all 8-bit values having a low order bit of 0, wherein said second transmission value space is the space of all 8-bit values having a low order bit of 1, and wherein said indication of whether y i : (a) is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )), comprises the low order bit of y i .
Claim 8
Independent Claim
308 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein said first transmission value space is the space of all 8-bit values having a low order bit of 0, wherein said second transmission value space is the space of all 8-bit values having a low order bit of 1, and wherein said indication of whether y i : (a) is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )), comprises the low order bit of y i .
Claim 9
Independent Claim
324 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein said group of candidate values further includes values e 2 (s i ) and d 2 (s i -f -1 i-1 (f i-1 (s i-1 ))), where, for a predefined function g( ): the value e 1 (s)=g(s) rounded to the next lower discrete value in said first transmission value space; the value e 2 (s)=g(s) rounded to the next higher discrete value in said first transmission value space; the value d 1 (s)]=g(s) rounded to the next lower discrete value in said second transmission value space; and the value d 2 (s)]=g(s) rounded to the next higher discrete value in said second transmission value space.
Claim 10
Independent Claim
324 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , all of said starting values s i being in a starting value space, comprising the steps of, for each of at least two i'th starting values s i : calculating a transmission value y i given by y i =f i (s i ), where the value f i (s i ) is selected depending on a selection decision from a predefined group of candidate values including e 1 (s i ) and d 1 (s i -f -1 i-1 (f i-1 (s i-1 ))), where the function e 1 ( ) is a predefined mapping from said starting value space to a first transmission value space, and where the function d 1 ( ) is a predefined mapping from said starting value space to a second transmission value space said first and second transmission value spaces containing discrete values; and transmitting over said transmission medium said transmission value y i in conjunction with an indication of whether y i : (a) is a function of s i and not of f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )); wherein said group of candidate values further includes values e 2 (s i ) and d 2 (s i -f -1 i-1 (f i-1 (s i-1 ))), where, for a predefined function g( ): the value e 1 (s)=g(s) rounded to the next lower discrete value in said first transmission value space; the value e 2 (s)=g(s) rounded to the next higher discrete value in said first transmission value space; the value d 1 (s)]=g(s) rounded to the next lower discrete value in said second transmission value space; and the value d 2 (s)]=g(s) rounded to the next higher discrete value in said second transmission value space.
Claim 11
Dependent Claim
17 words
A method according to claim 5, wherein g(s)=sign(s)*|s| 1/n , n being an integer greater than 1.
Claim 12
Dependent Claim
10 words
A method according to claim 5, wherein g(s)=sign(s)*|s| 1/2 .
Claim 13
Dependent Claim
33 words
A method according to claim 5, wherein said selection decision selects the value f i (s) as whichever of said candidate values minimizes |s i -f i -1 (f i (s i ))|.
Claim 14
Dependent Claim
63 words
A method according to claim 5, wherein said selection decision selects the value f i (s) by determining the one of said candidate values f i (s) and the one of said candidate values f i+1 (s) which together minimize [s i -f i -1 (f i (s i ))] 2 +[s i+1 -f i+1 -1 (f i+1 (s i+1 ))] 2 .
Claim 15
Independent Claim
60 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , comprising the steps of: calculating a value y i =sign(s i )*|s i | 1/n for each i, n being an integer greater than 1; and transmitting over said transmission medium values responsive to said y i .
Claim 16
Independent Claim
60 words
A method for communicating a plurality of starting values s i over a transmission medium, i=0, 1, 2, . . . , comprising the steps of: calculating a value y i =sign(s i )*|s i | 1/n for each i, n being an integer greater than 1; and transmitting over said transmission medium values responsive to said y i .
Claim 17
Dependent Claim
119 words
A method according to claim 10, for use with a plurality of input values x i each corresponding to a respective one of said starting values s i , wherein said step of transmitting comprises the step of transmitting over said transmission medium a respective value responsive to each of said y i , further comprising the step of performing one of the following steps selectively for each s i : (a) setting s i equal to the corresponding x i ; and (b) setting s i equal to the difference between x i and an inverse function of the value transmitted over said transmission medium in response to y i-1 , selectably in dependence on a selection decision.
Claim 18
Dependent Claim
66 words
A method according to claim 10, further comprising a step of mapping each of said y i to an element in a transmission value space selected from a plurality of predefined transmission value spaces, wherein said step of transmitting comprises a step of transmitting over said transmission medium both the mapped y i and an indication of the transmission value space selected for y i .
Claim 19
Independent Claim
183 words
A method for decoding a plurality of transmission values y i received over a transmission medium, i=0, 1, 2, . . . , comprising the steps of: receiving each of said transmission values y i in conjunction with an indication of whether y i : (a) is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )), where each of the s i are starting values to be reconstructed; and calculating a reconstructed value s' i for each y i as s' i =g -1 (y i ) if y i is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), and calculating a reconstructed value s' i for each y i as s' i =s' i-1 +g -1 (y i ) if y i is a function of s i -f -1 i-1 (f i-1 (s i-1 )), wherein the function g -1 ( )=sign(y)*|y| n , n being a predefined integer greater than 2.
Claim 20
Independent Claim
183 words
A method for decoding a plurality of transmission values y i received over a transmission medium, i=0, 1, 2, . . . , comprising the steps of: receiving each of said transmission values y i in conjunction with an indication of whether y i : (a) is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )), where each of the s i are starting values to be reconstructed; and calculating a reconstructed value s' i for each y i as s' i =g -1 (y i ) if y i is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), and calculating a reconstructed value s' i for each y i as s' i =s' i-1 +g -1 (y i ) if y i is a function of s i -f -1 i-1 (f i-1 (s i-1 )), wherein the function g -1 ( )=sign(y)*|y| n , n being a predefined integer greater than 2.
Claim 21
Independent Claim
177 words
A method for decoding a plurality of transmission values y i received over a transmission medium i=0, 1, 2, . . . , comprising the steps of, for i>0; receiving each of said transmission values y i in conjunction with an indication of whether y i : (a) is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )), where each of the s i are starting values to be reconstructed; and calculating a reconstructed value s' i for each y i as s' i =g -1 (y i ) if y i is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), and calculating a reconstructed value s' i for each y i as s' i =s' i-1 +g -1 (y i ) if y i is a function of s i -f -1 i-1 (f i-1 (s i-1 )), wherein the function g -1 ( )=sign(y)*y 2 .
Claim 22
Independent Claim
177 words
A method for decoding a plurality of transmission values y i received over a transmission medium i=0, 1, 2, . . . , comprising the steps of, for i>0; receiving each of said transmission values y i in conjunction with an indication of whether y i : (a) is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), or (b) is a function of s i -f -1 i-1 (f i-1 (s i-1 )), where each of the s i are starting values to be reconstructed; and calculating a reconstructed value s' i for each y i as s' i =g -1 (y i ) if y i is a function of s i and not f -1 i-1 (f i-1 (s i-1 )), and calculating a reconstructed value s' i for each y i as s' i =s' i-1 +g -1 (y i ) if y i is a function of s i -f -1 i-1 (f i-1 (s i-1 )), wherein the function g -1 ( )=sign(y)*y 2 .
Claim 23
Independent Claim
72 words
A method for decoding a plurality of transmission values y i received over a transmission medium, i=0, 1, 2, . . . , comprising the steps of, for i>0: receiving each of said transmission values y i ; and calculating a value z i for each of said y i , where for each i, z i =sign(y i )*|y i | n , n being a predetermined integer greater than 1.
Claim 24
Independent Claim
72 words
A method for decoding a plurality of transmission values y i received over a transmission medium, i=0, 1, 2, . . . , comprising the steps of, for i>0: receiving each of said transmission values y i ; and calculating a value z i for each of said y i , where for each i, z i =sign(y i )*|y i | n , n being a predetermined integer greater than 1.
Claim 25
Dependent Claim
8 words
A method according to claim 15, wherein n=2.
Claim 26
Dependent Claim
8 words
A method according to claim 15, wherein n=3.
Claim 27
Dependent Claim
158 words
A method according to claim 15, further comprising the steps of: receiving in conjunction with each of said y i an indication of whether y i is a function of s i and not of the difference between s i and a reconstruction of an encoded version of s i-1 , or is a function of the difference between s i and a reconstruction of an encoded version of s i-1 , each of the s i being starting values to be reconstructed; and determining a reconstructed value s' i for each y i as s' i =z i if y i is a function of s i and not of the difference between s i and a reconstruction of an encoded version of s i-1 , and as s' i =s' i-1 +z i if y i is a function of the difference between s i and a reconstruction of an encoded version of s i-1 .
References Cited (Backward Citations)
US5184317A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-03-31 | 2000-09-30 | 2001-04-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-03-31 | 2004-09-30 | 2005-04-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-03-31 | 2008-09-30 | 2009-04-01 | $7700.00 | Window Closed / Lapsed |