# US 2004/0081045 A1 · Method and device for retrieving data in low-power

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0081045 A1
- Document ID: US20040081045A1
- Status: Published application
- Kind: A1
- Application number: 10/422,567
- Filed: 2003-04-24
- Published: 2004-04-29
- Earliest claimed: 2002-10-25
- Assignees: Hanyang Hak Won Co., Ltd.
- Inventors: Youjip Won; Jungwan Choi
- Web page: https://patentgrep.com/patent/US20040081045A1

## CPC

- G11B 19/00: Driving, starting, stopping record carriers not specifically of filamentary or web form, or of supports therefor; Control thereof; Control of operating function {; Driving both disc and head}
- G11B: INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER (recording measured values in a way that does not require playback through a transducer G01D9/00; recording or playback apparatus using mechanically marked tape, e.g. punched paper tape, or using unit records, e.g. punched or magnetically marked cards G06K; transferring data from one type of record carrier to another G06K1/18; circuits for coupling output of reproducer to radio receiver H04B1/20; gramophone pick-ups or like acoustic electromechanical transducers or circuits therefor H04R)

## Abstract

A method and device for retrieving data in low-power is provided. More specifically, it relates to a method and device for minimizing power consumption while retrieving the continuous media data from a disk drive for the purpose of real-time playback. The data reproducing device reproduces multimedia data by a determined playback strategy after it computes power consumption values according to various playback strategies and retrieves data from a storage medium by a playback strategy having the least power consumption by means of comparing respective power consumption values.

## Claims

### Claim 1

A method for reproducing data in low-power, comprising the steps of:
computing a first power consumption according to Normal playback strategy including start-up mode, read mode, idle mode and finish mode, and a second power consumption according to Full Buffering playback strategy including start-up mode, read mode, and finish mode;
retrieving data from a storage medium by a playback strategy having the least power consumption by means of comparing the first power consumption according to Normal playback strategy with the second power consumption according to Full Buffering playback strategy; and
reproducing the retrieved data.

### Claim 2 (depends on 1)

The method of claim 1, wherein the Full Buffering playback strategy in order to retrieve data from a storage medium in a round on a data reproducing device having a buffer, comprises the steps of:
a) performing a preceding operation for retrieving data when a reproducing command is inputted;
b) retrieving data from the storage medium;
c) sending the retrieved data to the buffer;
d) stopping retrieving data when the buffer becomes full;
e) executing spin down;
f) stopping rotating of a motor while the data filling the buffer are reproduced; and
g) requesting the reproducing command when the buffer becomes empty.

### Claim 3 (depends on 1)

The method of claim 1, wherein the Full Buffering playback strategy in order to retrieve data from a storage medium in a round on a data reproducing device having a buffer group comprising a plurality of buffers, comprises the steps of:
a) performing a preceding operation for retrieving data when a reproducing command is inputted;
b) retrieving data from the storage medium;
c) sending the retrieved data to a first buffer selected from the buffer group while the first buffer becomes full;
d) sending the retrieved data subsequently to any other buffer from the buffer group while the data filling the first buffer are reproduced;
e) executing spin down if all of buffers in the buffer group become full;
f) stopping rotating of a motor while an arbitrary buffer in the buffer group becomes empty; and
g) requesting the reproducing command when the arbitrary buffer in the buffer group becomes empty.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first power consumption is computed by the formula as defined below:
28 P N = P s + P f + α ⁡ ( B * R - r + Lr - B r )
where PN power consumption according to the Normal playback strategy, Ps is power consumption in the start-up mode, Pf is power consumption in the finish mode, α is power consumption rate in the read mode, B* is buffer size, R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, L is playback length, and B is data size retrieved during a round.

### Claim 5 (depends on 1)

The method of claim 1, wherein the second power consumption is computed by the formula as defined below:
29 P P = Lr B * ⁢ R R - r ⁢ E ⁡ ( P s + P f + α ⁢ B * R - r ) + ( P s + P f + αT p ′ ) ⁢ EI
where Pp is power consumption according to the Full Buffering playback strategy, Ps is power consumption in the start-up mode, Pf is power consumption in the finish mode, α is power consumption rate in the read mode, B* is buffer size, R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, L is playback length, T′p is the length of active mode in the last round, and I is an index function which is 0 if the surplus equals zero (0) when L is divided by length of a round but 1 other wise.

### Claim 6 (depends on 2)

The method of claim 2, wherein, the data size retrieved from the storage medium during the round, B, in the step b) is computed by the formula as defined below:
30 B = { T p ⁢ ER , ⁢ if ⁢ ⁢ T p ⁢ D ⁢ B * R - r B * R - r ⁢ R + ( T p - B * R - r ) ⁢ r , otherwise ⁢
where Tp is the length of active mode in each round, R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, and B* is buffer size.

### Claim 7 (depends on 3)

The method of claim 3, wherein, the data size retrieved from the storage medium during the round, B, in the step b) is computed by the formula as defined below:
31 B = { T p ⁢ E ⁢ ⁢ R , if ⁢ ⁢ T p ⁢ D ⁢ B * R - r B * R - r ⁢ R + ( T p - B * R - r ) ⁢ r , otherwise
where Tp is the length of active mode in each round, R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, and B* is buffer size.

### Claim 8 (depends on 6)

The method of claim 6, wherein the data size retrieved during a single round, B is greater than the minimum data size retrieved during a round capable of being reproduced in low-power, Bmin computed by the formula as defined below:
32 B min = ( R - r ) ⁢ s ⁢ ⁢ r ⁢ ⁢ s ⁢ [ T s + T f ] R - 2 ⁢ r
where R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, Ts is the length of start-up mode in each round, and Tf is the length of finish mode in each round.

### Claim 9 (depends on 2)

The method of claim 2, further comprising the step of
determining whether or not to merge a last round with any preceding round in a plurality of rounds.

### Claim 10 (depends on 3)

The method of claim 3, further comprising the step of
determining whether or not to merge a last round with any preceding round in a plurality of rounds.

### Claim 11 (depends on 9)

The method of claim 9, wherein the result of determining whether or not to merge the last round in a plurality of rounds with its preceding round is indicated by the sign of P* and computed by the formula as defined below:
33 P * = P s + P f + α ⁢ B 1 R - α ⁢ B 1 r
where B1 is the number of remaining data blocks retrieved in the last round.

### Claim 12 (depends on 11)

The method of claim 11, wherein the number of remaining data blocks retrieved in the last round, B1, is computed by the formula as defined below:
34 B 1 = L ⁢ ⁢ r - N ⁢ B * R - r ⁢ R
where L is playback length, r is playback rate from the buffer, N is the number of rounds of the same length, B* is buffer size, and R is the maximum transfer rate from the storage medium.

### Claim 13 (depends on 9)

The method of claim 9, wherein the step of determining whether or not to merge the last round with any preceding round in a plurality of rounds, comprises the steps of;
counting the number of preceding rounds from the last round;
computing the split data size by means of dividing the data size retrieved during a round by the number of preceding rounds; and
retrieving data from the storage medium by merging the split amount of data with the preceding rounds, respectively.

### Claim 14

A device for reproducing data in low-power, comprising:
a reading part for reading data from a storage medium;
a buffer for temporarily storing the data received from said reading part; and
an output part for reproducing the data stored in said buffer according to predetermined playback rate,
wherein said reading part reads the data from the storage medium according to a method comprising:
computing a first power consumption according to Normal playback strategy including start-up mode, read mode, idle mode and finish mode, and a second power consumption according to Full Buffering playback strategy including start-up mode, read mode, and finish mode;
retrieving data from a storage medium by a playback strategy having the least power consumption by means of comparing the first power consumption according to Normal playback strategy with the second power consumption according to Full Buffering playback strategy; and
reproducing the retrieved data.

### Claim 15

A method for reproducing data stored in a storage medium in low-power, comprising the steps of:
a) performing a preceding operation for retrieving data when a reproducing command is inputted;
b) retrieving data from the storage medium;
c) sending the retrieved data to a buffer;
d) stopping the retrieving of data when the buffer becomes full;
e) executing spin down;
f) stopping rotating of a motor while the data filling the buffer are reproduced;
g) requesting the reproducing command when the buffer becomes empty; and
h) repeating steps a)-g) by the number of rounds when a plurality of rounds exist.

### Claim 16 (depends on 15)

The method of claim 15, wherein the data size retrieved, B, in the step b) is computed by the formula as defined below:
35 B = { T p ⁢ E ⁢ ⁢ R , if ⁢ ⁢ T p ⁢ D ⁢ B * R - r B * R - r ⁢ R + ( T p - B * R - r ) ⁢ r , otherwise
where Tp is the length of active mode in each round, R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, and B* is buffer size.

### Claim 17 (depends on 16)

The method of claim 16, wherein the data size retrieved during a single round, B is greater than the minimum data size retrieved during a round capable of being reproduced in low-power, Bmin computed by the formula as defined below:
36 B min = ( R - r ) ⁢ s ⁢ ⁢ r ⁢ ⁢ s ⁢ [ T s + T f ] R - 2 ⁢ r
where R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, B* is buffer size, Ts is the length of start-up mode in each round, and Tf is the length of finish mode in each round.

### Claim 18 (depends on 15)

The method of claim 15, wherein the power consumption according to the method for reproducing data is computed by the formula as defined below:
37 P p = L ⁢ ⁢ r B * ⁢ R R - r ⁢ E ⁡ ( P s + P f + α ⁢ B * R - r ) + ( P s + P f + α ⁢ ⁢ T p ′ ) ⁢ E ⁢ ⁢ I
where Pp is power consumption according to Full Buffering playback strategy, Ps is power consumption in start-up mode, Pf is power consumption in finish mode, α is power consumption rate in read mode, B* is buffer size, R is the maximum transfer rate from the storage medium, r is playback rate from the buffer, L is playback length, T′p is the length of active mode in the last round, and I is an index function that is 0 if the surplus equals zero (0) when L is divided by length of a round but 1 otherwise.

### Claim 19 (depends on 15)

The method of claim 15, wherein in Full Buffering playback strategy as the method for reproducing data, further comprises the step of
determining whether or not to merge the last round with any preceding round in a plurality of rounds.

### Claim 20 (depends on 15)

The method of claim 15, wherein the result of determining whether or not to merge the last round in a plurality of rounds with its preceding round is indicated by the sign of P* and computed by the formula as defined below:
38 P * = P s + P f + α ⁢ B 1 R - α ⁢ B 1 r
where B1 is the number of remaining data blocks retrieved in the last round.

### Claim 21 (depends on 20)

The method of claim 20, wherein the number of remaining data blocks retrieved in the last round, B1, is computed by the formula as defined below:
39 B 1 = L ⁢ ⁢ r - N ⁢ B * R - r ⁢ R
where L is playback length, r is playback rate from the buffer, N is the number of rounds of the same length, B* is buffer size, and R is the maximum transfer rate from the storage medium.

### Claim 22 (depends on 19)

The method of claim 19, wherein the step of determining whether or not to merge the last round with any preceding round in a plurality of rounds, comprises the steps of;
counting the number of preceding rounds from the last round;
computing the split data size by means of dividing the data size retrieved during a round by the number of preceding rounds; and
retrieving data from the storage medium by merging the split amount of data with the preceding rounds, respectively.

### Claim 23 (depends on 15)

The method of claim 15, wherein the method for reproducing data removes an idle mode by means of setting a time-out value as zero.

### Claim 24

A device for reproducing data in low-power, comprising:
a reading part for reading data from a storage medium;
a buffer for temporarily storing the data received from said reading part; and
an output part for reproducing the data stored in said buffer according to a predetermined playback rate,
wherein said reading part reads the data from the storage medium according to a method comprising;
a) performing a preceding operation for retrieving data when a reproducing command is inputted;
b) retrieving data from the storage medium;
c) sending the retrieved data to a buffer;
d) stopping the retrieving of data when the buffer becomes full;
e) executing spin down;
f) stopping rotating of a motor while the data filling the buffer are reproduced;
g) requesting the reproducing command when the buffer becomes empty; and
h) repeating steps a)-g) by the number of rounds when a plurality of rounds exist.
