US20050125475A1 - Circuit sharing of MPEG and JPEG on IDCT - Google Patents
Circuit sharing of MPEG and JPEG on IDCT Download PDFInfo
- Publication number
- US20050125475A1 US20050125475A1 US10/992,814 US99281404A US2005125475A1 US 20050125475 A1 US20050125475 A1 US 20050125475A1 US 99281404 A US99281404 A US 99281404A US 2005125475 A1 US2005125475 A1 US 2005125475A1
- Authority
- US
- United States
- Prior art keywords
- word
- idct
- value
- signed
- sharing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
- H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
- H04N19/426—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements using memory downsizing methods
- H04N19/427—Display on the fly, e.g. simultaneous writing to and reading from decoding memory
Definitions
- the presented invention relates to a device and method of sharing IDCT, specially relates to a device and method of sharing IDCT for MPEG and JPEG.
- MPEG Motion Picture Experts Group
- ISO International Organization for Standardization
- JTC 1 Joint Technical Committee 1
- SC 29 Sub-committee 29
- WG 11 Work Group 11
- JPEG Joint Photographic Experts Group
- JPEG is a standard applied on still image compression.
- MCP block-based motion compensated prediction
- JPEG is applied on general purpose characterized, uncorrelated with color space, and each component has its quantization tables.
- the extension mode of JPEG comprises: two sampling accuracy (8 bit and 12 bit), combination of frequency progressive, spatially progressive, and amplitude progressive scanning modes . . . etc. And the independence on color is contributed by a down-loadable Huffman tables.
- MPEG is applied on specific purpose, hence it has only one color space (4:2:0 YcrCr), one sampling accuracy (8 bit), and one scanning mode.
- MPEG uses identical quantization tables in color and brightness which limits the range of sampling dimensions, and increases an adaptive quantization function in microblock (for example, 16 ⁇ 16 pixel area) to make smoother bit rate control and perceptually uniform quntization extend all over the image and image sequences.
- microblock for example, 16 ⁇ 16 pixel area
- MPEG and JPEG are very similar—block transform coding of image data is performed by 8 ⁇ 8 two dimension orthogonal discrete cosine transform (DCT) and 63 AC quantization indices are generated. The next, the 63 AC quantization indices are performed by following zig-zag scan and run-length coding, then encoded by Huffman coding (JPEG Huffman coding or MPEG Huffman coding).
- DCT discrete cosine transform
- 63 AC quantization indices are performed by following zig-zag scan and run-length coding, then encoded by Huffman coding (JPEG Huffman coding or MPEG Huffman coding).
- JPEG and MPEG data streams must perform inverse discrete cosine transform (IDCT) to regenerate original image.
- IDCT inverse discrete cosine transform
- the IDCT is operated in a prescribed range, in other words, the results after run-length coding must be transformed into some value that between the maximum value and the minimum value in the prescribed range. See FIG. 1 a, generally the operational values of JPEG IDCT are between 127 and ⁇ 128. It means the JPEG data stream must follow steps in FIG.
- the output value will change into ⁇ 128 (step 110 , 112 ); if the original value is larger than 127, the output value will change into 127 (step 120 , 122 ); otherwise output the original value (step 124 ).
- the operational values of MPEG IDCT are between ⁇ 256 and 255. See FIG. 1 b, if the original value of MPEG data stream is smaller than ⁇ 256, the output value will change into ⁇ 256 (step 130 , 132 ); if the original value is larger than 255, the output value will change into 255 (step 140 , 142 ); otherwise output the original value (step 144 ).
- the values after change have to do offset operation before IDCT, for example, adding 128 to JPEG data results in the IDCT input values lies in between 255 and 0.
- IDCT plays an important role in JPEG and MPEG decoding.
- IDCT is executed by software (for example, a program written in C language) for JPEG data, but by hardware (for example, Verlog HDL) for MPEG data to gain faster decoding speed. Therefore, IDCT of JPEG and IDCT of MPEG can not be performed by same device or means, and the cost and the efficiency is not optimal for any system which supports both JPEG and MPEG.
- the invention provides a device and a method of sharing IDCT for performing IDCT on DCT-transformed data of different standards with the same device or means, which saves the cost of setting multiple IDCT devices.
- the invention also provides a device and a method of sharing IDCT such that makes multimedia players have more compatibility in digital data processing.
- the invention provides a device and a method for IDCT, comprising: First, analyzing received input word to extract a data word and an identifier which represents the coding method of the input word; performing IDCT on extracted data word to form a signed word; referring to the identifier and transforming the value of the signed word into a formatted word which value ranges between a maximum and a minimum value.
- the input word could be received by an input word receiver and then transformed into a formatted word via a word transformation device, such that we can use a method of sharing IDCT handling the input word with different coding method to save the cost of setting multiple IDCT devices.
- FIG. 1 a and FIG. 1 b are flow charts of the prior art
- FIG. 2 shows a block diagram of the embodiment of the invention
- FIG. 3 a and FIG. 3 b shows a flow chart of the embodiment of the invention.
- FIG. 4 shows the block diagram of the embodiment of the invention.
- JPEG Joint Photographic Experts Group
- FIG. 2 is a diagram according to an embodiment of the invention.
- receiving an input word consists of a data word and an identifier via step 200 , in which the identifier represents the encoding method of the input word.
- the identifier could be consisting of one or several bits to represent the encoding method of the signed word, for example, the identifier could indicate the signed word is encoded in JPEG, MPEG- 1 , MPEG- 2 , or other encoding method concerned of DCT. Take emphasis on it that the invention doesn't limit the means for implementing encoding and doesn't limit the numbers of bits of the received input word and signed word. For instance, the input word could be 32 bits, 64 bits or else and the signed word could be 8 bits, 9 bits, 11 bits or else.
- step 210 the data word is transformed into a signed word, wherein the signed bit indicates the signed word is positive or negative, which could represents by 2's complement, 1's complement, or other representations able to represent positive or negative.
- step 220 transforms the signed word into a formatted word according to the indicated encoding method of the identifier.
- the value of the formatted word is defined in a range and, which could be involved in the range of formatted word directly or after transformation.
- the signed words of different encoding method could be formatted in a specific range and output the formatted word via step 230 .
- FIG. 3 a is flow chart of another embodiment of the invention.
- determine the data format after received a signed word step 221 ), which may comprised in the input word or generated after analyzing the input word.
- determine if the signed word is smaller than the minimum value of this format step 222 ), and output the minimum value of the format if the signed word's smaller than the minimum value of the format.
- determine if the signed word is larger than the maximum value of this format step 224
- output the maximum value of the format if the signed word is larger than the maximum value of the format step 225 . Otherwise, output the original value (step 231 ).
- step 221 determines if the signed word is smaller than the sub-minimum value of that format via 223 and output the minimum value (step 226 ) if true. If not, determine if the signed word is larger than the sub-maximum value of the format. If true, output the maximum value of the format (step 225 ). Otherwise if the signed word's value is not larger than the sub-maximum value, determine if it's necessary to do offset operation or not. If not, output the original signed word's value (step 230 ), otherwise output the signed word's value with a fixed offset (step 229 ).
- each signed word has to be limited in the range between the minimum and the maximum value after transformation from signed word into formatted word.
- the output formatted word will be transformed into the maximum value; if the signed word is smaller than the minimum value, the output formatted word will be transformed into the minimum value.
- the range of formatted word is between ⁇ 256 and 255
- the output formatted word will be assigned ⁇ 256 (step 324 ); if the signed word is larger than 255 (step 325 ), the output formatted word will be assigned 255 (step 327 ); if the signed word is between ⁇ 256 and 255, then the formatted word will be outputted in original value (step 328 ).
- a formatted word of JPEG data has been identified, define the formatted word's value of signed word between a sub-maximum value and a sub-minimum value.
- the formatted word could be transformed into a value ranges between the predefined sub-maximum value (127) and sub-minimum value ( ⁇ 128) or the minimum value ( ⁇ 256) and maximum value (255).
- the predefined sub-maximum and sub-minimum value of JPEG are 127 and ⁇ 128, hence, if the signed word is smaller than ⁇ 128 the formatted word will be transformed into ⁇ 256 to output (step 323 and 324 ); if the signed word is larger than 127 the formatted word will be transformed into 255 to output (step 326 and 327 ); else if a signed word ranges between ⁇ 256 and 255, output it's original value (step 328 ).
- an offset could be added in the process of transforming signed word into formatted word to make formatted word between a specific range.
- the formatted word will be assigned the signed word's value plus 128 (not shown in paragraph); if not, the formatted word will be assigned the signed word.
- the implementation of adding 128 to signed word could be by setting all bits after ninth bit (from the least significant bit) to 0 and turns the eighth bit from 1 to 0 or 0 to 1.
- step 220 one significant important characteristic of the invention in step 220 lies on the following: when identify as JPEG format, transform the signed word's value which is larger than the sub-maximum value into the maximum value; transform the signed word's value which is smaller than the sub-minimum value into the minimum value, and further optionally comprises doing offset operation on the particularly encoded signed word. All mentioned above are just preferred embodiment of the invention. The sequences of each step discussed above can change arbitrarily and non-limiting for the invention.
- the sub-maximum and sub-minimum value of different encoding method or those with an offset must be in the range of the maximum and minimum value. For example, if the maximum and minimum value of the formatted word are 255 and ⁇ 256 for each other, the signed word's value of MPEG ranges between ⁇ 256 and 255 but the range of JPEG could be ⁇ 128 to 0 or 0 to 255. Also the range of the formatted word is non-limiting in the invention.
- the signed word could be represented in 2's complement, 1's complement, or any other means.
- the representation of sign bit could be that when MSB (most significant bit) is 1 for negative, and 0 for positive.
- the range of the encoded data for MPEG and JPEG could be ⁇ 256 to 255 and ⁇ 128 to 127 individually.
- input word is 32 bits, 64 bits, or more bits, assign 11 consecutive bits as signed word and a fixed bit as sign bit.
- the sign bit is assigned MSB (most significant bit) and, the sign bit is 0 as the signed word is 0 or positive, otherwise the sign bit is 1 as the sign word is negative.
- the signed word is represented via 2's complement, for example, the numerical values 255, 127, 0, ⁇ 128, ⁇ 256 are represented as 255, 127, 0, 1920, 1792.
- FIG. 4 is another preferred embodiment of the invention.
- a device of sharing IDCT consists of: an input word receiver 410 , an IDCT device 420 , and a word transforming device 430 .
- the input word receiver 410 is used for receiving an input word 420 which consists of a data word 412 and an identifier 414 , wherein the identifier 414 represents the encoding method of the input word 412 (there are several possible encoding methods).
- the IDCT device 420 is used to transform the data word 412 into a signed word 422 and further transform the signed word 422 into a formatted word 432 in accordance to the identifier 414 .
- the word transforming device 430 transforms the signed word 422 which is larger than the sub-maximum value of the format into the maximum value of the format and, transforms the signed word 422 which is smaller than the sub-minimum value of the format into the minimum value of the format, further to do offset operation on signed word with specific encoded. Details of the embodiment of the invention are the same with former better embodiment, such that we don't discuss here.
- the device and method of the better embodiment does not limit it's application on JPEG and MPEG when used in a DVD player and, the method of the invention operates well as long as any two formats of different digital image data could be identified.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Complex Calculations (AREA)
- Image Processing (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
- Feedback Control In General (AREA)
- Closed-Circuit Television Systems (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
A device and a method of sharing IDCT are disclosed. Firstly, a data word and an identifier for representing which one of several formats are extracted from a received word. Then the data word is treated with IDCT to be a signed word afterward. Then the signed word is transformed into a formatted word between the values of a maximum value and a minimum value. The data word and identifier can be received by a word receiving means and treated with IDCT by an IDCT means to generate a signed word. The signed word is transformed into a formatted word for outputting via a word transforming means. Such that words with different formats can be treated with a sharing IDCT to save the redundant cost.
Description
- 1. Field of the Invention
- The presented invention relates to a device and method of sharing IDCT, specially relates to a device and method of sharing IDCT for MPEG and JPEG.
- 2. Description of the Prior Art
- MPEG (Moving Picture Experts Group) is one of the standards of digital video/audio compression established by ISO (International Organization for Standardization). MPEG mostly is a definition concerned of compressed bit stream, and also defines a decompressor indirectly. MPEG has been modified for several times, and the official name of MPEG is ISO/IEC (International Electro-technical Commission) JTC1 (Joint Technical Committee 1) SC29 (Sub-committee 29) WG 11 (Work Group 11).
- JPEG (Joint Photographic Experts Group) sounds like MPEG and it also is part of the sub-committee of ISO. JPEG is a standard applied on still image compression. The major difference between JPEG and MPEG is that MPEG uses block-based motion compensated prediction (MCP). The next difference, the application area is different. JPEG is applied on general purpose characterized, uncorrelated with color space, and each component has its quantization tables. The extension mode of JPEG comprises: two sampling accuracy (8 bit and 12 bit), combination of frequency progressive, spatially progressive, and amplitude progressive scanning modes . . . etc. And the independence on color is contributed by a down-loadable Huffman tables.
- Because MPEG is applied on specific purpose, hence it has only one color space (4:2:0 YcrCr), one sampling accuracy (8 bit), and one scanning mode. MPEG uses identical quantization tables in color and brightness which limits the range of sampling dimensions, and increases an adaptive quantization function in microblock (for example, 16×16 pixel area) to make smoother bit rate control and perceptually uniform quntization extend all over the image and image sequences. Beside, the variable length coding tables of MPEG are non-downloadable, therefore MPEG is suitable for some specific applications concerned with optimizing the limit range of specific compression rate.
- For method of decorrelation on partial area, MPEG and JPEG are very similar—block transform coding of image data is performed by 8×8 two dimension orthogonal discrete cosine transform (DCT) and 63 AC quantization indices are generated. The next, the 63 AC quantization indices are performed by following zig-zag scan and run-length coding, then encoded by Huffman coding (JPEG Huffman coding or MPEG Huffman coding).
- Therefore, JPEG and MPEG data streams must perform inverse discrete cosine transform (IDCT) to regenerate original image. In general, the IDCT is operated in a prescribed range, in other words, the results after run-length coding must be transformed into some value that between the maximum value and the minimum value in the prescribed range. See
FIG. 1 a, generally the operational values of JPEG IDCT are between 127 and −128. It means the JPEG data stream must follow steps inFIG. 1 a to generate operational input for IDCT: if the original value of JPEG data stream is smaller than −128, the output value will change into −128 (step 110,112); if the original value is larger than 127, the output value will change into 127 (step 120,122); otherwise output the original value (step 124). Similarly, the operational values of MPEG IDCT are between −256 and 255. SeeFIG. 1 b, if the original value of MPEG data stream is smaller than −256, the output value will change into −256 (step 130,132); if the original value is larger than 255, the output value will change into 255 (step 140,142); otherwise output the original value (step 144). Sometimes the values after change have to do offset operation before IDCT, for example, adding 128 to JPEG data results in the IDCT input values lies in between 255 and 0. - IDCT plays an important role in JPEG and MPEG decoding. However, IDCT is executed by software (for example, a program written in C language) for JPEG data, but by hardware (for example, Verlog HDL) for MPEG data to gain faster decoding speed. Therefore, IDCT of JPEG and IDCT of MPEG can not be performed by same device or means, and the cost and the efficiency is not optimal for any system which supports both JPEG and MPEG.
- The invention provides a device and a method of sharing IDCT for performing IDCT on DCT-transformed data of different standards with the same device or means, which saves the cost of setting multiple IDCT devices.
- The invention also provides a device and a method of sharing IDCT such that makes multimedia players have more compatibility in digital data processing.
- As mentioned above, the invention provides a device and a method for IDCT, comprising: First, analyzing received input word to extract a data word and an identifier which represents the coding method of the input word; performing IDCT on extracted data word to form a signed word; referring to the identifier and transforming the value of the signed word into a formatted word which value ranges between a maximum and a minimum value. The input word could be received by an input word receiver and then transformed into a formatted word via a word transformation device, such that we can use a method of sharing IDCT handling the input word with different coding method to save the cost of setting multiple IDCT devices.
- Other objects, features, and advantages of the invention will become apparent from the following detailed description of the preferred but non-limiting embodiments. The description is made with reference to the accompanying drawings in which:
-
FIG. 1 a andFIG. 1 b are flow charts of the prior art; -
FIG. 2 shows a block diagram of the embodiment of the invention; -
FIG. 3 a andFIG. 3 b shows a flow chart of the embodiment of the invention; and -
FIG. 4 shows the block diagram of the embodiment of the invention. - The transforming method of the invention for digital image data will be discussed afterward. For more distinct expression about the invention, we take MPEG (9 bits) and JPEG (8 bits) for example. However these expressions do not limit the applications of the invention.
- Because of the similarity between JPEG and MPEG, it's possible to develop encoding/decoding methods or devices suitable to both of them. However, they still have differences suchlike the quantization accuracy is 9 bits in MPEG but 8 bits in JPEG. In other words, the saturation range of MPEG ranges between −256 and 255 but between −128 and 127 for JPEG. Since the DCT-transformed value of JPEG data is between 0 and 255, the JPEG data must make an offset of −128 for transforming into a value between −128 and 127.
-
FIG. 2 is a diagram according to an embodiment of the invention. First, receiving an input word consists of a data word and an identifier viastep 200, in which the identifier represents the encoding method of the input word. - The identifier could be consisting of one or several bits to represent the encoding method of the signed word, for example, the identifier could indicate the signed word is encoded in JPEG, MPEG-1, MPEG-2, or other encoding method concerned of DCT. Take emphasis on it that the invention doesn't limit the means for implementing encoding and doesn't limit the numbers of bits of the received input word and signed word. For instance, the input word could be 32 bits, 64 bits or else and the signed word could be 8 bits, 9 bits, 11 bits or else.
- In
step 210, the data word is transformed into a signed word, wherein the signed bit indicates the signed word is positive or negative, which could represents by 2's complement, 1's complement, or other representations able to represent positive or negative. Next viastep 220 transforms the signed word into a formatted word according to the indicated encoding method of the identifier. The value of the formatted word is defined in a range and, which could be involved in the range of formatted word directly or after transformation. Hence the signed words of different encoding method could be formatted in a specific range and output the formatted word viastep 230. -
FIG. 3 a is flow chart of another embodiment of the invention. First, determine the data format after received a signed word (step 221), which may comprised in the input word or generated after analyzing the input word. The next, determine if the signed word is smaller than the minimum value of this format (step 222), and output the minimum value of the format if the signed word's smaller than the minimum value of the format. Then, determine if the signed word is larger than the maximum value of this format (step 224), and output the maximum value of the format if the signed word is larger than the maximum value of the format (step 225). Otherwise, output the original value (step 231). - If the result via
step 221 shows the signed word is encoded in another format, determine if the signed word is smaller than the sub-minimum value of that format via 223 and output the minimum value (step 226) if true. If not, determine if the signed word is larger than the sub-maximum value of the format. If true, output the maximum value of the format (step 225). Otherwise if the signed word's value is not larger than the sub-maximum value, determine if it's necessary to do offset operation or not. If not, output the original signed word's value (step 230), otherwise output the signed word's value with a fixed offset (step 229). - Take example of MPEG and JPEG. Refer to
FIG. 3 b, when a signed word of MPEG data has been identified (step 321), if the range of the format's value is between a minimum value (like −256) and a maximum value (like 255), each signed word has to be limited in the range between the minimum and the maximum value after transformation from signed word into formatted word. Hence if a signed word is larger than the maximum value, the output formatted word will be transformed into the maximum value; if the signed word is smaller than the minimum value, the output formatted word will be transformed into the minimum value. For instance, the range of formatted word is between −256 and 255, if the signed value is smaller than −256 (step 322), the output formatted word will be assigned −256 (step 324); if the signed word is larger than 255 (step 325), the output formatted word will be assigned 255 (step 327); if the signed word is between −256 and 255, then the formatted word will be outputted in original value (step 328). Beside, if a formatted word of JPEG data has been identified, define the formatted word's value of signed word between a sub-maximum value and a sub-minimum value. Therefore, after IDCT the formatted word could be transformed into a value ranges between the predefined sub-maximum value (127) and sub-minimum value (−128) or the minimum value (−256) and maximum value (255). For example, the predefined sub-maximum and sub-minimum value of JPEG are 127 and −128, hence, if the signed word is smaller than −128 the formatted word will be transformed into −256 to output (step 323 and 324); if the signed word is larger than 127 the formatted word will be transformed into 255 to output (step 326 and 327); else if a signed word ranges between −256 and 255, output it's original value (step 328). Beside, one function was provided that an offset could be added in the process of transforming signed word into formatted word to make formatted word between a specific range. When the predefined signed word's range between 127 and −128 changes to between 255 and 0, concludes the offset is 128. If a signed word identified as JPEG, for example, the formatted word will be assigned the signed word's value plus 128 (not shown in paragraph); if not, the formatted word will be assigned the signed word. The implementation of adding 128 to signed word could be by setting all bits after ninth bit (from the least significant bit) to 0 and turns the eighth bit from 1 to 0 or 0 to 1. - As discussed above, one significant important characteristic of the invention in
step 220 lies on the following: when identify as JPEG format, transform the signed word's value which is larger than the sub-maximum value into the maximum value; transform the signed word's value which is smaller than the sub-minimum value into the minimum value, and further optionally comprises doing offset operation on the particularly encoded signed word. All mentioned above are just preferred embodiment of the invention. The sequences of each step discussed above can change arbitrarily and non-limiting for the invention. - The sub-maximum and sub-minimum value of different encoding method or those with an offset must be in the range of the maximum and minimum value. For example, if the maximum and minimum value of the formatted word are 255 and −256 for each other, the signed word's value of MPEG ranges between −256 and 255 but the range of JPEG could be −128 to 0 or 0 to 255. Also the range of the formatted word is non-limiting in the invention.
- Besides the invention is suitable to any numerical systems suchlike binary, octal, hexadecimal or any others. In binary system, the signed word could be represented in 2's complement, 1's complement, or any other means. Furthermore, the representation of sign bit could be that when MSB (most significant bit) is 1 for negative, and 0 for positive.
- Furthermore, the range of the encoded data for MPEG and JPEG could be −256 to 255 and −128 to 127 individually. When input word is 32 bits, 64 bits, or more bits, assign 11 consecutive bits as signed word and a fixed bit as sign bit. In most cases the sign bit is assigned MSB (most significant bit) and, the sign bit is 0 as the signed word is 0 or positive, otherwise the sign bit is 1 as the sign word is negative. Mostly the signed word is represented via 2's complement, for example, the
numerical values - According to all the discussions, a device of sharing IDCT has been provided.
FIG. 4 is another preferred embodiment of the invention. A device of sharing IDCT consists of: aninput word receiver 410, anIDCT device 420, and aword transforming device 430. Theinput word receiver 410 is used for receiving aninput word 420 which consists of adata word 412 and anidentifier 414, wherein theidentifier 414 represents the encoding method of the input word 412 (there are several possible encoding methods). Besides, theIDCT device 420 is used to transform thedata word 412 into a signedword 422 and further transform the signedword 422 into a formattedword 432 in accordance to theidentifier 414. Theword transforming device 430 transforms the signedword 422 which is larger than the sub-maximum value of the format into the maximum value of the format and, transforms the signedword 422 which is smaller than the sub-minimum value of the format into the minimum value of the format, further to do offset operation on signed word with specific encoded. Details of the embodiment of the invention are the same with former better embodiment, such that we don't discuss here. - To compare with the conventional hardware circuits, it needs only to increase 1 bit (1 pin) to identify what format of input data is when using a device and method of sharing IDCT provided by the invention. Similarly, for controlling software, it needs only a little modifications in the program code. Therefore, because of sharing the same IDCT circuits, the processing speed of JPEG data could become faster when using the device and method of sharing IDCT provided by the invention. Besides, for a DVD player, we could save lot's of cost in hardware circuits because it needs only one IDCT device.
- The device and method of the better embodiment, of course, does not limit it's application on JPEG and MPEG when used in a DVD player and, the method of the invention operates well as long as any two formats of different digital image data could be identified.
- The above-mentions are only the preferred embodiments of the present invention, not intended to limit the scope thereof. It will be appreciated and carried out by those professions skilled in the art. Thus, many modifications of the embodiments which can be made without departing from the spirit of the present invention should be covered by the following Claims.
Claims (20)
1. A method of sharing IDCT (Inverse Discrete Cosine Transform), comprising:
receiving an input word which comprises a data word and an identifier, wherein said identifier represents the encoding method of said data word;
performing IDCT on said data word to generate a signed word;
generating a formatted word according to a maximum value, a sub-maximum value, a minimum value, and a sub-minimum value corresponding to the identifier respectively; and
output said formatted word.
2. The method of sharing IDCT of claim 1 , wherein said signed word is encoded via two's complement.
3. The method of sharing IDCT of claim 1 , wherein the most significant bit of said signed word represents negative when it is 1, otherwise represents positive when it is 0.
4. The method of sharing IDCT of claim 1 , wherein said identifier comprises at least one bit.
5. The method of sharing IDCT of claim 1 , wherein the encoding method of said signed word is chosen from one or combinations of the MPEG (Moving Picture Experts Group) and JPEG (Joint Photographic Experts Group) encoding method.
6. The method of sharing IDCT of claim 1 , wherein the formatted word is assigned a minimum value while said signed word is smaller than said minimum value.
7. The method of sharing IDCT of claim 6 , wherein if said signed word is smaller than said sub-minimum value and encoded in JPEG format, said formatted word is assigned said minimum value, smaller than said sub-minimum value.
8. The method of sharing IDCT of claim 2 , wherein said formatted word is assigned a maximum value while said signed word is larger than said maximum value.
9. The method of sharing IDCT of claim 8 , wherein if said signed word is larger than said sub-maximum value and encoded in JPEG format, said formatted word is assigned said maximum value, larger than said sub-maximum value.
10. The method of sharing IDCT of claim 2 , wherein if said signed word is neither smaller than said minimum value nor larger than said maximum value and encoded in MPEG format, said formatted word's value is assigned said signed word's value.
11. The method of sharing IDCT of claim 10 , wherein if said signed word is neither smaller than said sub-minimum value nor larger than said sub-maximum value and encoded in JPEG format, then said formatted word's value is assigned said signed word's value plus 128, wherein said sub-minimum value is larger than said minimum value and said sub-maximum value is smaller than said maximum value.
12. The method of sharing IDCT of claim 11 , wherein said minimum value, said sub-minimum value, said sub-maximum value, and said maximum value are −256, −128, 127, and 255 respectively.
13. A device of sharing IDCT, comprising:
a word receiver for receiving an input word, wherein said input word comprises a data word and an identifier, and said identifier represents the encoding method of said input word where the encoding method has a plurality;
an IDCT device which performs IDCT on said data word and then generates a signed word; and
a word transforming device which transforms said signed word into a formatted word according to said identifier.
14. The device of sharing IDCT of claim 13 , wherein said identifier represents if said signed word is encoded in JPEG format or in MPEG format.
15. The device of sharing IDCT of claim 13 , wherein said formatted word comprises at least one function below:
said formatted word is assigned a minimum value while said signed word is smaller than said minimum value; and
said formatted word is assigned a maximum value while said is larger than said maximum value.
16. The device of sharing IDCT of claim 15 , wherein if said signed word is smaller than a sub-minimum value and encoded in JPEG format, said formatted word is assigned said sub-minimum value, larger than said minimum value.
17. The device of sharing IDCT of claim 15 , wherein if said signed word is larger than a sub-maximum and encoded in JPEG format, said formatted word is assigned said maximum value, larger than said sub-maximum value.
18. The device of sharing IDCT of claim 13 , wherein if said signed word is neither smaller than said minimum value nor larger than said maximum value and encoded in MPEG format, said formatted word's value is assigned said signed word's value.
19. The device of sharing IDCT of claim 18 , wherein if said signed word is neither smaller than a minimum value nor larger than a maximum value and encoded in JPEG format, then said formatted word's value is assigned said signed word's value plus 128, wherein said sub-minimum value is larger than said minimum value and said sub-maximum value is smaller than said maximum value.
20. The device of sharing IDCT of claim 19 , wherein said minimum value, said sub-minimum value, said sub-maximum value, and said maximum value are −256, −128, 127, 255 respectively.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/992,814 US20050125475A1 (en) | 2003-12-03 | 2004-11-22 | Circuit sharing of MPEG and JPEG on IDCT |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US52629403P | 2003-12-03 | 2003-12-03 | |
US10/992,814 US20050125475A1 (en) | 2003-12-03 | 2004-11-22 | Circuit sharing of MPEG and JPEG on IDCT |
Publications (1)
Publication Number | Publication Date |
---|---|
US20050125475A1 true US20050125475A1 (en) | 2005-06-09 |
Family
ID=34375610
Family Applications (6)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/986,095 Abandoned US20050125480A1 (en) | 2003-12-03 | 2004-11-12 | Method and apparatus for multiplying based on booth's algorithm |
US10/992,814 Abandoned US20050125475A1 (en) | 2003-12-03 | 2004-11-22 | Circuit sharing of MPEG and JPEG on IDCT |
US10/992,849 Abandoned US20050123046A1 (en) | 2003-12-03 | 2004-11-22 | Method and device for sharing MPEG frame buffers |
US11/000,885 Active 2026-10-13 US7558431B2 (en) | 2003-12-03 | 2004-12-02 | Method and system for discrete cosine transforms/inverse discrete cosine transforms based on pipeline architecture |
US11/001,636 Abandoned US20050152609A1 (en) | 2003-12-03 | 2004-12-02 | Video decoder |
US12/976,012 Abandoned US20110091124A1 (en) | 2003-12-03 | 2010-12-22 | System for multi-byte reading |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/986,095 Abandoned US20050125480A1 (en) | 2003-12-03 | 2004-11-12 | Method and apparatus for multiplying based on booth's algorithm |
Family Applications After (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/992,849 Abandoned US20050123046A1 (en) | 2003-12-03 | 2004-11-22 | Method and device for sharing MPEG frame buffers |
US11/000,885 Active 2026-10-13 US7558431B2 (en) | 2003-12-03 | 2004-12-02 | Method and system for discrete cosine transforms/inverse discrete cosine transforms based on pipeline architecture |
US11/001,636 Abandoned US20050152609A1 (en) | 2003-12-03 | 2004-12-02 | Video decoder |
US12/976,012 Abandoned US20110091124A1 (en) | 2003-12-03 | 2010-12-22 | System for multi-byte reading |
Country Status (3)
Country | Link |
---|---|
US (6) | US20050125480A1 (en) |
CN (7) | CN100527071C (en) |
TW (5) | TWI240560B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9750788B2 (en) | 2013-12-13 | 2017-09-05 | Sanofi | Non-acylated exendin-4 peptide analogues |
Families Citing this family (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TWI245548B (en) * | 2004-10-20 | 2005-12-11 | Inst Information Industry | Method and device for video decoding |
US8599841B1 (en) | 2006-03-28 | 2013-12-03 | Nvidia Corporation | Multi-format bitstream decoding engine |
US8593469B2 (en) | 2006-03-29 | 2013-11-26 | Nvidia Corporation | Method and circuit for efficient caching of reference video data |
TW200816787A (en) * | 2006-09-25 | 2008-04-01 | Sunplus Technology Co Ltd | Method and system of image decoding and image recoding |
CN101246468B (en) * | 2007-02-13 | 2010-05-19 | 扬智科技股份有限公司 | Modification type discrete cosine inverse transform method |
CN101064515B (en) * | 2007-04-18 | 2011-05-11 | 威盛电子股份有限公司 | Method for enhancing decoding efficiency |
US8477852B2 (en) | 2007-06-20 | 2013-07-02 | Nvidia Corporation | Uniform video decoding and display |
CN100588254C (en) * | 2007-06-28 | 2010-02-03 | 威盛电子股份有限公司 | Back-discrete cosine inverting circuit |
US8502709B2 (en) | 2007-09-17 | 2013-08-06 | Nvidia Corporation | Decoding variable length codes in media applications |
JP4988627B2 (en) * | 2008-03-05 | 2012-08-01 | ルネサスエレクトロニクス株式会社 | Filter calculator and motion compensation device |
US9110849B2 (en) | 2009-04-15 | 2015-08-18 | Qualcomm Incorporated | Computing even-sized discrete cosine transforms |
US9117060B2 (en) * | 2009-05-07 | 2015-08-25 | Cadence Design Systems, Inc. | System and method for preventing proper execution of an application program in an unauthorized processor |
US9069713B2 (en) | 2009-06-05 | 2015-06-30 | Qualcomm Incorporated | 4X4 transform for media coding |
US9075757B2 (en) | 2009-06-24 | 2015-07-07 | Qualcomm Incorporated | 16-point transform for media data coding |
US9081733B2 (en) | 2009-06-24 | 2015-07-14 | Qualcomm Incorporated | 16-point transform for media data coding |
US9118898B2 (en) | 2009-06-24 | 2015-08-25 | Qualcomm Incorporated | 8-point transform for media data coding |
US9824066B2 (en) | 2011-01-10 | 2017-11-21 | Qualcomm Incorporated | 32-point transform for media data coding |
KR102459917B1 (en) * | 2015-02-23 | 2022-10-27 | 삼성전자주식회사 | Image signal processor and devices having the same |
CN105868554B (en) * | 2016-03-28 | 2018-03-27 | 朱洲森 | A kind of relay drainage method based on big data complex calculation |
KR20220077738A (en) * | 2020-12-02 | 2022-06-09 | 삼성전자주식회사 | Integrated circuit for constant multiplication and device including the same |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5742538A (en) * | 1993-11-30 | 1998-04-21 | Texas Instruments Incorporated | Long instruction word controlling plural independent processor operations |
US5854757A (en) * | 1996-05-07 | 1998-12-29 | Lsi Logic Corporation | Super-compact hardware architecture for IDCT computation |
US6295546B1 (en) * | 1996-06-21 | 2001-09-25 | Compaq Computer Corporation | Method and apparatus for eliminating the transpose buffer during a decomposed forward or inverse 2-dimensional discrete cosine transform through operand decomposition, storage and retrieval |
US20020039385A1 (en) * | 2000-10-04 | 2002-04-04 | Sanyo Electric Co., Ltd., | Apparatus and method for decoding moving picture capable of performing simple and easy multiwindow display |
US6400847B1 (en) * | 1996-06-28 | 2002-06-04 | Competitive Technologies Of Pa, Inc. | Method and apparatus for encoding and decoding images |
US6507614B1 (en) * | 1999-10-19 | 2003-01-14 | Sony Corporation | Efficient de-quantization in a digital video decoding process using a dynamic quantization matrix for parallel computations |
US20030099293A1 (en) * | 1999-12-15 | 2003-05-29 | Shigeyuki Okada | Image reproducing method, and image processing method, and image reproducing device, image processing device, and television receiver capable of using the methods |
US20030112340A1 (en) * | 1999-12-24 | 2003-06-19 | Shigeyuki Okada | Digital camera, memory control device usable for it, image processing device and image processing method |
US6587590B1 (en) * | 1998-02-02 | 2003-07-01 | The Trustees Of The University Of Pennsylvania | Method and system for computing 8×8 DCT/IDCT and a VLSI implementation |
US6597815B1 (en) * | 1998-10-19 | 2003-07-22 | International Business Machines Corporation | Image data compression apparatus and method thereof |
US6675185B1 (en) * | 2000-06-07 | 2004-01-06 | International Business Machines Corporation | Hybrid domain processing of multi-dimensional transformed data |
US20040025000A1 (en) * | 1992-06-30 | 2004-02-05 | Wise Adrian P. | Multistandard video decoder and decompression system for processing encoded bit streams including start code detection and methods relating thereto |
US20040086039A1 (en) * | 2001-09-26 | 2004-05-06 | Interact Devices, Inc. | System and method for compressing portions of a media signal using different codecs |
US7230986B2 (en) * | 1992-06-30 | 2007-06-12 | Discovision Associates | Multistandard video decoder and decompression system for processing encoded bit streams including a video formatter and methods relating thereto |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE69131808T2 (en) * | 1990-07-31 | 2000-03-16 | Fujitsu Ltd | Process and device for image data processing |
JP3546437B2 (en) | 1993-03-31 | 2004-07-28 | ソニー株式会社 | Adaptive video signal processing unit |
US5452466A (en) * | 1993-05-11 | 1995-09-19 | Teknekron Communications Systems, Inc. | Method and apparatus for preforming DCT and IDCT transforms on data signals with a preprocessor, a post-processor, and a controllable shuffle-exchange unit connected between the pre-processor and post-processor |
JPH0793134A (en) * | 1993-09-24 | 1995-04-07 | Nec Corp | Multiplier |
JPH07200539A (en) * | 1993-12-28 | 1995-08-04 | Matsushita Electric Ind Co Ltd | Two-dimensional dct arithmetic unit |
JPH08152994A (en) * | 1994-11-29 | 1996-06-11 | Mitsubishi Electric Corp | Multiplier and digital filter |
JP3474663B2 (en) * | 1995-02-24 | 2003-12-08 | 三菱電機株式会社 | Multiplication circuit |
KR100212268B1 (en) * | 1995-12-13 | 1999-08-02 | 윤종용 | Idct system using lee's algorithm |
JPH1079940A (en) * | 1996-09-05 | 1998-03-24 | Mitsubishi Electric Corp | Image encoder |
US6128340A (en) * | 1997-03-14 | 2000-10-03 | Sony Corporation | Decoder system with 2.53 frame display buffer |
TW364269B (en) | 1998-01-02 | 1999-07-11 | Winbond Electronic Corp | Discreet cosine transform/inverse discreet cosine transform circuit |
US6888372B1 (en) * | 2002-12-20 | 2005-05-03 | Altera Corporation | Programmable logic device with soft multiplier |
-
2004
- 2004-04-08 TW TW093109737A patent/TWI240560B/en active
- 2004-04-08 TW TW093109736A patent/TWI227840B/en active
- 2004-04-08 TW TW093109738A patent/TWI289992B/en active
- 2004-04-09 CN CNB2004100343050A patent/CN100527071C/en not_active Expired - Lifetime
- 2004-04-29 CN CNA2004100384879A patent/CN1595994A/en active Pending
- 2004-04-29 CN CNB2007101019490A patent/CN100539699C/en not_active Expired - Lifetime
- 2004-04-29 CN CNA2004100384864A patent/CN1598876A/en active Pending
- 2004-05-19 TW TW093114098A patent/TWI233267B/en active
- 2004-06-01 CN CNB2004100473497A patent/CN1282368C/en active Active
- 2004-11-12 US US10/986,095 patent/US20050125480A1/en not_active Abandoned
- 2004-11-19 TW TW093135593A patent/TWI295787B/en active
- 2004-11-22 US US10/992,814 patent/US20050125475A1/en not_active Abandoned
- 2004-11-22 US US10/992,849 patent/US20050123046A1/en not_active Abandoned
- 2004-12-02 US US11/000,885 patent/US7558431B2/en active Active
- 2004-12-02 CN CNB2004100979526A patent/CN100531393C/en active Active
- 2004-12-02 CN CNB200410097955XA patent/CN1305313C/en active Active
- 2004-12-02 US US11/001,636 patent/US20050152609A1/en not_active Abandoned
-
2010
- 2010-12-22 US US12/976,012 patent/US20110091124A1/en not_active Abandoned
Patent Citations (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7230986B2 (en) * | 1992-06-30 | 2007-06-12 | Discovision Associates | Multistandard video decoder and decompression system for processing encoded bit streams including a video formatter and methods relating thereto |
US20040025000A1 (en) * | 1992-06-30 | 2004-02-05 | Wise Adrian P. | Multistandard video decoder and decompression system for processing encoded bit streams including start code detection and methods relating thereto |
US5742538A (en) * | 1993-11-30 | 1998-04-21 | Texas Instruments Incorporated | Long instruction word controlling plural independent processor operations |
US5854757A (en) * | 1996-05-07 | 1998-12-29 | Lsi Logic Corporation | Super-compact hardware architecture for IDCT computation |
US6295546B1 (en) * | 1996-06-21 | 2001-09-25 | Compaq Computer Corporation | Method and apparatus for eliminating the transpose buffer during a decomposed forward or inverse 2-dimensional discrete cosine transform through operand decomposition, storage and retrieval |
US6400847B1 (en) * | 1996-06-28 | 2002-06-04 | Competitive Technologies Of Pa, Inc. | Method and apparatus for encoding and decoding images |
US6587590B1 (en) * | 1998-02-02 | 2003-07-01 | The Trustees Of The University Of Pennsylvania | Method and system for computing 8×8 DCT/IDCT and a VLSI implementation |
US6597815B1 (en) * | 1998-10-19 | 2003-07-22 | International Business Machines Corporation | Image data compression apparatus and method thereof |
US6507614B1 (en) * | 1999-10-19 | 2003-01-14 | Sony Corporation | Efficient de-quantization in a digital video decoding process using a dynamic quantization matrix for parallel computations |
US20030099293A1 (en) * | 1999-12-15 | 2003-05-29 | Shigeyuki Okada | Image reproducing method, and image processing method, and image reproducing device, image processing device, and television receiver capable of using the methods |
US20030112340A1 (en) * | 1999-12-24 | 2003-06-19 | Shigeyuki Okada | Digital camera, memory control device usable for it, image processing device and image processing method |
US6675185B1 (en) * | 2000-06-07 | 2004-01-06 | International Business Machines Corporation | Hybrid domain processing of multi-dimensional transformed data |
US6952451B2 (en) * | 2000-10-04 | 2005-10-04 | Sanyo Electric Co., Ltd. | Apparatus and method for decoding moving picture capable of performing simple and easy multiwindow display |
US20020039385A1 (en) * | 2000-10-04 | 2002-04-04 | Sanyo Electric Co., Ltd., | Apparatus and method for decoding moving picture capable of performing simple and easy multiwindow display |
US20040086039A1 (en) * | 2001-09-26 | 2004-05-06 | Interact Devices, Inc. | System and method for compressing portions of a media signal using different codecs |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9750788B2 (en) | 2013-12-13 | 2017-09-05 | Sanofi | Non-acylated exendin-4 peptide analogues |
Also Published As
Publication number | Publication date |
---|---|
CN1591319A (en) | 2005-03-09 |
TW200520536A (en) | 2005-06-16 |
TWI289992B (en) | 2007-11-11 |
US20050125469A1 (en) | 2005-06-09 |
CN1555199A (en) | 2004-12-15 |
TWI295787B (en) | 2008-04-11 |
CN1598876A (en) | 2005-03-23 |
CN1630373A (en) | 2005-06-22 |
US20110091124A1 (en) | 2011-04-21 |
CN1595994A (en) | 2005-03-16 |
CN1305313C (en) | 2007-03-14 |
TWI233267B (en) | 2005-05-21 |
TW200520399A (en) | 2005-06-16 |
CN1617594A (en) | 2005-05-18 |
US7558431B2 (en) | 2009-07-07 |
CN101060631A (en) | 2007-10-24 |
TWI240560B (en) | 2005-09-21 |
TW200520535A (en) | 2005-06-16 |
CN100531393C (en) | 2009-08-19 |
CN100539699C (en) | 2009-09-09 |
CN100527071C (en) | 2009-08-12 |
US20050125480A1 (en) | 2005-06-09 |
TW200519633A (en) | 2005-06-16 |
US20050123046A1 (en) | 2005-06-09 |
TWI227840B (en) | 2005-02-11 |
CN1282368C (en) | 2006-10-25 |
US20050152609A1 (en) | 2005-07-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20050125475A1 (en) | Circuit sharing of MPEG and JPEG on IDCT | |
US6411739B2 (en) | Image coding and decoding methods, image coding and decoding apparatuses, and recording media for image coding and decoding programs | |
JP2837819B2 (en) | Digital signal decoder system | |
US6411229B2 (en) | Variable length decoder | |
US7505631B2 (en) | Image coding and decoding methods, image coding and decoding apparatuses, and recording media for image coding and decoding programs | |
US6628717B1 (en) | Lossless coding method and video compression coding device using the same | |
US20020114528A1 (en) | Image processing apparatus, and image processing method | |
JPWO2003079692A1 (en) | Hierarchical encoding apparatus and decoding apparatus | |
US7280744B2 (en) | Video reproducing apparatus and reproducing method | |
CN1183766C (en) | Simplified logo insertion in encoded signal | |
JP2000151415A (en) | Data processing method/system/device, computer readable medium and program storage device | |
EP1173027B1 (en) | Methods and apparatus for nearly lossless concatenated block transform coding | |
JP2010135885A (en) | Image coding apparatus and method | |
US20070154102A1 (en) | Image decompression system, method and program | |
JPH02131671A (en) | Picture data compression method | |
KR100195187B1 (en) | Apparatus and method of compressing still image at steady compression rate | |
US20070192393A1 (en) | Method and system for hardware and software shareable DCT/IDCT control interface | |
US20220353524A1 (en) | Parallel forensic marking apparatus and method | |
US6717620B1 (en) | Method and apparatus for decompressing compressed data | |
JPH11313324A (en) | Processing method and device for compressed image data and for medium for storing compressed image data processing program | |
JP2003513563A (en) | Improved cascade compression method and system for digital video and images | |
JPH10136357A (en) | Coder, recoder and condign/decoding system | |
JP2004032262A (en) | Image combining apparatus | |
JP2004056459A (en) | Imformation signal processor, information signal processing method, iamge signal processor and image display, device and method generating correction data used therefor, program for each method, and computer readable medium recording program | |
JP2005333662A (en) | Coding instrument, decoding instrument, recoding instrument and coding method, decoding method, and recoding method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: VIA TECHNOLOGIES, INC., TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YEH, TING-KUN;WANG, ROY;WANG, DAVID;REEL/FRAME:016018/0465 Effective date: 20040715 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |