System and method for rebuilding edited digital audio files

• US 5,249,289 A
• Filed: 09/28/1989
• Issued: 09/28/1993
• Est. Priority Date: 09/28/1989
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Thamm, Howard C., Wilkes, Michael D.
• Primary Examiner(s): Shaw, Gareth O.
• Assistant Examiner(s): KATBAB, ABDOLLAH
• Application Number:
  US07/413,922
• Time in Patent Office: 1,461 Days
• Field of Search: 395/600
• US Class Current: 707/700
• CPC Class Codes: G11B 27/034 on discs G11B27/036, G11B27/038 take precedence
• CPC Class Codes: G11B 27/34 Indicating arrangements indicating means incorporated in magazine or cassette G11B23/046 and G11B23/0875; indicating measured values in general G01D
• CPC Class Codes: Y10S 707/99937 Sorting

Abstract

A system and method for use in a digitized audio data editing system for efficiently resequencing the audio data having indexes thereto. During resequencing, an audio index range table of such indexes is constructed. The table provides indications of consecutive index ranges of previously processed indexes. By traversing the table during resequencing to determine if a current index is a duplicate of any previously processed index corresponding to a previously copied audio segment, the necessity to compare each index with every index previously copied over is thereby avoided, which otherwise becomes increasingly inefficient as more indexes are copied over and thus the number of indexes to compare expands. Time required to process a resequence is accordingly significantly reduced.

Claims

1. A method for us in a digitized audio data editing system implemented with a digital computer for retrieving one or more segments of said data, comprising

generating a lookup table during a first resequencing comprised of

original indexes defining a first order of said segments prior to said first resequencing;

and

new indexes comprised of at least a portion of said original indexes arranged in a second order defining the desired order of at least a portion of said segments when said first resequencing is completed, each of said new indexes having a corresponding one of a plurality of table positions in said lookup table;

generating, during said first resequencing, a copy of said at least a portion of said segments;

generating a range table during said first resequencing comprised of a plurality of entries, each of said entries comprised of

a minimum and a maximum one of said new indexes which, in combination, define a unique range of consecutive said new indexes; and

one of said table positions in said lookup table corresponding to said minimum one of said indexes in said lookup table;

selecting a next one of said segments for inclusion in a second resequencing having associated therewith one of said original indexes;

determining, in a search of said range table, whether any of said entries has a said unique range which includes said selected one of said original indexes;

if said any of said entries does not have said unique range, copying said selected next one of said segments to said copy of said at least a portion of said segments, or,

alternatively, if said any of said entries does have said unique range, locating said selected one of said original indexes in a search of said new indexes included within said unique range; and

retrieving after said determining and locating a segment from said copy as said next one of said segments with one of said table positions of said lookup table corresponding to said located selected one of said original indexes.

2. The method of claim 1, wherein

if said any of said entries does not have said unique range, assigning a new table position to said selected next one of said segments in said copy;

or

alternatively, if said any of said entries does have said unique range, performing said search of said new indexes included within said unique range by the steps of

comparing sequentially each of said new indexes in said unique range to said selected one of said original indexes, starting with a first one of said new indexes in said unique range, until a matching new index is detected; and

determining one of said table positions in said lookup table corresponding to said matching new index.

3. The method of claim 2 further including, if said any of said entries does not have said range,

detecting with said computer if said selected one of said original indexes is within one of being in a said unique range;

expanding with said computer said range in response to said detection that said selected one of said original indexes is within one of being in a said unique range, or,

alternatively, in response to detection that said selected one of said original indexes is not within one of being in a said unique range, adding a new range to said range table.

4. The method of claim 3 including further detecting with said computer when said selected one of said original indexes is one greater than a minimum value of said original indexes within a first said range and one less than a maximum value of said original indexes within an adjacent second of said ranges;

and consolidating said first and second ranges in said range table into a single range in response to said further detecting step.

5. The method of claim 4 wherein each of said first and second ranges includes a respective associated said minimum table position;

and wherein said consolidating step includes storing with said computer the lesser associated minimum table position in associated with said single range in said range table.