JP3524774B2 - Information recording / reproducing device - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information recording / reproducing apparatus for recording / reproducing information using a semiconductor memory as a recording medium.

[0002]

2. Description of the Related Art In recent years, with the miniaturization of information equipment, a large-capacity semiconductor memory has attracted attention as a recording medium.
Among them, a batch erasable memory such as a flash memory that does not require a backup power supply and can have a large capacity is being used as a recording medium of information equipment.

In information equipment, usually, management information for managing data is recorded in a program management table, and a packet consisting of main information which is actual data and auxiliary information which is various information relating to the main information is formed. It is recorded on a recording medium. The management information includes a program name, a recording format, and the like, as well as a link address to the first packet of the program.

Next, recording of audio data will be described. The audio data recording method includes an analog recording method used when recording on an audio tape and the like, and a digital recording method used when recording on a CD (compact disc), an MD (mini disc) and the like.

In the digital recording method, the recording unit is digital data of "0" and "1". Further, in the digital recording method, data compression is performed in order to improve recording efficiency. Data compression is a compression process in which a series of digital data is divided into a data group having a predetermined data amount, and the data group obtained by the division is compressed.
It means error correction and error detection code processing for data reliability confirmation. In this way, individual data groups that have been streamlined by being compressed are called sound frames. The audio data is managed in units of sound frames.

A packet is composed of main information consisting of one sound frame and auxiliary information related to this main information. The auxiliary information is a used / unused flag indicating use / unuse of the packet, whether the packet is the last packet (whether the main information of the packet is the last sound frame of a series of data). It is composed of a status including a final packet flag indicating that, and a link address indicating the connection of packets.

A song is a collection of a plurality of packets,
Each packet is linked by the link address in the auxiliary information. In the last packet of the series of data, the last packet flag in the auxiliary information is 1.

When recording audio data, in the first conventional example, each time one sound frame is completed,
It is necessary to search the packet area (area where one packet is written) in the memory to find an unused packet area whose used / unused flag is 0 (indicating that data is not written). It was

On the other hand, in the second conventional example, a free packet area management table in which only used / unused flags of each packet area are collected and stored is provided so that one sound is recorded when audio data is recorded. Every time a frame is completed, an unused packet area is found based on the above-mentioned empty packet area management table.

[0010]

Normally, a microcomputer (hereinafter, abbreviated as "microcomputer") searches for an unused packet area. However, the amount of data that can be processed at one time by the microcomputer is determined by the data bus of the microcomputer. 8
It is in units of bits or 16 bits. The microcomputer takes time to access the external memory, compared to accessing the internal memory. Further, the memory capacity of the memory built in the microcomputer is as small as several kilobytes.

Therefore, in the first conventional example, the external memory is accessed in 8-bit units, and it is sequentially determined whether the used / unused flag of each packet area is 1 or 0. It takes time to find the packet area used.

Further, in the second conventional example, a used / unused flag is provided in each packet area in the memory, and the used / unused flag is collected in one place to manage the unused packet area. By accessing the free packet area management table in 8-bit units, it is possible to determine at a time whether the used / unused flags of the eight packet areas are 1 or 0. The time required to find an unused packet area is reduced.

However, in the second conventional example, it is necessary to increase the storage capacity of the empty packet area management table as the storage capacity of the memory increases. Further, the storage capacity of the free packet area management table requires 32000 bits (about 4 kbytes) when the memory capacity is 16 Mbytes and one packet is 512 bytes.
Since the storage capacity of the empty packet area management table becomes large in this way, it was not possible to store the empty packet area management table in the memory built in the microcomputer.

Furthermore, in both the first and second conventional examples, data is written in ascending order (or descending order) from the packet area of the lowest (or highest) address, so the lowest (or highest). Since the data is written more frequently as the address of, the life of the memory having a limited number of writing is shortened.

In addition, when a series of data such as voice is recorded, since the voice data is written at consecutive addresses in the memory, it becomes impossible to reproduce the missing data due to noise, memory failure, or the like. .

Therefore, according to the present invention, a free packet area management table having a smaller storage capacity can be stored in the memory without increasing the storage capacity of the free packet area management table as the storage capacity of the memory increases. A first object of the present invention is to provide an information recording / reproducing apparatus capable of managing the use / non-use of each packet area.

A second object of the present invention is to provide an information recording / reproducing apparatus capable of extending the life of a memory having a limited number of times of writing.

A third object of the present invention is to provide an information recording / reproducing apparatus capable of reproducing lost data due to noise, memory failure, etc.

[0019]

In order to achieve the above object, according to the invention of claim 1, in an information recording / reproducing apparatus for recording and reproducing information using a semiconductor memory as a recording medium, a storage area of the semiconductor memory Is divided into a plurality of blocks, each block is divided into a plurality of packet areas, and each packet area in each block is associated with one packet area in another block. In addition, a free packet area management table that records information indicating whether or not data is written in the packet areas in all the blocks for each packet area corresponding to each block, and the correspondence between each block
The first half block consisting of a predetermined block for each packet area
Data is written in all packet areas in the network
Free packet area auxiliary data that records information indicating whether or not
I have a bull and a bull .

If each block is divided into n packet areas with the above configuration, for example, the state where all the corresponding packet areas are used (data is written) is 1, while the corresponding one is If there is an unused packet area (data is not written) in each packet area, the unused packet area can be managed with an n-bit storage capacity.

[0021]

Further , since it is possible to know whether or not all the corresponding packet areas of the first half block are used by the free packet area management auxiliary table, when all the corresponding blocks of the first half block are used. If the unused packet area is searched from the corresponding packet area of the second half block including the blocks other than the first half block, the unused packet area can be found faster.

[0023]

[0024]

[0025]

[0026]

According to the second aspect of the invention, a semiconductor is used.
Information recording for recording and reproducing information using a memory as a recording medium
In the recording / reproducing apparatus, the storage area of the semiconductor memory is duplicated.
Is divided into a number of blocks, and each block is
Is divided into multiple packet areas, and each block is
Each packet area in the
It is associated with the packet area.
For each packet area corresponding to
Information indicating whether or not data is written in the
It has an empty packet area management table in which information is recorded and an empty packet area individual management table in which information indicating whether or not data is written in each block is stored for each corresponding packet area between the blocks.

With the above configuration, if the unused packet area is found based on the empty packet area management table and the empty packet area individual management table, the storage capacity is slightly increased as compared with the conventional case. However, the time required to find an unused packet area can be significantly reduced.

[0029]

[0030]

According to the third aspect of the invention, the semiconductor
Information recording for recording and reproducing information using a memory as a recording medium
In the recording / reproducing apparatus, the storage area of the semiconductor memory is duplicated.
Is divided into a number of blocks, and each block is
Is divided into multiple packet areas, and each block is
Each packet area in the
It is associated with the packet area.
For each packet area corresponding to
Information indicating whether or not data is written in the
And free packet area management table recording broadcast, has a random number generating means for generating a random number by searching the empty packet region management table in accordance with a random number random number generating means generates, have data written A corresponding packet area is found between each block in which there is a packet area that does not exist.

With the above configuration, it is possible to randomly search the corresponding packet area between each block for an unused packet area, and average the number of accesses for each corresponding packet area between each block. Can be converted.

[0033]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram of an audio recording / reproducing apparatus according to an embodiment of the present invention.
In the figure, reference numeral 1 denotes a semiconductor memory such as a flash, an SRAM, a DRAM, etc., which is used as a data storage means. Reference numeral 2 denotes a key input means which is a user interface for the user to select a function.
A Y key, a DEL key, a REC key, a STOP key and the like are provided.

Reference numeral 3 is a display means for displaying the operating state of the apparatus, and is a user interface provided so that the user can visually recognize the operating state of the apparatus. Reference numeral 4 is a data input / output means. The input means includes a microphone input, an analog line input, a digital data input, and the like, and the output means includes a speaker output, a line output (analog, digital), and the like.

Reference numeral 5 denotes a control circuit composed of a single microcomputer or a plurality of microcomputers, and performs display control such as setting of display data on the display means 3 according to a signal input from the key input means 2 and data input / output. Input / output control of data via the output means 4, read / write control of data with respect to the memory 1 and the like are performed. The control circuit 5 has a working memory 6 built therein.

The flow of recording audio data on a recording medium will be described. After converting the audio data from analog data to digital data, the digital data is subjected to data compression processing or the like for memory efficiency, and recorded on a recording medium. Even when the digital data is directly input, the data is compressed and then recorded on the recording medium.

Here, the data compression processing and the like mean that a series of digital data is divided into a data group having a predetermined data amount, the compression processing is applied to each data group obtained by the division, and the reliability of the data. It means error correction and error detection code processing for confirmation. In addition, individual data groups that have been subjected to compression processing are called sound frames.

The audio data is managed and recorded in sound frame units. The packet is, as shown in FIG. 2, main information M consisting of one sound frame (509 bytes), and 3 regarding this main information M.
It is composed of bytes of auxiliary information S, and one packet has 512 bytes. The auxiliary information S includes a used / unused flag F1 indicating whether the packet is used / unused, whether the packet is the last packet (whether the main information of the packet is the last sound frame of a series of data, or not). 1 including a final packet flag F2 indicating
It is composed of a byte status St and a 2-byte link address L indicating the connection of packets.

When the audio data is recorded, music information for managing the recorded audio data is recorded in the music management table K as shown in FIG. The music information is composed of a music title, a music format, and link information to a head packet (packet having a head sound frame of the music). The song format includes a sampling frequency and a compression format.

During playback, as indicated by the arrow in FIG.
The link information in the song information stored in the song management table K is used to search the first packet, the link information of the first packet is used to search the next packet, and so on. A series of data (songs) is reproduced by tracing.

In the audio recording / reproducing apparatus of this embodiment, when the user presses the REC key provided in the key input means 2, the audio data input to the data input / output means 4 becomes A / The data is D-converted into digital data and input to the control circuit 5.

In the control circuit 5, the input data is time-sequentially subjected to data compression processing and the like, and is converted into data of a constant size (sound frame) at constant time intervals. Further, the control circuit 5 searches the memory 1 based on the empty packet area management table and records the packets in the unused areas.

Here, the memory 1 is, as shown in FIG.
0 block B ₀ , 1 block B ₁ , 2 block B ₂ , ...
It is divided into 125 blocks consisting of 124 blocks B ₁₂₄ , and each block stores 0 packet area P ₀ , 1 packet area P ₁ , 2 packet area P ₂ , ..., 255 packet area P. _It has ₂₅₅ packets and can store 256 packets.

The empty packet area management table T1
Is part of the area of the memory 6 incorporated in the microcomputer constituting the control circuit 5, as shown in FIG. 4, b1 _0, b
It has a storage capacity of 256 bits consisting of 1 ₁ , b1 ₂ , ..., B1 ₂₅₅ . Free packet area management table T1
If all the used / unused flags of the packet stored in the k packet area P _k of each block in the memory 1 are 1 in each bit b1 _k (k = 0 to 255) of if it is all the k packet area P _k used, 1 is recorded, whereas, if there is a block to use / unused flag in the packet that contains the k packets region P _k is 0, i.e. , K packet area P _k
If there is a block that is not used, 0 is recorded.

FIG. 5 shows the flow when the control circuit 5 searches the memory 1 based on the empty packet area management table T1 and records the packet in the unused area.
This will be described with reference to the flowchart shown in. Control circuit 5
First, 0 is set to k and h as an initial setting (# 10). Next, the empty packet area management table T1
It is determined whether or not the bit b1 _k of 0 is 0 (# 2
0).

As a result of the determination in # 20, the bit b1 _k is 0.
If so (Y of # 20), the process proceeds to # 30. On the other hand, if bit b1 _k is not 0 (N of # 20), k + 1 is set to k + 1 (# 40), and then k is 256. It is determined whether or not there is (# 50), and if k is 256 (Y of # 50), the process is terminated because the memory is full, while k
Is not 256 (N in # 50), the process returns to # 20.

In # 30, it is determined whether the used / unused flag of the k packet area P _k of the h block B _h is 0. If the result of determination in # 30 is that the used / unused flag is 0 (Y in # 30), the used / unused flag is set to 1 in the k packet area P _k of the h block B _h , and the sound frame Is written (# 60). On the other hand, if the used / unused flag is not 0 as a result of the determination in # 30 (#
30 N), and shifts to # 70 described later.

After # 60, it is judged whether or not the recording is completed (# 80), and if the recording is completed (Y of # 80), the last of the k packet area P _k of the h block B _h. The packet flag is set to 1 (# 90), and the process ends. On the other hand, if recording is not completed (N of # 80), h + 1 is added to h + 1.
Is set (# 70), and then it is determined whether h is 125 (# 100).

If h is 125 as a result of the determination in # 100 (Y of # 100), h is set to 0 (# 110) and 1 is written to bit b1 _k of the empty packet management table T1 ( # 120), and then the process proceeds to # 40. On the other hand, as a result of the determination in # 100, h is 125
If not (N of # 100), the process proceeds to # 30.

In summary, the control circuit 5 creates an empty packet area management table T every time a sound frame is created.
Bits ₀ are searched in ascending order from the least significant bit b1 _{0 in} 1. Next, if b1 _k is obtained as a bit of 0 in the empty packet area management table T1, the bit 0 of bit b1 _k found in the empty packet area management table T1 is searched in ascending order from the lowest 0 block B _0. A block in which the used / unused flag of the corresponding k packet area P _k is 0 is searched. Then, as a block in which the used / unused flag of the k packet area P _k is 0, h
When the block B _h is obtained, the sound frame is written with the used / unused flag set to 1 in the k packet area P _k of the h block B _h .

However, the empty packet area management table T1
If there is no bit of 0, it means that all the areas in the memory 1 are used, so recording is not performed. In this case, the display unit 3 may display that all areas in the memory 1 are used and cannot be recorded.

The empty packet area management table T1
If there is no packet area in which the used / unused flag is 0 in the packet area corresponding to the 0 bit found by searching the inside of the empty packet area management table T1 Write a 1 to the 0 bit.

Although not shown in the flow chart shown in FIG. 5, in the case of the sound frame at the beginning of the music, the link information in the music management table is stored in the memory 1 of the packet area in which the sound frame is written as link information. Write the address (hereinafter referred to as "packet number"),
In the case of the second and subsequent sound frames, the packet number in which the sound frame is written is written as the link address L in the packet area in which the previous sound frame is written.

In this way, unused packet areas are found in the memory 1 and individual sound frames are dispersedly recorded in the memory 1 while linking each. Therefore, even if a part of the packet is lost due to a memory failure or the like, it is possible to reproduce the lost packet by complementing or averaging the previous and next packets.

Further, the unused packet area of the memory is managed by the free packet area management table T1 having a storage capacity of the number of bits corresponding to the number of packet areas in each block, so that the storage capacity is small. Memory 1
The unused packet area can be managed. Moreover, since the storage capacity is small, the empty packet area management table T1 can be stored in the internal memory 6 of the microcomputer, and an unused packet area can be searched at high speed.

Further, even if the storage capacity of the memory 1 is increased, if the number of blocks is increased instead of increasing the number of packet areas in one block, the storage capacity of the empty packet area management table T1 is increased. The unused packet area can be managed without increasing the size.

When the PLAY key provided on the key input means 2 is pressed by the user, the control circuit 5 searches the head packet of the music selected from the music information management table based on the link information, and the final packet flag. The link information of the packet is traced one after another until the packet having 1 is reached. Then, the sound frame of the first packet is sequentially expanded and transmitted to the data input / output means 4 at a constant interval. In the data input / output means 4, the decompressed data sent from the control circuit 5 is converted into analog data and output, and reproduced as voice.

When the DEL key provided on the key input means 2 is pressed by the user, the control circuit 5 searches for the head packet of the music selected from the music information management table based on the link information, and the packet of each packet is searched. Set the used / unused flag to 0
However, the link information of the packets is traced one after another until the packet having the final packet flag of 1 is reached. Note that the main information (sound frame) is not erased in order to save processing time. Also,
0 is written in the bit in the empty packet area management table T1 corresponding to the packet area in which the erased packet was recorded.

In the above embodiment, the packet area, which is the minimum area for determining use / unuse, is the area for storing one packet, but the area for storing a plurality of packets may be the packet area. By doing so, the packet area existing in one block is reduced, and the storage capacity of the empty packet area management table T1 can be reduced.

An audio recording / reproducing apparatus according to the second embodiment of the present invention will be described. In the second embodiment,
In addition to the first embodiment described above, a free packet area management auxiliary table T2 is provided in the built-in memory 6 of the microcomputer that constitutes the control circuit 5. As shown in FIG. 6, the empty packet area management auxiliary table T2 has a storage capacity of 256 bits like the empty packet area management table T1, and each bit b2 _k ( In k = 0 to 255), 1 is recorded if the k packet area P _k of the first half block consisting of 0 block B ₀ to 62 blocks B ₆₂ of the memory 1 is all used, while 1 is recorded in the first half block. If there is a block in which the k packet area P _k is not used, 0 is recorded.

When performing recording, the control circuit 5 first
Bits ₀ are searched in ascending order from the least significant bit b1 ₀ in the empty packet area management table T1. As a result of this search, if bit b1 _k is found as a bit of 0, then bit b2 in free packet area management auxiliary table T2 corresponding to bit b1 _k of 0 in found free packet area management table T1 is found. It is determined whether _k is 0 or not. If the bit b2k is 0, there must be an unused one in the corresponding k packet area P _k of the first half block in the memory 1, so the k packet area P _k
Among them, those with the used / unused flag set to 0 are searched in ascending order from the 0 block B ₀ to find an empty packet area.

On the other hand, if the bit b2 _k in the free packet area management auxiliary table T2 corresponding to the bit b1 _k of 0 in the found free packet area management table is not 0, it corresponds to the first half block in the memory 1. Since all k packet areas P _k are used, the one in which the used / unused flag is 0 in the k packet area P _k is the first block of the second half block (block other than the first half block) 63. The unused packet area is found by searching in ascending order from the block B ₆₃ .

Then, a sound frame is written in the found unused packet area with the used / unused flag set to 1, but the packet area in which the sound frame is written is the k packet area P _k in the h block B _h . Then, when the bit b2 _k in the free packet area management auxiliary table T2 corresponding to the k packet area P _k is 0 and h is 63 or more, that is, a sound frame is set in the packet area in the latter half block. If written, 1 is written in the bit b2 _k in the free packet area management auxiliary table T2.

When erasing, if the packet area with the used / unused flag set to 0 is the k packet area P _k in the h block, the empty packet area management corresponding to the k packet area P _k When bit b2 _k in the auxiliary table T2 is 1, and h is 62 or less, that is, when the used / unused flag of the packet area in the first half block is set to 0, the empty packet area management auxiliary table Write 0 to bit b2 _k in T2.

As described above, the empty packet area management auxiliary table T2 in which the information indicating whether or not there is an unused packet area is provided for each corresponding packet area in the first half block is provided. As compared with the first embodiment, it is possible to shorten the time required to find an empty packet area.

Further, it is also possible to record in the empty packet area management auxiliary table T2 the data indicating up to what number of blocks in the corresponding packet area is used. Specifically, as shown in FIG. 7, the empty packet area management auxiliary table T2 is divided into 256 areas R ₀ , R ₁ , R ₂ , ..., R ₂₅₅ , and how many blocks are included in each corresponding packet area. Whether or not the packet area is used is written in the area of the corresponding empty packet area auxiliary table T2. For example, for the k packet area P _k , if up to h blocks B _{h are} used, h is written in the area R _k of the free packet area management auxiliary table T2.

In this case, since the memory 1 is divided into 125 blocks in this embodiment, the number of the packet area used for each corresponding packet area is recorded. In order to do so, each area R of the empty packet area management auxiliary table T2
A storage capacity of 7 bits is required for ₀ , R ₁ , R ₂ , ..., R ₂₅₅ , and a storage capacity of 7 × 256 = 1792 bits is required for the entire free packet area management auxiliary table T2.

When recording, a sound frame is written in the found unused packet area with the used / unused flag set to 1, but the packet area in which the last sound frame is written is the k packet area of h block B _h. When P _k is set, h is written in the area R _k of the empty packet area auxiliary table T2 corresponding to the k packet area P _k .

When erasing, if the packet area in which the first sound frame of the music to be erased is written is k packet area P _k of h block B _h , then k
(H-1) is written in the area R _k of the free packet area auxiliary table T2 corresponding to the packet area P _k .

The empty packet area management table T1
In each bit b1 _k in the table, the value written in the corresponding area R _k in the free packet area management auxiliary table T2 is 2
When it is 55, 1 is written, while when it is not 255, 0 is written.

By providing such an empty packet area management auxiliary table T2, the 0 bit of the empty packet area management table T1 is found, and the empty packet area management auxiliary table corresponding to the 0 bit of the empty packet area management table. By looking at the area in T2, the empty packet area can be found immediately, so the time until finding the empty packet area can be further shortened.

The audio recording / reproducing apparatus according to the third embodiment of the present invention will be described. In the third embodiment,
In addition to the first embodiment, as shown in FIG. 8, 125 bits b3 ₀ , b3 ₁ , which are the number of blocks of the memory ₁ ,
256 empty packet area individual management tables T3 ₀ , T3 ₁ , T3 ₂ , respectively having b3 ₂ , ..., B3 ₁₂₄
… T3 ₂₅₅ is provided. Bit b3 _h (h of each empty packet area individual management table T3 _k (k = 0 to 255)
= 0 to 124), 1 is recorded if the k packet area P _k of the h block B _h is used, while if the k packet area P _k of the h block B _h is not used,
0 is recorded.

Then, the empty packet area management table T
1 is recorded in the bit b1 _k of 1 if all the bits in the empty packet area individual management table T3 _k are 1, while if there are 0 bits in the empty packet area individual management table T3 _k . , 0 is recorded.

Therefore, during recording, the control circuit 5
First, if the bit 0 of 0 is searched from the empty packet area management table T1 and the bit b1 _k is obtained as the bit of ₀ , the bit b3 _{0 is} stored in the empty packet area individual management table T3 _k corresponding to the bit b1 _k. From 0 to 0 are searched in ascending order. Then, as a bit of 0, b
If 3 _h is obtained, the sound frame is written with the used / unused flag set to 1 in the packet area P _k of the h block B _h .

Then, the sound frame is written h
Bit b3 _h of free packet space separate management table T3 _k corresponding to the packet region P _k of the blocks B _h to 1, further Thereby, the free packet area separate management table T3 _k including bit b3 _h you this 1 If all the bits are 1, the empty packet area individual management table T
The bit b1 _k of the empty packet area management table T1 corresponding to 3 _k is set to 1.

When erasing is performed, the h block B _h
If the used / unused flag of the packet area P _k in the inside is set to 0, the bit b _h of the corresponding empty packet area individual management table T3 _k is set to 0, and at this time, the empty packet area individual management table T3 _k If the bit b1 _k in the free packet area management table T1 corresponding to the above is 1, the bit b1 _{k is set} to 0.

In the second conventional example described above, since the used / unused flags of each packet are only collected in one place, the used / unused flags of the lowest (or highest) packet are calculated first. Since the search is performed in ascending order (or descending order), if the memory 1 has the same capacity,
When searching in 8-bit units, access may be required up to 4000 times at maximum.

On the other hand, in the third embodiment, the empty packet area management table T1 is used to find an empty packet area individual management table in which 0 bits are present, and then the empty packet area individual management table is set to 0. Since the number of bits in the individual empty packet area management table is 125, the number of bits in the individual empty packet area management table is 125. It is possible to find an unused packet area by accessing 16 times.

As described above, as compared with the second conventional example, the memory capacity for the empty packet area management table T1 is slightly increased (in this embodiment, the capacity is increased by 256 bits).
Thus, the time required to find an unused packet area is significantly reduced.

An audio recording / playback apparatus according to the fourth embodiment of the present invention will be described. In addition to the first embodiment, the fourth embodiment has an access count management table T4 as shown in FIG. The access count management table T4 includes 256 areas S ₀ , S ₁ , S ₂ ,
, S ₂₅₅ , and the number of times the packet area P _k in the memory 1 is accessed is recorded in each area S _k .

When recording, the control circuit 5 performs the empty packet area management table T as in the first embodiment.
By referring to 1, an unused packet area is found and a packet is recorded while linking the packet to the packet area. However, when searching for a 0 bit in the empty packet area management table T1, the least significant bit is searched. b
1 ₀ rather than searching in ascending order, before referring to the free packet area management table T1, by referring to the access frequency management table T4, leave grasp the number of accesses to each packet region, the number of accesses The 0 bits are searched in order from the bit in the empty packet area management table T1 corresponding to the smallest packet area. If there are packet areas having the same access count, the lower bits in the packet area management table T1 corresponding to those packet areas are searched.

Then, k in all blocks of the memory 1
When the packet area P _k is in the used state, the value stored in the area S _k of the access count management table T4 is incremented by 1 to access the access count management table T4 to each packet area. The number of times is recorded.

If each area S _k of the access number management table T4 is set to, for example, 3 bits, the number of times of access to each corresponding packet area can be counted up to 7. Then, in this case, when the values written in all areas of the access count management table T4 become 7, all areas of the access count management table T4 are initialized (the values written in all areas are 0)
With this configuration, the number of times of access to each corresponding packet area can be managed without increasing the storage capacity of the access management table T4.

As described above, since the packet is written in the packet area having the least access count among the unused packet areas, the packet area corresponding to the lower bit is written more frequently. You will never be seen. Therefore, the number of accesses to each packet area is averaged, and the life of the memory 1 can be extended even if a memory having a limited number of writes is adopted as the memory 1.

Further, instead of the access count management table T4, a random number generating circuit for generating random numbers is provided, and the least significant bit b is set in the empty packet area management table T1.
Rather than searching for bits of 0 in ascending order from 1 _0, it is determined whether or not the bit in the empty packet area management table T1 is 0 according to the random number generated by the random number generation circuit, and thus the empty Packet area management table T
You may make it search for the bit of 0 within 1. Even in this case, the same effect as when the access count management table T4 is provided can be obtained.

[0086]

As described above, according to the information recording / reproducing apparatus of the first aspect, the free packet area management table has a smaller storage capacity, and the free packet area increases as the storage capacity of the memory increases. It is possible to manage the use / unuse of each packet area in the memory without increasing the storage capacity of the area management table. Also, an empty package
By providing a storage area auxiliary table, unused
Can be found efficiently and in a short time
It

[0087]

[0088]

According to the information recording / reproducing apparatus of the second aspect , the time required to find an unused packet area can be greatly shortened by slightly increasing the storage capacity as compared with the conventional one. it can.

Further, according to the information recording / reproducing apparatus of the third aspect , the number of accesses for each packet area corresponding to each block is averaged, and the life is extended for a memory having a limited number of writes. Can be made.

[Brief description of drawings]

FIG. 1 is a block vinegar of an audio recording / reproducing apparatus according to an embodiment of the present invention.

FIG. 2 is a diagram showing the structure of a packet.

FIG. 3 is an image diagram of a music management table.

FIG. 4 is a diagram showing a correspondence relationship between a free packet area management table and a memory.

FIG. 5 is a flowchart of an operation performed by the control circuit.

FIG. 6 is a diagram showing a correspondence relationship between a free packet area management table, a free packet area management auxiliary table, and a memory.

FIG. 7 is a diagram showing a correspondence relationship between a free packet area management table, a free packet area management auxiliary table, and a memory.

FIG. 8 is a diagram showing a correspondence relationship between an empty packet area management table, an empty packet area individual management table, and a memory.

FIG. 9 is a diagram showing a correspondence relationship between an access count management table, a free packet area management table, and a memory.

[Explanation of symbols]

1 memory 2 key input means 3 display means 4 data input / output means 5 control circuit 6 built-in memory T1 empty packet area management table T2 empty packet area management auxiliary table T3 _{0 to} T3 ₂₅₅ empty packet area individual management table T4 access count management table

Claims (3)

(57) [Claims] 1. An information recording / reproducing apparatus for recording and reproducing information using a semiconductor memory as a recording medium, wherein a storage area of the semiconductor memory is divided into a plurality of blocks, and each block is divided into a plurality of packet areas. In addition, each packet area in each block is associated with one packet area in another block, and the packet area in each block is associated with each packet area in each block. A free packet area management table that records information indicating whether or not data is written in the area, and the corresponding packet between blocks
Within the first half block consisting of a predetermined block for each
Whether data is written in all packet areas
An information recording / reproducing apparatus having an empty packet area auxiliary table recording information indicating 2. A semiconductor memory is used as a recording medium to record information.
In an information recording / reproducing apparatus for recording and reproducing, the storage area of the semiconductor memory is divided into a plurality of blocks.
In addition, each block has a plurality of packet areas.
It is divided into each packet area in each block.
The area corresponds to one packet area in another block.
And the corresponding packet between each block.
Data in the packet area in all blocks for each
An empty package that records information indicating whether or not it has been written.
And Tsu DOO area management table, the corresponding information recording and reproducing, characterized in that it has a free packet space individual management table data in each block packet for each area storing information indicating whether written between the blocks apparatus. 3. Information is recorded using a semiconductor memory as a recording medium.
In an information recording / reproducing apparatus for recording and reproducing, the storage area of the semiconductor memory is divided into a plurality of blocks.
In addition, each block has a plurality of packet areas.
It is divided into each packet area in each block.
The area corresponds to one packet area in another block.
And the corresponding packet between each block.
Data in the packet area in all blocks for each
An empty package that records information indicating whether or not it has been written.
And Tsu DOO area management table has a random number generating means for generating a random number by searching the empty packet region management table in accordance with a random number random number generating means generates, the packet area in which data is not written present, corresponding information you characterized by finding a packet area for information recording and reproducing apparatus between the blocks.