Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
241 words
A device for choosing in varying non-sequential order individual selections from playback media having a plurality of individual selections, comprising: means for playback of chosen individual selections from playback media; key means for receipt of a user command for playback of the individual selections in varying non-sequential order; processor means receiving said user command from said key means and responsively calculating a random selection from a deterministic function T n =SHUFFLE(S n , Seed) as follows ##STR1## where T n is a Selection Offset, S n is a sequence number, Seed is an unsigned uniform random value, S d is a temporary value, F 1 . . . F n are a series of closed operations using the current values of T n and S n , Rotate (S d , M 2 , N 2 ) circularly shifts a number S d , having N 2 bits, to the right M 2 times, M 1 is a number of loops, M 2 is the fixed number of bit the temporary value S d is to be rotated; N 2 is the number of bits in a seed; and G 1 . . . G n are closed operations based upon only T n ; and said processor means further including means for determining a chosen selection from said selection Offset T n and for communicating with said means for playback to play the chosen selection determined from said Selection Offset.
Claim 2
Independent Claim
241 words
A device for choosing in varying non-sequential order individual selections from playback media having a plurality of individual selections, comprising: means for playback of chosen individual selections from playback media; key means for receipt of a user command for playback of the individual selections in varying non-sequential order; processor means receiving said user command from said key means and responsively calculating a random selection from a deterministic function T n =SHUFFLE(S n , Seed) as follows ##STR1## where T n is a Selection Offset, S n is a sequence number, Seed is an unsigned uniform random value, S d is a temporary value, F 1 . . . F n are a series of closed operations using the current values of T n and S n , Rotate (S d , M 2 , N 2 ) circularly shifts a number S d , having N 2 bits, to the right M 2 times, M 1 is a number of loops, M 2 is the fixed number of bit the temporary value S d is to be rotated; N 2 is the number of bits in a seed; and G 1 . . . G n are closed operations based upon only T n ; and said processor means further including means for determining a chosen selection from said selection Offset T n and for communicating with said means for playback to play the chosen selection determined from said Selection Offset.
Claim 3
Dependent Claim
72 words
A device, as set forth in claim 1, wherein the playback media is a digital audio recording, and further including display means for receiving from said processor means and displaying said chosen individual selection, said processor means performing calculations in binary, including a plurality of operations selected from the group of bit inversions, exclusive OR with an N-bit constant, N-bit rotations, bit swapping, one to one substitutions, and modulus additions and subtractions.
Claim 4
Dependent Claim
89 words
A device, as set forth in claim 2, wherein said digital audio recording is a CD, and said deterministic function selects from up to two hundred fifty-six individual selections using a plurality of data bits in the range of three to eight, as follows ##STR2## where TableLookUp returns the number 5, 0, 3, 4, 2, 1, 6 or 7 when the three least significant bits from the number that results from the ANDing of T n with 07 is 0, 1, 2, 3, 4, 5, 6, or 7, respectively.
Claim 5
Independent Claim
98 words
A method for choosing individual selections from playback media having a plurality of individual selections and playing the individual selections in varying non-sequential order, comprising the steps of: (i) selecting a sequence number and a random seed in response to a user selecting a non-sequential playback mode; (ii) calculating a shuffled selection offset that corresponds to a unique selection on the playback media using a predetermined function based upon said sequence number and said random seed; (iii) determining the chosen selection from said shuffled selection offset, and, (iv) playing the chosen selection determined from said shuffled selection offset.
Claim 6
Independent Claim
98 words
A method for choosing individual selections from playback media having a plurality of individual selections and playing the individual selections in varying non-sequential order, comprising the steps of: (i) selecting a sequence number and a random seed in response to a user selecting a non-sequential playback mode; (ii) calculating a shuffled selection offset that corresponds to a unique selection on the playback media using a predetermined function based upon said sequence number and said random seed; (iii) determining the chosen selection from said shuffled selection offset, and, (iv) playing the chosen selection determined from said shuffled selection offset.
Claim 7
Dependent Claim
77 words
A method, as set forth in claim 4, wherein the playback media is a digital audio recording and said step (ii) of calculating a shuffled selection offset includes the step of performing a plurality of binary operations selected from the group of bit inversions, exclusive OR with an N-bit constant, N-bit rotations, bit swapping, one to one subtractions, and modulus additions and subtractions, beginning with said sequence number and said seed to generate said shuffled selection offset.
Claim 8
Dependent Claim
185 words
A method, as set forth in claim 5, wherein said digital audio recording is a CD, and said step (ii) of calculating a shuffled selection offset includes the step of performing the following ##STR3## where T n is said shuffled Selection Offset of N bit length; S n is a sequence number of N bit length that is incremented linearly to sequence through the shuffled order; Seed is an unsigned uniform random value of at least N bit length from which the particular sequence is generated; S d is a temporary value; F 1 . . . F n are said series of closed operations of N bits using the current values of T n and S n ; Rotate (X,Y,Z) circularly shifts a number X, consisting of Z bits, to the right Y times; M 1 is a loop counter; M 2 is the fixed number of bits the temporary value S d is to be rotated; N 2 is the number of bits in a seed; and, G 1 . . . G n are closed operations based upon only T n .
Claim 9
Dependent Claim
100 words
A method, as set forth in claim 6, wherein said predetermined function selects from up to two hundred fifty-six individual selections using a plurality of data bits in the range of three to eight, and said step (ii) of calculating a shuffled selection offset includes the step of performing the following ##STR4## and TableLookUp includes the step of returning the number 5, 0, 3, 4, 2, 1, 6 or 7 when the three least significant bits from the number that results from the ANDing of T n with 07 is 0, 1, 2, 3, 4, 5, 6, or 7, respectively.
Claim 10
Dependent Claim
37 words
A method as set forth in claim 4, further including the steps of: (v) incrementing the sequence number in response to the user selecting a next track for play and then performing the above steps of (ii)-(iv).
Claim 11
Dependent Claim
37 words
A method as set forth in claim 4, further including the steps of: (v) decrementing the sequence number in response to the user selecting a prior track for play and then performing the above steps of (ii)-(iv).