JP2005057454A - Verification device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a verification device capable of efficiently decreasing the data size of a reference value used for verification. <P>SOLUTION: The verification device is equipped with a data processing part 30 which generates data for verification by processing decoded data of test data generated by a decoding part 20 and encoded by a specified encoding system according to specified algorithm, a reference value storage part 40 which stores a reference value generated by processing decoded data of the test data having been confirmed as to their correct decoding, and a data comparative decision part 50 which makes a coincidence/discrepancy decision by comparing the data for verification with the reference value, and processing for extracting some area of the decoded data is performed as processing of the algorithm. This constitution can minimizes the data size of the reference value stored in the reference storage part 40. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a verification device that verifies the function of a decoding unit that decodes data encoded by a predetermined encoding method.

As a conventional verification apparatus, there has been a system for verifying the display content of an image. For example, in Patent Document 1, each color signal of RGB is monitored at the time of image display, a sum code is obtained by an n-bit adder, the sum code at the time of check and a check reference value (check sum code) calculated in advance. It is disclosed to verify by comparison. By holding the reference value in the form of a thumb code, the amount of data required as the reference value is reduced, and the cost of the system is reduced.
JP-A-4-115291

  In the conventional verification apparatus, the reference value is acquired by adding the RGB color signals, and therefore the size of the reference value data is 1/3 of the original data. However, in recent years, the data size handled as image data has been enlarged, and further reduction of the data amount has been demanded. For this purpose, it is necessary to more efficiently reduce the reference value data.

  Therefore, an object of the present invention is to provide a verification apparatus that can more efficiently reduce the data size of a reference value used for verification.

In order to achieve the above-mentioned object, the invention described in claim 1 of the present invention is a verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method, and decoded data generated by decoding the test data by the decoding unit, a predetermined algorithm Generated by performing the algorithm processing on the data processing unit that generates the verification data by performing the process in the above and the test decoded data that has been confirmed to be correctly decrypted A reference value storage unit for storing a reference value, and a data comparison determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination, As a process, a process of extracting a partial area of the decoded data is performed.

According to the above configuration, it is possible to significantly reduce the reference value data stored in the reference value storage unit by performing a process of extracting a partial area of the decoded data.
The invention according to claim 2 is performed on the set of the decoded data composed of at least two bit strings as the algorithm processing performed by the data processing unit, and each of the data sets In other words, a process for extracting regions where addresses do not overlap each other is performed.

  According to the above configuration, it is possible to significantly reduce the reference value data stored in the reference value storage unit by performing processing for extracting non-overlapping areas from each data in the data set. .

  According to a third aspect of the present invention, the algorithm processing performed in the data processing unit is performed on the set of decoded data composed of at least two bit strings, and each of the data sets A process for performing a predetermined calculation on values at the same address of the data is performed.

  According to the above configuration, the reference value data accumulated in the reference value storage unit can be significantly reduced by performing a process of performing a predetermined operation on the values of the same address of each data in the data set. It becomes possible.

  In the invention according to claim 4, as a processing of the algorithm performed in the data processing unit, representative values of all data in the division are obtained for each division for the target data divided into a plurality of areas in the predetermined division. A process of calculating and synthesizing the representative values into one data is performed.

  According to the above configuration, by calculating the representative value of all the data in the category for each category and combining the representative values into one data, the reference value data accumulated in the reference value storage unit is greatly increased. Reduction is possible.

The invention described in claim 5 is characterized in that an irreversible compression encoding process is performed on the decoded data as an algorithm process performed by a data processing unit.
According to the above configuration, the reference value data stored in the reference value storage unit can be greatly reduced by performing the lossy compression encoding process on the decoded data.

The invention described in claim 6 is characterized in that a lossless compression encoding process is performed on the decoded data as an algorithm process performed by a data processing unit.
According to the above configuration, it is possible to significantly reduce the reference value data stored in the reference value storage unit by performing the lossless compression encoding process on the decoded data.

  According to the seventh aspect of the present invention, as the algorithm processing performed by the data processing unit, the decoded data may be selected according to a tendency of malfunction of the decoding unit or a characteristic of data encoded by a predetermined encoding method. The process of extracting a part of the area is performed on the set of the decoded data composed of at least two bit strings, and the areas in which the addresses do not overlap with each other in the data set Is performed on the decoded data set composed of at least two or more bit strings, and a predetermined operation is performed on values at the same address of each data in the data set. Processing to be performed, for each of the decoded data divided into a plurality of areas in a predetermined division, a representative value of all data in the division is calculated, and the representative values are combined into one data Processing for combining, lossless compression coding process for the decoded data, is characterized in that the selecting and executing any one from among the lossy compression coding process for the decoded data.

  According to the above configuration, for the processing performed by the data processing unit, by adopting an optimal algorithm according to the failure tendency of the decoding unit or the characteristics of the data, the reference value data accumulated in the reference value storage unit is greatly increased. Reduction is possible.

  The verification apparatus of the present invention has the above-described configuration, and performs a process of extracting a partial area of the decoded data as an algorithm process performed by the data processing unit, thereby significantly reducing the reference value data. As a result, the cost required for the reference value storage unit (storage device for storage) and the time required for verification can be reduced.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. In the present embodiment, a verification environment of a decoding apparatus (decoding unit) that decodes an image encoded in the JPEG format will be described as an example.
(Configuration of verification device)
FIG. 1 is a configuration diagram of a verification apparatus according to an embodiment of the present invention.

  The verification apparatus shown in FIG. 1 is a verification apparatus for verifying the function of the decoding unit 20 that decodes image data encoded in the JPEG format, and includes a test data storage unit 10, a data processing unit 30, and the like. The reference value storage unit 40 and the comparison determination unit 50 are configured.

  The test data storage unit 10 stores image data encoded in JPEG format as test data for verifying the decoding function of the decoding unit 20 to be verified. It is determined that the function of the decoding unit 20 is normal by confirming that the decoding unit 20 performs the expected processing on the test data (image data) stored in the data storage unit 10. it can. When the decoding unit 20 decodes the image data encoded in the JPEG format, the decoded data (decoded data) includes luminance information and color difference information for each pixel at a certain stage. The tone value quantized with.

  The data processing unit 30 performs data processing on the decoded data of the test data input from the decoding unit 20 with a predetermined algorithm, and outputs the processed verification data. The data processing algorithm will be described later.

  The reference value storage unit 40 stores in advance reference values for test data (image data) stored in the test data storage unit 10. Here, the reference value is a value for verifying that the image data is normally decoded, and the test data (image data) that has been confirmed to be normally decoded has been decoded. Data is generated by performing the same processing as the data processing unit 30 on the data.

The comparison / determination unit 50 compares the verification data output from the data processing unit 30 with the reference value stored in the reference value storage unit 40, determines whether the data matches or does not match, and outputs the comparison determination result. To do.
(Operation of the verification device)
Next, the mechanism by which the decryption unit 20 is verified by the verification apparatus will be described with reference to FIG. In FIG. 2, instead of the decoding unit 20 of FIG. 1, a reference decoding unit 21 in which the decoding function is confirmed to operate normally, and a defective decoding unit 22 having a defect in the decoding function. The structure using is shown.
(Generation of reference value)
The test data read from the test data storage unit 10 is decoded by the reference decoding unit 21. Since it is confirmed that the operation of the reference decoding unit 21 is normal, the image data decoded here is correctly decoded. A reference value is generated by performing data processing on the decoded data of the correct test data (image data) by the data processor 30 using the predetermined algorithm. This reference value is generated for all test data and stored in the reference value storage unit 40. As described above, the reference decoding unit 21 correctly decodes the test data, and the reference value is generated by the data processing unit 30 for the decoded data of the correct test data (image data) to store the reference value. Stored in the unit 40.
(Defect detection defect detection)
Further, the test data read from the test data storage unit 10 is decoded by the decoding unit with defect 22. Here, since the decoding unit with a defect 22 does not perform normal decoding, the decoded image data is different from the original correct image data. At this time, as the characteristics of the displayed image, phenomena such as line / dot / block noise occurring in part or all of the image, or the image being cut off in the middle appear. Verification data is generated by performing data processing on the decoded data of the test data (image data) that has not been correctly decoded in this way by the data processing unit 30 using the predetermined algorithm.

  When the decrypted decrypted data is not normal, it is expected that the data generated by the processing of the data processing unit 30 is output with a value different from the reference value. If the verification data and the reference value are different from each other, the comparison / determination unit 50 detects a mismatch, and by confirming the output result, it is possible to know that the defective decoding unit 22 is defective.

As can be seen from the example of the decoding unit 22 with such a defect, when the decoding unit 20 has a defect in the decoding function, this defect can be detected.
However, depending on the data processing algorithm, there is a possibility that the same value may be output. Therefore, it is necessary to employ an appropriate data processing algorithm in the data processing unit 30.
(Summary of Invention Implementation)
The verification device proposed in the present invention realizes a reduction in the data amount (data size) of the reference value data, which is a problem in the background art. As described above, the reference value is generated as shown in FIG. 1 is a data processing unit 30. Therefore, the contents of the processing performed in the data processing unit 30 and the mechanism for reducing the data amount of the reference value will be described below.
[Embodiment 1]
In the first embodiment, as an algorithm process in the data processing unit 30, a partial area on the image data is selected from the decoded image data (decoded data), and only the data in the area is selected. A process (an example of a process for extracting a partial area of decoded data / an irreversible compression encoding process) is executed.

  An example of the method for selecting the region is shown in FIG. In this example, a cross-shaped area is used in which the areas passing through the centers of the horizontal axis direction and the vertical axis direction of the image data are combined. With such a selection, it is possible to detect when noise for one line up or down or one line on the left or right occurs. Further, by changing the width of the cross-shaped area in accordance with the number of pixels of the image, the size of the verification data (the reference value when correct decoded data) can be adjusted.

  The parameters that can be set in the first embodiment include an area used for verification. This area can be flexibly changed in accordance with the tendency of occurrence of defects in the image (problem tendency of the decoding unit 20). For example, when a place where noise is generated is determined due to a malfunction of the decoding unit 20, by selecting only that area as an area to be used for verification, the amount of reference value data required for verification is minimized. Can be suppressed.

  As described above, according to the first embodiment, as a process of the algorithm, a process of extracting a partial area of the decoded data is performed, so that it is accumulated in the reference value storage unit 40 for comparison with the verification data. As a result, the cost required for the reference value storage unit (storage device) 40 and the time required for verification can be reduced.

"Concrete example"
At present, taking the image size of 240 pixels × 320 pixels used in a mobile phone as an example of the image size that is generally used, the total number of pixels of this image size is 240 × 320 = 76800 pixels. When a cross-shaped region having a vertical width of 1 pixel and a horizontal width of 1 pixel is used as a reference value from this image, the data size used as the reference value is 559 pixels, which is a data reduction of 559/76800 = 1/137.
[Embodiment 2]
In the second embodiment, the algorithm processing in the data processing unit 30 is performed on a data set composed of at least two bit strings. From each data in the data set, each address Processing for extracting non-overlapping regions (an example of lossy compression encoding processing) is executed.

  An example of this processing method is shown in FIG. A set of a plurality of image data sets (four in the figure) having the same area composed of two or more bit strings is set as one set, and an area in which each image data in one set does not overlap each other. In FIG. 4, each image data area is divided into four equal parts, and for the images 1 to 4 in one set, the Nth image extracts the Nth column area from the left. The four areas are combined into one piece of verification data (one reference value for correct decoded data).

  Parameters that can be set in the second embodiment include the number of images included in one set. That is, the data amount of the reference value necessary for verification can be reduced (1 / X times) by the amount (X) of the images included in one set.

  As described above, according to the second embodiment, the algorithm processing is performed on a data set composed of at least two bit strings, and each address in the data set is mutually addressed. By performing the process of extracting the non-overlapping areas, the data size of the reference value stored in the reference value storage unit 40 can be minimized for comparison with the verification data. As a result, the reference value storage The cost required for the storage unit (storage device 40) and the time required for verification can be reduced.

  Further, as a problem that occurs in the decoding unit 20, when noise occurs in the entire image in the set, it is possible to immediately determine the image in which the problem has occurred from the region where the mismatch has occurred. In addition, because areas that do not overlap each other are selected from each image in the set. This is also effective for a problem in which noise always appears at a fixed location for all images.

"Concrete example"
As the number of images included in one set of images for creating a reference value increases, the reference value can be reduced. For example, if a reference value is created with 100 images as one set, the reference value size is 1/100.

  In the first and second embodiments, the reference value is reduced by using only a partial region of the image. As described in the effects of the first and second embodiments, this is an effective method when the occurrence tendency of defects on the image due to the defect of the decoding unit 20 is clear. By setting appropriate parameters according to the trend, efficient data reduction can be realized.

On the other hand, Embodiment 3 and Embodiment 4 will be described in detail as an effective method when the failure occurrence tendency of an image cannot be grasped.
[Embodiment 3]
In the third embodiment, the algorithm processing in the data processing unit 30 is performed on a data set composed of at least two bit strings, and the value of the same address of each data in the data set A process (an example of an irreversible compression encoding process) for performing a predetermined operation on each other is executed.

  An example of this processing method is shown in FIG. A set of a plurality of (four in the figure) images having the same area and composed of at least two or more bit strings is set as one set, and each image in the set has the same position on the image. A process of adding the gradation values of the pixels is performed. In FIG. 5, each pixel on the image is represented by an 8-bit quantized gradation value, and the gradation value of the upper left pixel of the image is 10h, 00h, FFh, and 10h for the four images, respectively. If there are, these are added (bit carry after the 9th bit is discarded), and 10h + 00h + FFh + 10h = 1Fh is obtained, which is used as verification data corresponding to the upper left pixel (a reference value when correct decoded data). The same addition is performed for all the pixels on the same image, and the verification data or the reference value is acquired.

  As described above, according to the third embodiment, as in the second embodiment, only the number of images (X) is increased to one set of image sets for creating a reference value necessary for verification. The amount of data of the required reference value can be reduced (1 / X times), and the algorithm processing is performed on a data set composed of at least two bit strings, and each of the data sets in the data set By performing a process of performing a predetermined calculation on values at the same address in the data, the data size of the reference value stored in the reference value storage unit 40 is minimized in order to compare with the verification data. As a result, the cost required for the reference value storage unit (storage device 40) and the time required for verification can be reduced.

  In addition, this processing method uses all the areas in the image, so it can be detected even if a defect occurs in any area on the image, and it is effective even if the failure tendency of the image cannot be grasped. It is.

The third embodiment is a method for generating one reference value for a plurality of images, and the effect is low when the number of data to be tested is small. On the other hand, the fourth embodiment is a method of generating a reference value by performing data reduction on a single image.
[Embodiment 4]
In the fourth embodiment, as the algorithm processing in the data processing unit 30, for the decoded data (image data) divided into a plurality of areas in a predetermined division, the representative value of all the data in the division for each division And a process of synthesizing the representative values into one data (an example of a lossy compression encoding process) is executed. Examples of the method for calculating the representative value include a method using an average value of gradation values of all the elements of the pixels in the category, and a method of calculating the sum by performing addition.

  An example of this processing method is shown in FIG. In this example, 16 pixels of 4 pixels in the vertical direction and 4 pixels in the horizontal direction are used as the division unit of the division, the image is divided in units of 16 pixels, and the gradation value of all the pixels in the division is added as a representative value of each division (9 bits) Bit carry after the first is rounded down). The same process is performed for all the sections, and the sum of the representative values for each section is used as verification data (a reference value for correct decoded data).

  The parameters that can be set in the fourth embodiment include the number of pixels included in one section. By adjusting the number of pixels included in one section to be X pixels, the size of the reference value can be 1 / X times.

  As described above, according to the fourth embodiment, since the representative value is calculated for each section, it is possible to have information on the entire image as verification data or a reference value. Further, as a difference from the third embodiment, since each test data has a reference value, even if the number of test data is small, the reference value storage unit 40 is used for comparison with the verification data. As a result, it is possible to reduce the cost required for the reference value storage unit (storage device) 40 and the time required for verification. .

"Concrete example"
As described above, the reference value can be reduced by increasing the number of pixels included in one section. For example, if the entire image is divided into blocks of 16 × 16 pixels, the result of adding all the pixel values in the block for each block is calculated, and the sum of them for all blocks is used as the reference value, the reference value The size of the value is 1/256.

In the first to fourth embodiments, part of the information of the original image is lost when reducing the data amount of the reference value. That is, different images may generate the same verification data, and complete verification is not guaranteed. In contrast, the fifth embodiment is a method for reducing data without losing the amount of information.
[Embodiment 5]
In the fifth embodiment, as the algorithm processing in the data processing unit 30, a lossless compression encoding process is performed on the decoded data after decoding.

  An example of this processing method is shown in FIG. By providing a certain encoding / decoding algorithm for the image and performing lossless compression encoding, verification data (a reference value for correct decoded data) can be obtained. In FIG. 7, a code is simply assigned to a bit string and replaced. However, as a commonly used encoding algorithm, for example, an LZ method represented by a compression / decompression program such as gzip is famous. . The reference value generated in this way can be completely decoded by decoding, and unlike the first to fourth embodiments, the reference value can be obtained without losing information. Data reduction is possible.

  As described above, according to the fifth embodiment, since the data content after decoding is completely retained by lossless compression encoding, it is possible to surely find a data defect. Although it depends on the encoding algorithm, in general, data having a large number of locations where the same value continues is greatly reduced and stored in the reference value storage unit 40 for comparison with verification data. As a result, it is possible to reduce the cost required for the reference value storage unit (storage device) 40 and the time required for verification.

"Concrete example"
The data amount of the reference value generated by lossless compression encoding depends on the data content before compression, and the simpler data improves the data amount reduction efficiency. For example, in the case of a general photograph, the ratio reduced by lossless compression coding is about 1/2 at most, but in the case of simple data such as an image having a large number of solid-colored areas, the compression is high. Data reduction at a rate of / 10 to 1/100 can also be expected.

The data reduction rate of the reference value obtained by performing lossless compression encoding in the fifth embodiment largely depends on the data content and cannot be adjusted by parameters or the like. On the other hand, the sixth embodiment is a method for efficiently reducing data, although some information is lost by data compression coding.
[Embodiment 6]
In the sixth embodiment, as an algorithm process in the data processing unit 30, an irreversible compression encoding process is performed on the decoded data after decoding.

  As an example of this processing, the flow of the JPEG algorithm is shown in FIG. Compression by the JPEG algorithm is performed for each 8 × 8 pixel area of the image. Discrete cosine transform (DCT) is performed on each 8 × 8 pixel region, and the obtained frequency components are quantized by quantization parameters, and the quantized values are encoded by Huffman coding. , Verification data (reference value for correct decoded data) can be obtained.

  The JPEG algorithm is lossy compression because of the above quantization processing. If an appropriate quantization parameter is set at this time, the value after quantization becomes a data string in which data reduction by Huffman coding is performed efficiently, and a high compression rate can be expected. In addition, since data lost by JPEG compression is a high-frequency component that hardly perceives changes due to visual characteristics, a high compression rate can be realized while maintaining a large amount of information as an image.

  In the lossy compression encoding, a part of data is lost, and thus a value obtained by decoding the encoded data does not completely match the original data. However, if the pre-encoding data matches, the same encoded data can be obtained, which is a useful method for the purpose of reducing the reference value.

  As a parameter that can be set in the sixth embodiment, there is data to be truncated at the time of lossy compression. For example, in the JPEG example described above, the data size at the time of compression can be adjusted by changing the quantization parameter after DCT.

  As described above, according to the sixth embodiment, it is possible to reduce the amount of data with a higher compression rate than that of lossless compression coding in general by lossy compression coding. In addition, the sixth embodiment is a technique similar to the fourth embodiment in that the information of the entire image is used. However, in the fourth embodiment, compared with the case where a lot of pixel information is lost when generating the reference value, In the embodiment, since a large amount of information as an image remains, data can be reduced without losing much pixel information, and the reference value stored in the reference value storage unit 40 can be compared with the verification data. The data size can be minimized, and as a result, the cost required for the reference value storage unit (storage device 40) and the time required for verification can be reduced.

"Concrete example"
Taking JPEG encoding as an example, the compression rate can be adjusted to some extent by adjusting quantization parameters. In a practical level range as an image, the data size after compression is about 1/10 to 1/50.

  In the first to sixth embodiments described above, the JPEG verification apparatus has been described as an example. However, the data to be decoded is not limited to JPEG, and other image formats, information such as moving images and audio are digitally encoded. It may be converted into one.

  Further, one of the algorithms of the first to sixth embodiments according to the tendency of the occurrence of a decoding defect occurring in the decoding unit 20 or the characteristics of data encoded by a predetermined encoding method. It is also possible to change the parameters in each embodiment. According to this configuration, the processing performed by the data processing unit 30 is more flexible in processing at the time of generating a reference value by adopting an optimal algorithm according to the failure tendency of the decoding unit 20 or data characteristics. Therefore, it is possible to realize more efficient reference value data reduction, and to minimize the data size of the reference value stored in the reference value storage unit 40 for comparison with the verification data. As a result, the cost required for the reference value storage unit (storage device 40) and the time required for verification can be reduced.

  1 and 2, the test data storage unit 10 and the reference value data storage unit 40 are separated, but may be stored on the same medium. The test data may not be recorded in the storage medium. For example, directly encoded data may be read directly from the encoding device or the like to the decoding unit 20.

In the third and fourth embodiments, addition is performed to calculate a reference value from a plurality of values. However, this calculation is not limited to addition, and may be an operation such as calculating an average value.
In the sixth embodiment, JPEG compression is taken as an example of the lossy compression encoding method, but other lossy compression encoding methods may be used.

  The verification apparatus according to the present invention can greatly reduce the reference value data for verification of the decoding unit, and can be applied to the development of communication devices that require image, video, and audio functions such as mobile phones. it can.

It is a block diagram of the verification apparatus in embodiment of this invention. It is a figure which shows the mechanism in which verification is performed by the verification apparatus. It is a figure which shows the data processing of the verification apparatus in Embodiment 1 of this invention. It is a figure which shows the data processing of the verification apparatus in Embodiment 2 of this invention. It is a figure which shows the data processing of the verification apparatus in Embodiment 3 of this invention. It is a figure which shows the data processing of the verification apparatus in Embodiment 4 of this invention. It is a figure which shows the data processing of the verification apparatus in Embodiment 5 of this invention. It is a figure which shows the data processing of the verification apparatus in Embodiment 6 of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Test data storage device 20 Decoding part 21 Reference | standard decoding part 22 Defect with defect part 30 Data processing part 40 Reference value storage part 50 Comparison determination part

Claims (7)

A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
The verification apparatus characterized by performing the process which extracts the one part area | region of the said decoded data as a process of the said algorithm. A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
As the process of the algorithm, a process which is performed on the decoded data set composed of at least two or more bit strings, and extracts non-overlapping areas from each data in the data set The verification apparatus characterized by performing. A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
As the processing of the algorithm, it is performed on the decoded data set composed of at least two or more bit strings, and a predetermined operation is performed on values at the same address of each data in the data set The verification apparatus characterized by performing the process which performs. A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
As the processing of the algorithm, a representative value of all data in the section is calculated for each section for the decoded data divided into a plurality of areas in a predetermined section, and the representative values are combined into one data. A verification apparatus characterized by performing a process of combining. A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
A verification apparatus that performs lossless compression encoding processing on the decoded data as processing of the algorithm. A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
A verification apparatus that performs lossy compression encoding processing on the decoded data as processing of the algorithm. A verification device for verifying the function of a decoding unit that decodes data encoded by a predetermined encoding method,
A test data storage unit storing test data encoded by the encoding method;
A data processing unit for generating verification data by processing the decoded data generated by decoding the test data by the decoding unit using a predetermined algorithm;
A reference value storage unit that accumulates a reference value generated by performing the processing of the algorithm on the test decoded data that has been confirmed to be correctly decoded;
A data comparison / determination unit that compares the verification data with the reference value stored in the storage unit to perform a match or mismatch determination;
As the processing of the algorithm, depending on the defect tendency of the decoding unit, or the characteristics of data encoded by a predetermined encoding method,
The process of extracting a partial area of the decoded data is performed on the set of decoded data composed of at least two or more bit strings, and each address in the data set is mutually addressed. The process of extracting non-overlapping areas is performed on the set of the decoded data composed of at least two or more bit strings, and the values of the same address in each data in the data set A process for performing a predetermined calculation, calculating a representative value of all the data in the section for each of the decoded data divided into a plurality of areas in a predetermined section, and combining the representative values into one data And selecting and executing any one of a process for combining the data, a lossless compression encoding process for the decoded data, and a lossy compression encoding process for the decoded data. Verification device.

Images