Coding method for increasing data compression efficiency in transmitting or storing picture signals

Claim 2

A coding method for increasing the compression efficiency of picture signal data in a coding apparatus, said coding apparatus comprising: controlling means for controlling said coding apparatus, first memory means for storing a coding table; second memory means for storing discrete cosine transform coefficients of said picture signal data and providing said discrete cosine transform coefficients to said controlling means; and zig-zag scanning means for addressing said discrete cosine transform coefficients stored in said second memory means in a zig-zag pattern, said coding method comprising: initializing run fields and a count; after initializing said run fields and said count, successively performing; zig-zag scanning and reading of said discrete cosine transform coefficients stored in said second memory means in response to said zig-zag scanning means, shifting said run fields by one bit, incrementing said run fields and said count by one if said discrete cosine transform coefficients are non-zero, and coding only non-zero discrete cosine transform coefficients on the basis of said coding table stored in said first memory means; after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, generating an end code indicating completion of the coding of said one sub-block; and after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, coding said run fields.

Claim 3

The coding method as claimed in claim 1, wherein said coding said discrete cosine transform coefficients comprises generating codes from said coding table corresponding to each of the non-zero discrete cosine transform coefficients and generating sign bits for each of said non-zero discrete cosine transform coefficients.

Claim 4

The coding method as claimed in claim 1, wherein said coding said run fields comprises removing invalid upper bits of said run fields and when said count is non-zero successively generating said run fields until all said run fields are generated.

Claim 5

The coding method as claimed in claim 1, wherein each of said codes from said coding table correspond to at least one possible value of said non-zero discrete cosine transform coefficients.

Claim 6

The coding method as claimed in claim 1, wherein each of said codes from said coding table correspond to a plurality of possible values of said non-zero discrete cosine transform coefficients.

Claim 7

The coding method as claimed in claim 1, wherein said coding said run fields occurs after generating said end code.

Claim 8

The coding method as claimed in claim 1, wherein successively generating said run fields comprises successively shifting out said run fields and decrementing said count by 1.

Claim 9

The coding method as claimed in claim 1, wherein a coding scheme embodied in said coding table is: ______________________________________ values of discrete cosine discrete cosine transform transform coefficients coefficients codes ______________________________________ ±(2-3) 100 ±(4-7) 101 ±(8-15) 110 ±(16-31) 1110 ±(32-63) 11110 ±(64-127) 111110 ±(128-255) 1111110 ±(256-511) 11111110 ±(512-1023) 111111110. ______________________________________

Claim 10

A coding method for increasing the compression efficiency of picture signal data, said coding method comprising: initializing run fields and a count; after initializing said run fields and said count, successively performing: zig-zag scanning and reading of discrete cosine transform coefficients, shifting said run fields by one bit, incrementing said run fields and said count by one if said discrete cosine transform coefficients are non-zero, and coding only non-zero discrete cosine transform coefficients on the basis of a coding table stored; after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, generating an end code indicating completion of the coding of said one sub-block; and after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, coding said run fields.

Claim 11

A coding method for increasing the compression efficiency of picture signal data, said coding method comprising: initializing run fields and a count; after initializing said run fields and said count, successively performing: zig-zag scanning and reading of discrete cosine transform coefficients, shifting said run fields by one bit, incrementing said run fields and said count by one if said discrete cosine transform coefficients are non-zero, and coding only non-zero discrete cosine transform coefficients on the basis of a coding table stored; after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, generating an end code indicating completion of the coding of said one sub-block; and after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, coding said run fields.

Claim 12

The coding method as claimed in claim 9, wherein said coding said discrete cosine transform coefficients comprises generating codes from said coding table corresponding to each of the non-zero discrete cosine transform coefficients and generating sign bits for each of said non-zero discrete cosine transform coefficients.

Claim 13

The coding method as claimed in claim 9, wherein said coding said run fields comprises removing invalid upper bits of said run fields and when said count is non-zero successively generating said run fields until all said run fields are generated.

Claim 14

The coding method as claimed in claim 9, wherein each of said codes from said coding table correspond to at least one possible value of said non-zero discrete cosine transform coefficients.

Claim 15

The coding method as claimed in claim 9, wherein each of said codes from said coding table correspond to a plurality of possible values of said non-zero discrete cosine transform coefficients.

Claim 16

The coding method as claimed in claim 9, wherein said coding said run fields occurs after generating said end code.

Claim 17

The coding method as claimed in claim 9, wherein successively generating said run field comprises successively shifting out said run fields and decrementing said count by 1.

Claim 18

The coding method as claimed in claim 9, wherein a coding scheme embodied in said coding table is: ______________________________________ values of discrete cosine discrete cosine transform transform coefficients coefficients codes ______________________________________ ±(2-3) 100 ±(4-7) 101 ±(8-15) 110 ±(16-31) 1110 ±(32-63) 11110 ±(64-127) 111110 ±(128-255) 1111110 ±(256-511) 11111110 ±(512-1023) 111111110. ______________________________________

Claim 19

A coding apparatus performing a coding method for increasing the compression efficiency of picture signal data, said coding apparatus comprising: controlling means for controlling said coding apparatus; first memory means for storing a coding table; second memory means for storing discrete cosine transform coefficients of said picture signal data and providing said discrete cosine transform coefficients to said controlling means; and zig-zag scanning means for addressing said discrete cosine transform coefficients stored in said second memory means in a zig-zag pattern; wherein said coding method comprises: initializing run fields and a count; after initializing said run fields and said count, successively performing: zig-zag scanning and reading of said discrete cosine transform coefficients stored in said second memory means in response to said zig-zag scanning means, shifting said run fields by one bit, incrementing said run fields and said count by one if said discrete cosine transform coefficients are non-zero, and coding only non-zero discrete cosine transform coefficients on the basis of said coding table stored in said first memory means; after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, generating and end code indicating completion of the coding of said one sub-block; and after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, coding said run fields.

Claim 20

A coding apparatus performing a coding method for increasing the compression efficiency of picture signal data, said coding apparatus comprising: controlling means for controlling said coding apparatus; first memory means for storing a coding table; second memory means for storing discrete cosine transform coefficients of said picture signal data and providing said discrete cosine transform coefficients to said controlling means; and zig-zag scanning means for addressing said discrete cosine transform coefficients stored in said second memory means in a zig-zag pattern; wherein said coding method comprises: initializing run fields and a count; after initializing said run fields and said count, successively performing: zig-zag scanning and reading of said discrete cosine transform coefficients stored in said second memory means in response to said zig-zag scanning means, shifting said run fields by one bit, incrementing said run fields and said count by one if said discrete cosine transform coefficients are non-zero, and coding only non-zero discrete cosine transform coefficients on the basis of said coding table stored in said first memory means; after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, generating and end code indicating completion of the coding of said one sub-block; and after successively performing said coding of said non-zero discrete cosine transform coefficients so that one sub-block has been coded, coding said run fields.

Claim 21

The coding apparatus as claimed in claim 17, wherein said coding said discrete cosine transform coefficients comprises generating codes from said coding table corresponding to each of the non-zero discrete cosine transform coefficients and generating sign bits for each of said non-zero discrete cosine transform coefficients.

Claim 22

The coding apparatus as claimed in claim 17, wherein said coding said run fields comprises removing invalid upper bits of said run fields and when said count is non-zero successively generating said run fields until all said run fields are generated.

Claim 23

The coding apparatus as claimed in claim 17, wherein each of said codes from said coding table correspond to at least one possible value of said non-zero discrete cosine transform coefficients.

Claim 24

The coding apparatus as claimed in claim 17, wherein each of said codes from said coding table correspond to a plurality of possible values of said non-zero discrete cosine transform coefficients.

Claim 25

The coding apparatus as claimed in claim 17, wherein said coding said run fields occurs after generating said end code.

Claim 26

The coding apparatus as claimed in claim 17, wherein successively generating said run fields comprises successively shifting out said run fields and decrementing said count by 1.

Claim 27

The coding apparatus as claimed in claim 17, wherein a coding scheme embodied in said coding table is: ______________________________________ values of discrete cosine discrete cosine transform transform coefficients coefficients codes ______________________________________ ±(2-3) 100 ±(4-7) 101 ±(8-15) 110 ±(16-31) 1110 ±(32-63) 11110 ±(64-127) 111110 ±(128-255) 1111110 ±(256-511) 11111110 ±(512-1023) 111111110. ______________________________________