JP2003052006A - Information editing controller and method therefor, and disk device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an information editing controller for realizing high-speed editing by reducing a copy operation accompanied by read/write access to a recording medium in editing video and audio data. SOLUTION: The information editing controller includes a disk control means for reading and writing data to a hard disk 107 according to the received demand of read and write, and a file editing means for editing the file of image voice data recorded in the hard disk 107 by sending a read/write demand to the disk control means 105 by the use of a file system included in the hard disk 107.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information edit control device for performing edit processing such as partial deletion, insertion, movement, etc. on a frame-by-frame basis with respect to a data file such as video / audio recorded on a randomly accessible recording medium. The present invention relates to an information editing method and a disk device.

[0002]

2. Description of the Related Art In recent years, disk devices such as magnetic disk devices and optical disk devices have been rapidly improved in performance with respect to recording capacity and transfer speed, and are used for recording / reproducing video / audio data which is moving image data. Is increasing. In particular, the performance of the hard disk device is remarkably improved, and the hard disk device is used for a video server for storing and distributing video / audio data, an editing machine for editing video / audio data, and the like.

Further, in a PC (personal computer) as well, a hard disk device is used to record / reproduce application programs, data, etc. in the hard disk device. in this way,
In recent years, hard disk devices have been used in a wider range and have been increased in speed and capacity.

Using such a hard disk device,
Video and audio data in a DV format (hereinafter abbreviated as DV data) recorded by a digital VCR or the like has been edited on a PC. In this case, IEEE1
The 394 bus is used to convert the DV data into video data in the AVI (Audio Visual Interleaving) file format that is handled on the PC, and capture the data. Editing such as adding / moving a certain scene is performed.

A conventional editing procedure such as partial deletion, insertion, or movement of video data will be briefly described below. First, the procedure of the conventional partial deletion process will be described. As shown in FIG. 47, when deleting a part of the AVI file, the data of the latter half part which is divided into two by the partial deletion is read little by little and sequentially written at the deletion start position. Then, the operation is repeated up to the end of the file to complete the data movement, and the unnecessary second half is deleted. In this way, partial data deletion processing is realized.

Next, the procedure of the conventional insertion process will be described. As shown in FIG. 48, when inserting data into a certain part of the AVI file, all the data after the insertion position in the insertion destination file is read out to the virtual memory, and the portion after the insertion position of the insertion destination file is cut on the file system. Then, the insertion source data and the latter half of the data on the virtual memory are sequentially written to the final position of the file. In this way, the data insertion process is realized.

The procedure of the conventional moving process will be described. As shown in FIG. 49, when moving data from another AVI file to a certain part of the AVI file, all the data after the move start position in the move destination file is read out on the virtual memory, and the move start position of the move destination file is read. After that, the data is cut on the file system, and the source data and the latter half of the data in the virtual memory are sequentially written to the final position of the file. Then, in the source file, the moved data portion is partially deleted by the above-mentioned procedure. In this way, data movement is realized.

[0008]

However, in the conventional editing operation, since it is necessary to copy the data each time a partial deletion, insertion, or movement of the data is performed, read / write access to the hard disk device is performed. However, there is a problem that it is not possible to speed up the editing operation and it is not possible to provide a light editing operation. In particular, when a large amount of data, that is, an AVI file for a long time is edited, a lot of read and write access to the hard disk device occurs, which requires a great amount of editing processing time.

The present invention has been made in view of the above problems, and in the editing of video / audio data, the copy operation of the data accompanied by the read / write access to the recording medium is reduced, and the high speed editing is performed. An object is to provide a feasible information editing control device, an information editing method, and a disk device.

[0010]

In order to achieve the above object, an information editing control apparatus according to the present invention is information for editing video / audio data which is recorded in a randomly accessible recording medium and is composed of frame units. An edit control device, which is a recording medium control unit that reads and writes data to and from the recording medium according to a received read and write request, and an image recorded on the recording medium by sending a read and write request to the recording medium control unit. File editing means for editing a file of audio data, wherein the file editing means edits the audiovisual data by using a file system for managing the audiovisual data. It is what

The information editing control device according to the present invention is
In the information edit control device, the file editing means deletes a cluster including only a frame to be partially deleted on a file system, and an unnecessary area which is a data area to be deleted in one cluster and an effective area which is a data area which is not deleted. In the case where "and" are included, dummy data is inserted into the unnecessary area.

The information editing control device according to the present invention is
In the information edit control device, the file editing means inserts an unused cluster of data to be inserted into the file of the audiovisual data of the insertion destination on the file system, and when the frame is divided by the insertion. Eliminates the division, inserts data to be inserted into the unused cluster area, and inserts dummy data into an unnecessary area of the file.

Further, the information editing control device according to the present invention is
In the information editing control device, the file editing means inserts a predetermined unused cluster into the file of the moving image / audio data on the file system, and if a frame is divided by the insertion, the division is performed. To eliminate
The data of the cluster including a part of the moving audio and video data is copied to the unused cluster area, the cluster including only the moving frame is moved on the file system, and the source file and the destination file are moved. It is characterized in that dummy data is inserted in the unnecessary area in (3).

The information editing control apparatus according to the present invention is
In the information editing control device, the file editing means moves the data in the effective area and includes only the unnecessary area when dummy data of one cluster or more is inserted in the adjacent cluster of the audiovisual data. It is characterized in that the clusters that have become are deleted on the file system.

The information editing control device according to the present invention is
In the information edit control device, the randomly accessible recording medium is a magnetic disk.

The information editing control apparatus according to the present invention is
In the information editing control device, the randomly accessible recording medium is a magneto-optical disk.

Further, the information editing method according to the present invention is an information editing method for editing video / audio data which is recorded in a randomly accessible recording medium and which is composed of frame units, and manages the video / audio data. The video / audio data is edited by using the file system.

In the information editing method according to the present invention, in the information editing method, a step of deleting a cluster including only frames to be partially deleted on the file system, and an unnecessary area which is a data area to be deleted in one cluster And a step of inserting dummy data into the unnecessary area when an effective area which is a data area that is not deleted is included.

In the information editing method according to the present invention, in the information editing method, a step of inserting an unused cluster for the data to be inserted into the file of the audio / video data of the insertion destination on the file system, By inserting
When the frame is divided, a step of eliminating the division by moving the data of the divided frame, a step of inserting the data to be inserted into the unused cluster area, and a dummy area in the unnecessary area of the file And a step of inserting data.

Further, the information editing method according to the present invention is characterized in that, in the information editing method, a step of inserting a predetermined unused cluster into a file of the moving image / audio data on the file system, and the insertion, When the frame is divided, the step of eliminating the division by moving the data of the divided frame, and the cluster data including a part of the moving audiovisual data frame as the unused cluster area To move the cluster containing only the frames to be moved on the file system, the source file,
And a step of inserting dummy data into an unnecessary area in the destination file.

In the information editing method according to the present invention, the data in the effective area is moved when one cluster or more of dummy data is inserted in the adjacent cluster of the audiovisual data. The method further comprises the step of deleting, on the file system, the cluster that includes only the unnecessary area.

The information editing method according to the present invention is characterized in that, in the information editing method, the randomly accessible recording medium is a magnetic disk.

Further, an information editing method according to the present invention is characterized in that, in the information editing method, the randomly accessible recording medium is a magneto-optical disk.

A disk device according to the present invention is characterized by including the information editing control device.

[0025]

BEST MODE FOR CARRYING OUT THE INVENTION (Embodiment 1) Hereinafter, an information editing control device and an information editing method according to a first embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the information editing control device according to the first embodiment.

As shown in FIG. 1, the information editing control apparatus 100 according to the first embodiment has a control signal (a signal relating to a command) and a data signal (a command parameter, a file, etc.) from an external device such as a PC or an AV device 101. An external interface means 103 for transmitting and receiving digital signals to and from an external device via an interface bus 102 for transferring signals relating to file system information),
A file editing unit 104 that receives an edit request relating to a video / audio data file from the external interface unit 103 and issues a read / write request to perform edit processing on the requested video / audio data or a file system; and a video issued by the file editing unit 104. In accordance with a read / write request of audio data or a file system, a disk control unit 105 for executing reading / writing of data from / to the hard disk 107, data read from the hard disk 107 by the disk control unit 105, and the disk control unit 105 in the hard disk 107. And a buffer memory 106 in which data to be written is stored.
Here, on the hard disk 107, a video / audio data file (in the first embodiment, as the video / audio data,
Video data in the AVI file format will be described as an example) according to the file system.

In the first embodiment, the hard disk 107 is a 2 GB hard disk with an IDE interface.
A hard disk device (HDD) with a large capacity is used. The recording area of the hard disk 107 is managed in sector units with 512 bytes as one sector, and a logical block address (LBA) is assigned to each sector. In the first embodiment, the file system is a FAT (File Allocation Table).
The case of using will be described.

FIG. 2 is a diagram showing an example of a data area structure when the hard disk 107 according to the first embodiment is formatted by FAT. Hard disk 107
, A file system area is allocated to the head part of the LBA, and a data area for storing audiovisual data is allocated to the remaining part.

Video and audio data is recorded in the data area, but in the first embodiment, as a file in the AVI file format, in cluster units (in a 2 GB hard disk, one cluster is 128 sectors, that is, an area of 64 KB). Managed by. At this time, since the size of one frame of the audiovisual data in the AVI file format is not an integral multiple of a sector unit, in most cases, the leading portion of each frame is neither a sector break nor a cluster break.

The data area is divided into blocks in units of clusters, and the cluster number is assigned from 0 to each cluster. Then, file access is performed in cluster units based on this cluster number. In reality, the clusters 0 and 1 are not used, so the cluster number starts from 2. In the first embodiment, the cluster number is described in a 4-digit hexadecimal format.

The file system area is divided into a boot data area, a FAT area, and a root directory area. Parameter data necessary for the file system and data necessary for booting from the HDD when connecting to the PC are recorded in the boot data area. In the FAT area and the root directory area, address information and the like necessary for accessing the file recorded in the data area are recorded.

The FAT area is divided into 16-bit units, with the first being 0 and numbers up to FFFFh are sequentially assigned to the corresponding positions. This 16-bit unit area is F
It is called an AT entry and corresponds to each cluster in the data area from the first area. If the number assigned to the FAT entry is 0 or 1, it indicates that the cluster corresponding to the FAT entry is unused, and if the value is 2 to FFEFh, the cluster corresponding to the FAT entry is in use. Then, the value indicates the next FAT entry (that is, the number indicating the next cluster), and F
FF7h indicates a defective cluster, and FFF8
A value from h to FFFFh indicates that the cluster corresponding to the FAT entry is in use and is the last cluster in the file.

In the root directory area, a directory / file management information table showing information on each file and directory recorded in the root directory of the data area is recorded.

FIG. 3 is a diagram showing an example of the structure of the management information table of the directory / file. As shown in FIG. 3, the directory / file management information table has information indicating the name of the directory or file, the attribute, the update date and time, the start cluster number of the file, the file size, and the like.

FIG. 4 is a diagram showing the relationship between FATs and clusters. As shown in FIG. 4, one file is configured by the clusters 2 to 12, and another file is configured by the clusters 13 to 22. In this way, the file area will be indicated by the chain of FATs. A
The VI file is a RIFF (Resource Interchange File).
e Format) format. The RIFF is a file format for converting various resources into one file, and has a structure in which the compatibility of the basic structure is maintained even when resources of a new format are created.

FIG. 5 is a diagram for explaining the structure of the RIFF file format. As shown in FIG. 5, the RIFF file is hierarchically composed of a plurality of blocks. This one block is a chunk (chunk:
Lump). Each chunk contains the following fields.

1) A four-character code (FOURCC) as an ID field for identifying the type of chunk. By convention, use uppercase for chunk type registrations, and lowercase otherwise. 2) DWO that specifies the size of chunk data members
RD value (4 bytes). 3) Data section. The size is specified in 2) above.

Although another chunk can be included in a chunk as a sub-chunk, a sub-chunk can be included in a RIFF chunk or a LIST.
Only chunks.

The first chunk of the file must be identified as RIFF. That is, all other chunks in the file are subchunks of the RIFF chunk. In the RIFF chunk, an additional field is included in the first 4 bytes of the data part. This additional field specifies the form type of the chunk. The form type is a 4-character code that identifies the format of the data stored in the file. Form types include "AVI" and "WAVE".

Also in the LIST chunk, the first 4 of the data part
The byte contains additional fields. This additional field specifies the chunk list type. The list type is a 4-character code that identifies the contents of the list. List types include "hdrl" and "st
There are "rl", "movi", and "rec." The LIST chunk is a group of sub chunks.

FIG. 6 is a diagram for explaining the file structure of the AVI file format. As shown in FIG. 6, the form type of the first RIFF chunk is “AVI”,
Below this are three blocks: LIST (hdrl) chunk, JUNK sub-chunk, and LIST (movi) chunk. A for LIST (hdrrl) chunk
The header part of the VI file is stored, and there are an avih sub chunk and a LIST (strl) chunk. avi
Information of the entire AVI file is stored in the h sub-chunk. There are two LIST chunks in the LIST (strl) chunk, one for Video data and the other for Audio data. Video
For data, AVIStreamHeade in strh subchunk
There is a BITMAPINFO structure in the r structure and strf sub chunk. For Audio data, strv subchunk has AVIStreamHeader structure, strf subchunk has Wav
There is an eFormatEX structure.

Dummy data for padding each chunk is inserted in the JUNK sub chunk. LI
The ST (movi) chunk stores actual audio and video data. In this chunk, LI
There is an ST (rec) chunk, in which one frame of video data and audio data is included as a sub-chunk. Then, the actual number of frames is LIST.
(Rec) Chunk is repeated.

Next, the operation of the information editing control device according to the first embodiment and the information editing method will be described. The operations performed by the information editing control apparatus 100 according to the first embodiment for editing commands are partial deletion processing operation, insertion processing operation,
And the movement processing operation can be roughly classified into three operations.

When the file system information or file data is read from the hard disk 107, the file editing means 104 that has received the above-mentioned edit request shows the LBA indicating the address on the hard disk 107 to be read.
Then, a read request is issued to the disk control means 105 using the number of sectors, and the address of the buffer memory 106 for storing the read data as parameters. And
According to the read request, the disk control unit 105 reads out necessary data from the hard disk 107 to the designated address of the buffer memory 106.

When writing file system information or file data to the hard disk 107, the file editing means 104 makes the hard disk 1 to be written.
A write request is issued to the disk control unit 105 using the LBA indicating the address on 07, the number of sectors, and the address of the write data set in the buffer memory 106 as parameters. Then, the disk control means 105
The buffer memory 1 according to the write request.
The data set at the designated address 06 is written in the hard disk 107.

In the following description, the editing operation of the file editing means 104 will be mainly described, and writing of data to the buffer memory 106, reading of data from the buffer memory 106, or the disk control means 1 will be described.
A description of processing such as writing data to the hard disk 107 by 05 is omitted as appropriate, but strictly speaking, it is as described above.

File editing means 104 that has completed the editing operation
Sends an edit end notification to the external interface unit 103. Then, the external interface unit 103 sends an edit end notification to the PC or AV device 101, which is an external device, and the process ends.

Hereinafter, each of the three processing operations of the partial deletion processing operation, the insertion processing operation, and the movement processing operation in response to the edit request will be described in detail.

[Partial Deletion Processing Operation] First, the partial deletion processing operation will be described in detail. In FIG. 1, a control command for requesting partial deletion of a file from an external device such as a PC or AV device 101 is an information editing control device 100.
Is input to the external interface means 103,
It receives the parameter of the partial deletion command from the PC or AV device 101 and outputs a partial deletion request including the parameter to the file editing means 104. Then, the file editing means 104 starts the partial deletion process.

FIG. 7 is a diagram showing parameters associated with the control command for requesting partial deletion according to the first embodiment. As shown in FIG. 7, the parameters associated with the control command requesting partial deletion include the partial deletion command code indicating the partial deletion request, the target file name indicating the file to be partially deleted, and the start frame of the portion to be deleted. It is composed of a start frame number indicating a position and a number of deleted frames indicating the number of frames to be deleted.

The operation when the file editing means 104 receives the partial deletion request will be described in detail with reference to FIGS. 8 to 13. FIG. 8 is a diagram showing a file to be partially deleted so that the cluster and the frame image can be seen. As shown in FIG. 8, the AVI file to be partially deleted is in the continuous area of clusters 10 to 21.
It is composed of frames. Then, from the third frame to the third frame, that is, the fifth frame is a frame to be deleted.

FIG. 9 is a diagram showing an image in which unnecessary clusters are deleted from the image in FIG. 8, and completely unnecessary clusters 14 to 17 are used as FAs as unused clusters.
The image when the FAT information is corrected so that the cluster next to the cluster 13 becomes the cluster 18 is shown. FIG. 10 is a diagram showing an image in which unnecessary portions (unnecessary areas) of the clusters 13 and 18 in the image of FIG. 9 are made into JUNK chunks as dummy data to eliminate the contradiction on the file.

FIG. 11 is a diagram for explaining the FAT information regarding the file in each state of FIGS. 8 to 10. FIG. 12 is a diagram showing the structure of a JUNK chunk. As shown in FIG. 12, an ID indicating a JUNK chunk is stored in the first 4 bytes by the ASCII character "JUNK", and the data size of the subsequent JUNK chunk is stored in the next 4 bytes. .

FIG. 13 is a flow chart showing the partial deletion processing of the designated file which is performed by the file editing means 104 which has received the partial deletion request. In step S1, the file editing means 104 extracts the directory information and FAT information of the file to be partially deleted from the hard disk 107 via the disk control device 105. Then, the cluster number having the deletion start position and the deletion end position in the AVI file and the offset within the cluster are extracted from the directory information and the corresponding FAT information, and the process proceeds to step S2. For example, in FIG. 8, the deletion start position is in the cluster 13, the offset is + α, the deletion end position is in the cluster 18, and the offset is + β. Further, the FAT information has the values in the column of FIG. 8 shown in FIG.

In step S2, the FAT entry corresponding to the cluster that is completely unnecessary in the frame to be partially deleted, that is, the cluster including only the frame to be partially deleted is set to 0000h indicating the unused state, and the first cluster to be unused is shown. The contents of the FAT entry
Remove completely unnecessary clusters on the file system by changing to the cluster number next to the last cluster to be unused. For example, the file image is as shown in FIG. 9, and the FAT information at that time has the values in the column of FIG. 9 shown in FIG.

In step S3, the data size to be deleted is JUN in the cluster including the deletion start position.
It is determined whether the size is smaller than the minimum size of K chunk (8 bytes). And the data size to be deleted is JUN
If it is determined that the size is smaller than the minimum size of the K chunk, the process proceeds to step S7, and if not, the process proceeds to step S4. In step S4, the data of the cluster including the deletion start position is transferred to the disk controller 105.
From the hard disk 107 to the buffer memory 10 via
Take out to 6.

In step S5, the ID and data size of the JUNK chunk are written in the unnecessary part of the cluster extracted in the buffer memory 106 in step S4, and the unnecessary part generated in step S2 is set as the JUNK chunk. At this time, the data size of the JUNK chunk is the total size of the unnecessary parts of the cluster 13 and the cluster 18 in FIG. 9, for example. In step S6, the cluster data in the buffer memory 106 is
In step S4, the data is written back to the position extracted from the hard disk 107 via the disk control device 105, and the process proceeds to step S10.

In step S7, the data of the cluster including the deletion start position and the data of the next cluster are taken out from the hard disk 107 to the buffer memory 106 via the disk control device 105 so as to be continuous. In step S8, in step S7, the buffer memory 1
The ID and data size of the JUNK chunk are written in the unnecessary portions of the two consecutive clusters extracted in 06, and the unnecessary portions generated in step S2 are set as JUNK chunks.

In step S9, the buffer memory 1
The cluster data for two clusters in 06 is written back to the position extracted from the hard disk 107 in step S7 via the disk controller 105. When the unnecessary areas, which are the data areas to be deleted, and the valid areas, which are the data areas that are not deleted, are included in one cluster by the processing of these steps S3 to S9 (for example,
In the clusters 13 and 18 in FIG. 9, dummy data is inserted in the unnecessary area and only the effective area is left.

In step S10, the file size and update date / time information of the directory information of the file to be partially deleted are updated, and the process is terminated. In each of the above processes, even if it is determined in step S3 that the data size to be deleted of the deletion start cluster is smaller than the minimum size of the JUNK chunk, the deletion start cluster and the deletion end cluster should be deleted. It is also possible that the total data size does not reach the minimum size of the JUNK chunk. In that case, the file editing means 104 detects that from the offsets (α, β) extracted in step S1, and when a completely unnecessary cluster is unused in step S2, the cluster to be unused is set. 1
The number of clusters is reduced, and in steps S7 to S9, the unnecessary portion including the completely unused cluster is JUN
It suffices to carry out the processing of K chunk.

In this way, the operation of the FAT chain and the J
Since the partial deletion process is performed by inserting the UNK chunk, the partial deletion process can be realized only by the FAT operation without causing a contradiction on the file, the data copy operation can be reduced, and the faster part Deletion processing can be performed.

Next, referring to FIG. 14 to FIG.
The operation of further deleting a useless area from the JUNK chunk generated in the partial deletion process indicated by will be described in detail. FIG. 14 is a diagram showing a frame image after the partial deletion described with reference to FIGS. 8 to 13 is performed. That is, the result after performing the partial deletion process is shown, and this is an example in which the JUNK chunk is put in the cluster 14 and the cluster 20.

FIG. 15 shows the JU in the image of FIG.
It is a figure for demonstrating a NK chunk part in detail. In the enlarged view on the right side of FIG. 15, A is a JU in the cluster (cluster a) that includes the beginning of the JUNK chunk.
NK chunk is the end part of the frame immediately before, B is JU
JU in the cluster that contains the beginning of the NK chunk
NK chunk part (unnecessary area), C is JUNK
Cluster including the end part of chunk (cluster b)
JUNK chunk part (unnecessary area) in
Is the beginning part of the frame immediately after the JUNK chunk in the cluster including the end part of the JUNK chunk. In the diagram on the left side of FIG. 15, A in cluster 14 is replaced with cluster 2
An image to be copied to the head portion of C at 0 is shown. FIG. 16 shows the cluster 14 in the image of FIG.
Is an unused cluster, and an unnecessary part of the cluster 20 is J
It is a figure which shows the image which made it a UNK chunk and eliminated the contradiction on a file.

FIG. 17 shows the JU in the image of FIG.
It is a figure for demonstrating a NK chunk part in detail. In the enlarged view on the right side of FIG. 17, A is a JU in the cluster (cluster a) including the beginning of the JUNK chunk.
NK chunk is the end part of the frame immediately before, B is JU
JU in the cluster that contains the beginning of the NK chunk
NK chunk part (unnecessary area), C is JUNK
Cluster including the end part of chunk (cluster b)
JUNK chunk part (unnecessary area) in
Is the beginning part of the frame immediately after the JUNK chunk in the cluster including the end part of the JUNK chunk. In the diagram on the left side of FIG. 17, D in cluster 20 is replaced with cluster 1
4 shows an image to be copied to the end portion of B in FIG. FIG. 18 shows the cluster 20 that was in the image of FIG.
Is an unused cluster, and an unnecessary part of the cluster 14 is J
It is a figure which shows the image which made it a UNK chunk and eliminated the contradiction on a file.

FIG. 19 is a diagram for explaining the FAT information regarding the file in each state of FIGS. 14 to 18. FIG. 20 is a flowchart showing an example of a process of further deleting a useless area, which is performed by the file editing unit 104 when a JUNK chunk occurs.

In step S11, the cluster containing the beginning of the JUNK chunk (cluster a in FIG. 15)
The size of the end portion (corresponding to A in FIG. 15) of the frame immediately before the JUNK chunk in JUNK chunk is
If the size is equal to the size of the JUNK chunk part (corresponding to C in FIG. 15) in the cluster including the end part of the chunk (corresponding to cluster b in FIG. 15), the process proceeds to step S12, and the end part of the JUNK chunk. If the value is equal to or smaller than the value obtained by subtracting the minimum size (8 bytes) of the JUNK chunk from the size of the JUNK chunk part (corresponding to the unnecessary area C in FIG. 15) in the cluster including, the process proceeds to step S14, and If so, the process ends.

In step S12, the data of the cluster including the end portion of the JUNK chunk is fetched from the hard disk 107 to the buffer memory 106 via the disk controller 105. In step S13, the JU is placed at the beginning position of the JUNK chunk portion (corresponding to the unnecessary area C in FIG. 15) in the cluster including the end portion of the JUNK chunk on the buffer memory 106.
JU in the cluster that contains the beginning of the NK chunk
The end portion (corresponding to A in FIG. 15) of the frame immediately before the NK chunk is copied and the process proceeds to step S17.

In step S14, the data of the cluster including the end portion of the JUNK chunk (corresponding to cluster b in FIG. 15) is fetched from the hard disk 107 to the buffer memory 106 via the disk controller 105. In step S15, the buffer memory 1
The part of the JUNK chunk in the cluster including the end part of the JUNK chunk on 06 (the unnecessary area C in FIG. 15).
(Corresponding to A), the end portion (corresponding to A in FIG. 15) of the frame immediately preceding the JUNK chunk in the cluster including the head portion of the JUNK chunk is copied.

In step S16, of the unnecessary portion C in the buffer memory 106, the ID and data size of the JUNK chunk are written at the beginning of the remaining portion after copying A, and the unnecessary portion generated in step S15 is replaced with a new JUN.
Use K chunk. In step S17, the cluster data in the buffer memory 106 is written back to the position extracted from the hard disk 107 in step S12 or step S14 via the disk controller 105.

In step S18, the FAT entry corresponding to the cluster containing the JUNK start portion (corresponding to cluster a in FIG. 15) is set to 0000h indicating the unused state, indicating the cluster to be unused. F
Change the contents of the AT entry to the cluster number next to the cluster to be unused. For example, the file image is as shown in FIG. 16, and the FAT information at that time is the value in the column of FIG. 16 shown in FIG. In step S19, the file size of the directory information and the update date / time information for the file changed by the above processing are updated, and the processing ends.

FIG. 21 is a flow chart showing another example of the process of further deleting a useless area, which is performed by the file editing means 104 when a JUNK chunk occurs. In step S21, the size of the head portion (corresponding to D in FIG. 17) of the frame immediately after the JUNK chunk in the cluster (corresponding to cluster b in FIG. 17) including the end portion of the JUNK chunk is the head portion of the JUNK chunk. A cluster including (the cluster a in FIG.
(Corresponding to B) in the JUNK chunk portion (corresponding to B in FIG. 17).
If the value is equal to or smaller than the value obtained by subtracting the minimum size (8 bytes) of the JUNK chunk from the size of the JUNK chunk part (corresponding to the unnecessary area B in FIG. 17) in the cluster including the head part of the JUNK chunk, , Step S
24. If not, the process ends.

In step S22, the data of the cluster including the beginning of the JUNK chunk is fetched from the hard disk 107 to the buffer memory 106 via the disk controller 105. In step S23, the JU is placed at the end position of the JUNK chunk portion (corresponding to the unnecessary area B in FIG. 17) in the cluster including the head portion of the JUNK chunk on the buffer memory 106.
JU in the cluster that contains the end part of the NK chunk
The head portion (corresponding to D in FIG. 17) of the frame immediately after the NK chunk is copied and the process proceeds to step S27.

In step S24, the data of the cluster including the beginning of the JUNK chunk (corresponding to cluster a in FIG. 17) is fetched from the hard disk 107 to the buffer memory 106 via the disk controller 105. In step S25, the buffer memory 1
The part of the JUNK chunk in the cluster including the head part of the JUNK chunk on 06 (unnecessary area B in FIG. 17).
To the end position (corresponding to (1)) of the frame immediately after the JUNK chunk in the cluster including the end part of the JUNK chunk (corresponding to D in FIG. 17).

In step S26, of the unnecessary portion B on the buffer memory 106, the ID of the JUNK chunk and the data size are written at the beginning of the remaining portion after copying D, and the unnecessary portion generated in step S25 is replaced with a new JUN.
Use K chunk. In step S27, the cluster data in the buffer memory 106 is written back to the position extracted from the hard disk 107 in step S22 or step S24 via the disk controller 105.

In step S28, the FAT entry corresponding to the cluster (corresponding to cluster b in FIG. 17) containing the JUNK end portion is set to 0000h indicating the unused state, indicating the cluster to be unused. F
Change the contents of the AT entry to the cluster number next to the cluster to be unused. For example, the file image is as shown in FIG. 18, and the FAT information at that time is the value in the column of FIG. 18 shown in FIG. In step S29, the file size of the directory information and the update date / time information for the file changed in the above process are updated, and the process ends.

As described above, after the partial deletion processing shown in FIG. 13 is performed, the JUNK generated in the partial deletion processing is executed.
If the total number of chunks is one cluster or more (strictly speaking, it is exactly one cluster, or if it is more than the sum of one cluster and the minimum size of JUNK chunk), it is divided into two adjacent clusters. One of the valid data is moved to the JUNK chunk area of the other cluster, and the cluster that includes only the unnecessary area is deleted on the file system, whereby the unnecessary data area can be further reduced.

[Insertion Processing Operation] Next, the insertion processing operation will be described in detail. In FIG. 1, the external device P
When a control command requesting insertion of a frame is input from the C or AV device 101 to the information editing control device 100, the external interface unit 103 receives the parameter of the insertion command from the PC or AV device 101, and the file editing unit 104. The insert request including the parameter is output to. Then, the file editing means 104
Starts the insertion process.

FIG. 22 is a diagram showing parameters associated with the control command requesting insertion of frame data according to the first embodiment. As shown in FIG. 22, the parameters associated with the control command requesting insertion of frame data include an insertion command code indicating an insertion request, an insertion source file name indicating a file having insertion frame data, and
Insertion source start frame number indicating the start frame position of the insertion frame data, insertion frame number indicating the number of frames to be inserted, insertion destination file name indicating the file to be inserted, and insertion frame data insertion start frame It is composed of an insertion destination start frame number indicating a position.

An example of the operation when the file editing means 104 receives an insertion request will be described in detail with reference to FIGS. 23 to 29. FIG. 23 is a diagram showing the clusters and frame images occupied by the insertion source file (file 1) and the insertion destination file (file 2) so that they can be seen. As shown in FIG. 23, the insertion source file is cluster 1
It is composed of 7 frames in a continuous area of 0 to 21, and the insertion destination file is composed of 5 frames in a continuous area of clusters 30 to 38. And
3 frames from the 3rd frame of the insertion source file,
That is, up to the fifth frame is the frame inserted at the beginning position of the fourth frame of the insertion destination file.

FIG. 24 shows the number of clusters (6 clusters in FIG. 23) in which the frame of the insertion source exists after the cluster in which the insertion start position of the insertion destination file exists in order to perform the insertion processing shown in FIG. Is a diagram showing an image of inserting unused clusters by changing FAT information, and shows an image when FAT information is modified so that unused clusters 40 to 45 are inserted between clusters 34 and 35. .

In FIG. 25, after the process of FIG. 24 is performed, the frame head portion after the insertion position in the cluster (cluster 34) having the insertion position in the insertion destination file is before the cluster having the divided remaining frame. By copying to the end of the cluster (cluster 45) of
It is a figure which shows the image at the time of making the frame (4th frame) divided as shown in FIG. 24 continuous.

FIG. 26 is a diagram showing an image after the insertion frames (3 frames) of the insertion source file are sequentially copied to the insertion position of the insertion destination file shown in FIG. FIG. 27 is a diagram showing an image in which the unnecessary area (existing in the clusters 44 and 45) shown in FIG. 26 is made into a JUNK chunk and the contradiction is eliminated as an AVI file.

FIG. 28 is a diagram for explaining the FAT information regarding the insertion destination file in each of the states shown in FIGS. 23 to 27. FIG. 29 is a flowchart showing an example of a specified file insertion process performed by the file editing means 104 which receives the insertion request.

In step S31, the hard disk drive 1 receives the directory information and FAT information of the file to be inserted into the hard disk 1 via the disk controller 105.
Take out from 07. Then, from the directory information and the corresponding FAT information, the cluster number where the insertion start position in the AVI file is located and the offset within the cluster are extracted. Further, the directory information and FAT information of the insertion source file to be inserted are taken out from the hard disk 107 via the disk control device 105, and the cluster number and the cluster having the insertion source start frame in the AVI file are extracted from the directory information and the corresponding FAT information. Get the offset inside. Then, next to the cluster having the insertion start position of the insertion destination file, unused clusters corresponding to the data to be inserted, that is, unused clusters corresponding to the number of clusters in which the frame of the insertion source exists (6 clusters in FIG. 23) are FAT. Insert by changing information. For example, the file image is as shown in Fig. 24, and the FAT at that time is
The information is the value in the column of FIG. 24 shown in FIG.

In step S32, as shown in FIG. 25, the beginning of the frame after the insertion position in the cluster having the insertion position in the insertion destination file is copied to the end part of the final cluster in the unused cluster inserted in step S31. Then, the frame division due to the insertion of the unused cluster in step S31 is eliminated. In step S33, as shown in FIG. 26, the insertion start frame to the end frame of the insertion source file are sequentially copied to the insertion start position of the insertion destination file.

In step S34, the data of the cluster including the insertion end position and the data of the next cluster are transferred to the hard disk 1 via the disk controller 105.
The data is sequentially taken out from the buffer memory 106 from 07. In step S35, the ID and data size of the JUNK chunk are written in the unnecessary portion on the buffer memory 106 fetched in step 34, and the unnecessary portion generated in step S33 is made a JUNK chunk.

In step S36, the cluster data in the buffer memory 106 is written back to the position extracted from the hard disk 107 in step S34 via the disk controller 105. These steps S34 to S
By inserting the JUNK chunk as dummy data into the unnecessary area of the insertion destination file by the process of 36, A
The contradiction as a VI file is eliminated. Step S
In 37, the file size of the directory information of the insertion destination file and the update date / time information are updated, and the processing is ended.

Next, another example of the operation when the file editing means 104 receives an insertion request will be described in detail with reference to FIGS. 30 to 36. FIG. 30 shows an insertion source file (file 1) and an insertion destination file (file 2)
It is the figure shown so that the cluster and the frame image which are occupied may be understood. As shown in FIG. 30, the insertion source file is composed of 7 frames in the continuous area of clusters 10 to 21, and the insertion destination file is composed of 4 frames in the continuous area of clusters 30 to 36. . And 3 from the 3rd frame of the insertion source file
The frame, that is, up to the fifth frame is the frame inserted at the beginning position of the third frame of the insertion destination file.

FIG. 31 shows the number of clusters (6 clusters in FIG. 30) in which the frame of the insertion source exists before the cluster in which the insertion start position of the insertion destination file exists in order to perform the insertion processing as shown in FIG. Is a diagram showing an image of inserting unused clusters by changing FAT information, and shows an image when FAT information is modified so that unused clusters 40 to 45 are inserted between clusters 32 and 33. .

In FIG. 32, after performing the processing of FIG. 31, the frame end portion immediately before the insertion position in the cluster (cluster 33) having the insertion position in the insertion destination file is immediately after the cluster having the divided remaining frames. By copying to the beginning of the cluster (cluster 40) of
FIG. 32 is a diagram showing an image in the case where the divided frames (second frame) are made continuous as shown in FIG. 31.

FIG. 33 is a diagram showing an image after sequentially copying the insertion frames (3 frames) of the insertion source file to the insertion position (in the cluster 40) moved as shown in FIG. FIG. 34 is a diagram showing an image in which the unnecessary area (existing in the clusters 45 and 33) shown in FIG. 33 is made into a JUNK chunk and the contradiction is eliminated as an AVI file. FIG. 35 is a diagram for explaining the FAT information regarding the insertion destination file in each state of FIGS. 30 to 34. FIG. 36 is a flowchart showing another example of the insertion process of the designated file, which is performed by the file editing means 104 which has received the insertion request.

In step S41, the directory information and FAT information of the insertion destination file to be inserted are stored in the hard disk 1 via the disk controller 105.
Take out from 07. Then, from the directory information and the corresponding FAT information, the cluster number where the insertion start position in the AVI file is located and the offset within the cluster are extracted. Further, the directory information and FAT information of the insertion source file to be inserted are taken out from the hard disk 107 via the disk control device 105, and the cluster number and the cluster having the insertion source start frame in the AVI file are extracted from the directory information and the corresponding FAT information. Get the offset inside. Then, before the cluster having the insertion start position of the insertion destination file, unused clusters corresponding to the number of clusters in which the frame of the insertion source exists (6 clusters in FIG. 30) are inserted by changing the FAT information. For example, the file image is as shown in FIG. 31, and the FAT information at that time is the value in the column of FIG. 31 shown in FIG.

In step S42, as shown in FIG. 32, the frame end portion immediately before the insertion position in the cluster having the insertion position in the insertion destination file is copied to the beginning portion of the first cluster in the unused cluster inserted in step S41. Then, the division of the frame due to the insertion of the unused cluster in step S41 is eliminated. In step S43, as shown in FIG. 33, the insertion start frame to the end frame of the insertion source file are sequentially copied to the insertion start position of the insertion destination file moved in step 42.

In step S44, the data of the cluster including the insertion end position and the data of the next cluster are transferred to the hard disk 1 via the disk controller 105.
The data is sequentially taken out from the buffer memory 106 from 07. In step S45, the ID and data size of the JUNK chunk are written in the unnecessary portion on the buffer memory 106 extracted in step 44, and the unnecessary portion generated in step S43 is set as the JUNK chunk.

In step S46, the cluster data in the buffer memory 106 is written back to the position extracted from the hard disk 107 in step S44 via the disk controller 105. These steps S44-S
By inserting a JUNK chunk as dummy data in the unnecessary area of the insertion destination file by the process of 46, A
The contradiction as a VI file is eliminated. Step S
In 47, the file size of the directory information of the insertion destination file and the update date / time information are updated, and the processing is ended.

In this way, FAT chain operation and JU
Since the insertion process is performed by inserting the NK chunk, the insertion process can be realized without causing a conflict on the file, the data copy operation can be reduced, and the faster insertion process can be performed. . Note that, for the JUNK chunk generated by the processing of FIG. 29 or FIG. 36, the processing of FIG.
You may perform the process which deletes a useless area further.

In the first embodiment, the case has been described in which the unused clusters of the number of clusters to which the frame to be inserted belongs are added to the insertion destination file in the insertion processing. It is also possible to add only the optimum unused cluster from the inner offset so that no useless JUNK area is created from the beginning.

[Movement Processing Operation] Finally, the movement processing operation will be described in detail. In FIG. 1, when a control command for moving a frame is input to the information editing control device 100 from an external device such as a PC or AV device 101, the external interface unit 103 causes a parameter of the moving command from the PC or AV device 101. Is received, and a move request including the parameter is output to the file editing means 104. Then, the file editing means 104
Starts the move process.

FIG. 37 is a diagram showing parameters associated with a control command requesting movement of frame data according to the first embodiment. As shown in FIG. 37, the parameters associated with the control command requesting the movement of the frame data include a movement command code indicating the movement request, a movement source file name indicating the file containing the movement frame data, and
The starting frame number indicating the starting frame position of the moving frame data, the moving frame number indicating the number of moving frames, the moving destination file name indicating the moving destination file, and the frame position where the moving frame data starts moving And the start frame number of the destination.

The operation when the file editing means 104 receives a move request will be described in detail with reference to FIGS. 38 to 45. FIG. 38 is a diagram showing a migration source file (file 1) and a migration destination file (file 2) so that a cluster and a frame image can be seen. Figure 38
As shown in FIG.
Up to 7 frames in the continuous area up to, and the destination file is composed of 5 frames in the continuous area up to clusters 30 to 38. The third frame to the third frame of the source file, that is, the fifth frame is the frame that is moved to the start position of the fourth frame of the destination file.

In FIG. 39, in order to perform the moving process as shown in FIG. 38, an unused cluster of three clusters is inserted after changing the FAT information, after the cluster having the movement start position of the movement destination file. It is a figure which shows an image, and shows an image when FAT information is corrected so that clusters 40 to 42 are inserted in order to insert three unused clusters between the cluster 34 and the cluster 35.

In FIG. 40, after the processing of FIG. 39 is performed, the half part of the frame head in the cluster having the move destination start position in the move destination file is the last cluster among the unused clusters added in FIG. To the end portion of the first cluster of the unused cluster added in FIG. 39,
FIG. 3 shows data from the beginning of the last cluster to which the movement end frame belongs in the movement source file to the end of the frame.
It is a figure which shows the image copied to the head part of the 2nd cluster of the unused cluster added in 9.

FIG. 41 is a diagram showing an image of a frame after the processing of FIG. 40 is performed. FIG. 42 shows data that completely falls within a cluster among the frame data that moves as shown in FIG. 41 (clusters 14 to 17).
FAT between the clusters (between clusters 40 and 41) between the data copied from the source to the destination in FIG.
It is a figure which shows the image of the movement source file and the movement destination file after correcting and moving information.

FIG. 43 shows an image in which unnecessary areas (existing in the clusters 13 and 18) as a frame generated in the file 1 in FIG. 42 are set as JUNK chunks to eliminate inconsistency as an AVI file, and generated in the file 2 in FIG. FIG. 6 is a diagram showing an image in which an area not present as a frame (existing in clusters 34, 40 and clusters 41, 42) is made into a JUNK chunk and an AVI file has no contradiction.

FIG. 44 shows the FAT occupied by the source file and destination file in each state from FIG. 38 to FIG.
It is a figure for demonstrating information. FIG. 45 is a flowchart showing the process of moving the designated file, which is performed by the file editing means 104 which has received the move request.

In step S51, the hard disk drive 1 sends the directory information and FAT information of the transfer destination file to be transferred, via the disk controller 105.
07, directory information and corresponding FAT
From the information, the cluster number and the offset within the cluster where the movement start position in the AVI file is located are extracted. Further, the directory information and FAT information of the migration source file to be migrated are retrieved from the hard disk 107 via the disk controller 105, and the directory information and the corresponding FAT information are used to identify the cluster number of the migration source start frame in the AVI file. Get the offset within a cluster. Then, an unused cluster for three clusters is inserted by changing the FAT information next to the cluster where the transfer destination start position of the transfer destination file is. For example, the file image is as shown in Fig. 39, and the FA at that time is
The T information has the values in the column of FIG. 39 shown in FIG.

In step S52, as shown in FIG. 40, the half part of the beginning of the frame in the cluster to which the move destination start position in the move destination file belongs is set to the end part of the last cluster of the unused cluster added in step S51. By copying, the frames of the destination file divided in step S51 are made continuous,
Eliminate frame division. In step S53,
As shown in FIG. 40, the data from the beginning of the movement start frame to the break of the cluster in the movement source file is copied to the end portion of the first cluster of the unused cluster added in step S51.

In step S54, as shown in FIG. 40, the data from the beginning of the last cluster to which the movement end frame belongs to the end of the frame data in the movement source file is added to the second cluster of the unused clusters added in step S51. Copy to the beginning of. The resulting file image is as shown in FIG. Step S
At 55, as shown in FIG. 41, among the frame data to be moved, the data completely contained in the cluster (clusters 14 to 17) is between the data copied from the source to the destination in FIG. 40. Between clusters (cluster 40
And 41)) by moving the FAT information. The file image at this time is as shown in FIG.
The AT information has the values in the column of FIG. 42 shown in FIG.

In step S56, as shown in FIG. 43, the ID and data size of the JUNK chunk are written in the unnecessary portion generated in the migration source file, and step S5
The unnecessary portion generated in 5 is set as a JUNK chunk. In step S57, as shown in FIG. 43, the I of the JUNK chunk is added to the two unnecessary parts generated in the destination file.
D and data size are written respectively, 2 JUNK
Make it a chunk. In step S58, the file size and update date / time information of the directory information of the transfer source file and the transfer destination file are updated, and the process ends.

In this way, FAT chain operation and JU
Since the move process is performed by inserting the NK chunk, the move process can be realized without causing a contradiction on the file, the data copy operation can be reduced, and a faster move process can be performed. . Note that for the JUNK chunk generated by the processing of FIG.
A process of further deleting a useless area may be performed by using the process of FIG. 20 or FIG.

In the first embodiment, the case where three unused clusters are inserted as described in step S51 has been described. However, in the processing of step S52 and the processing of step S54, the same cluster is If it is possible to copy the data, the unused clusters of only two clusters may be inserted in step S51 so that no useless JUNK area is created from the beginning.

In the above description of the move processing operation, next to the cluster where the move destination start position of the move destination file is,
Although the case of inserting the unused clusters of three clusters has been described, the moving process can be performed in the same manner by inserting the unused clusters of three clusters before the cluster having the movement start position. You can

As described above, according to the information editing control apparatus and the information editing method according to the first embodiment, the FAT operation is used for the editing processing such as the partial deletion processing, the insertion processing and the moving processing of the audiovisual data. As a result, it is possible to reduce the data copy operation involving read / write access to the hard disk, and it is possible to realize a faster editing process. Further, since the JUNK chunk is inserted in the unnecessary portion of the data, the editing process can be performed without causing a contradiction on the file.

Further, in the insertion processing and the movement processing, one frame may be divided by the FAT chain operation. However, the head portion or the end portion of the divided frame is added to the head or the trailing end of the remaining frame. By copying, it is possible to eliminate the division of the frame and maintain the consistency as the video / audio data.

In the first embodiment, an example in which a hard disk is used as a recording medium has been described. However, the present invention can be any recording medium as long as it is a randomly accessible recording medium with a logical sector as an access unit. Often,
For example, the same effect can be obtained by using a magneto-optical disk, a DVD-RAM, a semiconductor memory, or the like.

In the first embodiment, the case where the IDE interface is used as the connecting means between the disk control means 105 and the hard disk 107 has been described, but the connecting means may be an interface means capable of transferring a digital signal. For example, a SCSI interface may be used, and the interface is not limited to the IDE interface.

Further, although the case where the data of the AVI format is used as the video / audio data has been described in the first embodiment, the present invention is not limited to the data of the AVI format, and the same area as the JUNK chunk is used. Data that can be used or a format having position information of each frame instead of the JUNK chunk may be used as the audiovisual data. Further, the file editing means 104 that performs the editing process may be configured by software controlled by a program, or may be configured by hardware.

(Second Embodiment) A disk device according to a second embodiment of the present invention will be described below with reference to the drawings. FIG. 46 is a block diagram showing the configuration of the disk device according to the second embodiment of the present invention. The disk device 120 according to the second embodiment has the function of the information editing control device 100 according to the first embodiment, and each means included in the information editing control device 100 according to the first embodiment is built in the disk device 120. ing. Note that FIG.
In the disk device 120 according to the second embodiment shown in FIG. 2, components having the same functions and configurations as those of the first embodiment shown in FIG.

In FIG. 46, the magnetic disk 110 is
It is a recording medium used in the disk device 120. The magnetic head 111 writes and reads digital signals to and from the magnetic disk 110. Here, in the first embodiment, the disk control unit 105 that performs the data recording / reproducing operation on the hard disk via the IDE interface writes the digital signal to the magnetic disk 110 via the magnetic head 111 in the second embodiment. And read control. Further, regarding the operation of the disk device according to the second embodiment, the information editing control device 10 according to the first embodiment is also used.
Since the operation is the same as that of 0, the description thereof is omitted.

As described above, the disk device according to the second embodiment is configured to include the information edit control device according to the first embodiment, and has the functions of the information edit control device 100 according to the first embodiment as an electrical / electrical function. Since it can be mounted in an electronic circuit, as described in the first embodiment,
As compared with the case where the disk control device 100 and the hard disk 107 are used separately, it is possible to reduce the cost and size of the disk device for editing the audiovisual data. In the second embodiment, description has been made regarding the configuration in which the audio / video data is written or read to / from the magnetic disk 110 as a recording medium. However, a random access such as a magneto-optical disk or a DVD-RAM is used as a recording medium. The same effect can be obtained by using a recording medium having a function.

[0121]

As is apparent from the above description, according to the information editing control device and the information editing method of the present invention,
Since the editing process such as the partial deletion process, the insertion process, and the moving process of the video / audio data is realized by using the file system for managing the video / audio data, the read / write access to the randomly accessible recording medium is involved. Data copy operations can be reduced, and faster editing processing can be realized.

Further, in the editing process, since the dummy data is inserted in the unnecessary portion of the data, the editing process using the file system can be performed without causing a contradiction on the file.

Further, in the inserting process and the moving process, one frame may be divided by inserting an unused cluster on the file system, but the first part or the end part of the divided frame is divided into the remaining parts. By copying at the beginning or the end of the frame, it is possible to eliminate the division of the frame and maintain the consistency as the video / audio data.

Further, according to the disk device of the present invention, the information editing control device is provided.
The same effects as those of the information editing control device can be obtained, and the function of the information editing control device
Since it can be mounted in an electronic circuit, the cost and size of the disk device for editing audio / video data can be reduced as compared with the case where the information editing control device and the recording medium are used separately. It becomes possible.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an information editing control device according to a first embodiment of the present invention.

FIG. 2 is a diagram showing a data area structure of the disk device according to the first embodiment of the present invention.

FIG. 3 is a diagram showing a structure of a directory / file management information table according to the first embodiment of the present invention.

FIG. 4 is a diagram showing a relationship between FAT and clusters.

FIG. 5 is a diagram for explaining the structure of a RIFF file format.

FIG. 6 is a diagram for explaining the structure of an AVI file format.

FIG. 7 is a diagram showing parameters associated with a control command requesting partial deletion according to the first embodiment of the present invention.

FIG. 8 is a diagram showing a file to be partially deleted according to the first embodiment of the present invention together with a cluster and a frame image.

FIG. 9 is a diagram showing files in which unnecessary clusters are deleted according to the first embodiment of the present invention together with clusters and frame images.

FIG. 10 is an unnecessary portion JU according to the first embodiment of the present invention.
It is a figure which shows the file made into NK chunk with a cluster and a frame image.

FIG. 11 is a diagram for explaining FAT information regarding a file in each state of FIGS. 8 to 10;

FIG. 12 is a diagram showing the structure of a JUNK chunk in an AVI file.

FIG. 13 is a flowchart showing a partial deletion process performed by the file editing means according to the first embodiment of the present invention.

FIG. 14 is a diagram showing a file having a JUNK chunk between frames together with clusters and frame images after the partial deletion processing according to the first embodiment of the present invention.

FIG. 15 is a diagram for explaining an unnecessary cluster deletion procedure according to the first embodiment of the present invention.

FIG. 16 is a diagram showing a file after deleting an unnecessary cluster according to the first embodiment of the present invention together with a frame image of the cluster.

FIG. 17 is a diagram for explaining a procedure for deleting unnecessary clusters according to the first embodiment of the present invention.

FIG. 18 is a diagram showing a file after deleting unnecessary clusters together with a frame image of clusters according to the first embodiment of the present invention.

FIG. 19 is a diagram for explaining FAT information regarding a file in each state of FIGS. 14 to 18;

FIG. 20 is a flowchart showing a process of further deleting an unnecessary area according to the first embodiment of the present invention.

FIG. 21 is a flowchart showing a process of further deleting an unnecessary area according to the first embodiment of the present invention.

FIG. 22 is a diagram showing parameters associated with a control command requesting insertion of frame data according to the first embodiment of the present invention.

FIG. 23 is a diagram showing an insertion source file and an insertion destination file together with clusters and frame images according to the first embodiment of the present invention.

FIG. 24 is a diagram showing, together with clusters and frame images, an insertion destination file in which an unused cluster is inserted next to a cluster having an insertion start position according to the first embodiment of the present invention.

FIG. 25 is a diagram showing an insertion destination file together with clusters and frame images according to the first embodiment of the present invention.

FIG. 26 is a diagram showing a copied insertion destination file of the insertion source file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 27 is an unnecessary portion JU according to the first embodiment of the present invention.
It is a figure which shows the insertion destination file made into NK chunk with a cluster and a frame image.

FIG. 28 is a diagram for explaining FAT information regarding an insertion destination file in each state of FIGS. 23 to 27.

FIG. 29 is a flowchart showing an inserting process performed by the file editing means according to the first embodiment of the present invention.

FIG. 30 is a diagram showing an insertion source file and an insertion destination file together with clusters and frame images according to the first embodiment of the present invention.

FIG. 31 is a diagram showing, together with a cluster and a frame image, an insertion destination file in which an unused cluster has been inserted before a cluster having an insertion start position according to the first embodiment of the present invention.

FIG. 32 is a diagram showing an insertion destination file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 33 is a diagram showing the insertion-destination file after the insertion-source file has been copied, together with clusters and frame images according to the first embodiment of the present invention.

FIG. 34 is an unnecessary portion JU according to the first embodiment of the present invention.
It is a figure which shows the insertion destination file made into NK chunk with a cluster and a frame image.

[Fig. 35] Fig. 35 is a diagram for describing FAT information regarding an insertion destination file in each state of Figs. 30 to 34.

FIG. 36 is a flowchart showing an inserting process performed by the file editing means according to the first embodiment of the present invention.

FIG. 37 is a diagram showing parameters associated with a control command requesting movement of frame data according to the first embodiment of the present invention.

FIG. 38 is a diagram showing a migration source file and a migration destination file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 39 is a diagram showing a migration destination file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 40 is a diagram showing a migration source file and a migration destination file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 41 is a diagram showing a migration source file and a migration destination file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 42 is a diagram showing a migration source file and a migration destination file according to the first embodiment of the present invention together with clusters and frame images.

FIG. 43 is an unnecessary portion JU according to the first embodiment of the present invention.
It is a figure which shows the moving origin file and moving destination file which were made into NK chunk with a cluster and a frame image.

[Fig. 44] Fig. 44 is a diagram for describing FAT information regarding an insertion source file and an insertion destination file in each state of Figs. 38 to 43.

FIG. 45 is a flowchart showing a moving process performed by the file editing means according to the first embodiment of the present invention.

FIG. 46 is a block diagram showing a configuration of a disk device according to the second embodiment of the present invention.

FIG. 47 is a diagram for explaining a conventional partial deletion process.

FIG. 48 is a diagram for explaining conventional insertion processing.

FIG. 49 is a diagram for explaining a conventional movement process.

[Explanation of symbols]

100 information editing control device 101 PC or AV equipment 102 interface bus 103 external interface means 104 file editing means 105 disk control means 106 buffer memory 107 hard disk 110 magnetic disk 111 magnetic head 120 disk unit

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁷ Identification code FI theme code (reference) G11B 27/00 H04N 5/91 N 27/034 5/781 510C H04N 5/765 510D 5/781 510E 5 / 92 510F 5/937 510L 5/92 H 5/93 C 5/91 L G11B 27/02 K F term (reference) 5C053 FA14 FA23 GB06 GB11 HA33 JA01 JA16 JA21 KA04 LA11 5D044 AB05 AB07 BC01 BC06 CC04 DE03 DE12 DE92 DE96 5D110 AA13 AA19 AA27 AA29 CA05 CA06 CA33 CA42 CF04 DA11 DA12

Claims (15)

[Claims] 1. An information editing control device for editing video / audio data composed of frame units recorded on a randomly accessible recording medium, wherein the data reading / writing is performed on the recording medium according to a received read / write request. Recording medium control means for performing, and a file editing means for editing the file of the audiovisual data recorded in the recording medium by sending a read / write request to the recording medium control means, the file editing means An information editing control device, characterized in that the video / audio data is edited using a file system for managing the video / audio data. 2. The information editing control device according to claim 1, wherein the file editing unit deletes a cluster including only a frame to be partially deleted on the file system, and is a data area to be deleted in one cluster. An information editing control device, wherein dummy data is inserted into the unnecessary area when an area and an effective area which is a data area that is not deleted are included. 3. The information editing control device according to claim 1, wherein the file editing means inserts an unused cluster of data to be inserted into a file of audio / video data of an insertion destination on a file system, When the frame is divided by the insertion, the division is canceled, the data to be inserted is inserted into the unused cluster area, and the dummy data is inserted into the unnecessary area of the file. apparatus. 4. The information editing control device according to claim 1, wherein the file editing means inserts a predetermined unused cluster into a file of the moving image / audio data on the file system, and by the insertion, When the frame is divided, the division is canceled, the data of the cluster including a part of the moving audiovisual data frame is copied to the unused cluster area, and the cluster including only the moving frame is set on the file system. The information editing control device, wherein the dummy data is inserted into unnecessary areas in the source file and the destination file. 5. The information editing control device according to claim 2, wherein the file editing means is configured to insert dummy data of one cluster or more into adjacent clusters of the audiovisual data. An information editing control device characterized by moving data in an effective area and deleting a cluster that includes only an unnecessary area on a file system. 6. The information editing control device according to claim 1, wherein the randomly accessible recording medium is a magnetic disk. 7. The information editing control device according to claim 1, wherein the randomly accessible recording medium is a magneto-optical disk. 8. An information editing method for editing video / audio data, which is recorded in a randomly accessible recording medium and is configured in frame units, wherein the video is recorded using a file system for managing the video / audio data. An information editing method characterized by editing audio data. 9. The information editing method according to claim 8, wherein a cluster including only frames to be partially deleted is deleted on the file system, and an unnecessary area and an undeleted data area are deleted in one cluster. And a step of inserting dummy data in the unnecessary area when the effective area, which is an area, is included. 10. The information editing method according to claim 8, further comprising the step of inserting an unused cluster for the data to be inserted into the file of the audiovisual data of the insertion destination on the file system; When the data is divided, a step of eliminating the division by moving the data of the divided frame, a step of inserting the data to be inserted into the unused cluster area, and a dummy data in an unnecessary area of the file And a step of inserting the information editing method. 11. The information editing method according to claim 8, wherein a step of inserting a predetermined unused cluster into a file of the moving image / audio data on the file system, and the frame is divided by the insertion. In this case, the step of eliminating the division by moving the data of the divided frame, and the step of copying the data of the cluster partially including the frame of the moving audiovisual data to the unused cluster area, And a step of moving a cluster including only moving frames on a file system, and a step of inserting dummy data into unnecessary areas in a source file and a destination file. . 12. The information editing method according to claim 9, wherein the data in the effective area is moved when one cluster or more of dummy data is inserted in adjacent clusters of the video / audio data. The information editing method further comprises the step of deleting, on the file system, the cluster that includes only the unnecessary area. 13. The information editing method according to claim 8, wherein the randomly accessible recording medium is a magnetic disk. 14. The information editing method according to claim 8, wherein the randomly accessible recording medium is a magneto-optical disk. 15. A disk device comprising the information edit control device according to claim 1. Description: