Coding method, coding apparatus, wavelet transform apparatus, and wavelet reverse transform apparatus

Claim 2

A coding method comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers arranged in an order according to priority in a code sequence; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; and a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step.

Claim 3

A coding method comprising: a hierarchical coding step of performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control step of storing a code layer having the highest priority among the code layers in the respective code sequences in a code storage means, and storing other code layers in a temporary storage means; and a transfer judge step of transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means, from the temporary storage means to the code storage means.

Claim 4

A coding method comprising: a hierarchical coding step of performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control step of storing a code layer having the highest priority among the code layers in the respective code sequences in a code storage means, and storing other code layers in a temporary storage means; and a transfer judge step of transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means, from the temporary storage means to the code storage means.

Claim 5

A coding method comprising: a sampling step of sampling fields of an image signal with a designated time interval; a hierarchical coding step of performing hierarchical coding for the image signal data sampled in the sampling step; raising a code quantity to a prescribed quantity when the code quantity is lower than the prescribed quantity; controlling a sampling rate in accordance with the code quantity; a memory capacity calculating step of calculating a memory capacity used in the hierarchical coding step; a memory capacity raising step of raising the memory capacity to a prescribed lowest limit value when the calculated memory capacity is lower that the lowest limit value; a field interval calculating step of calculating a field interval in proportion to the calculated memory capacity; and a step of designating the calculated field interval for the sampling step.

Claim 6

A coding method comprising: a sampling step of sampling fields of an image signal with a designated time interval; a hierarchical coding step of performing hierarchical coding for the image signal data sampled in the sampling step; raising a code quantity to a prescribed quantity when the code quantity is lower than the prescribed quantity; controlling a sampling rate in accordance with the code quantity; a memory capacity calculating step of calculating a memory capacity used in the hierarchical coding step; a memory capacity raising step of raising the memory capacity to a prescribed lowest limit value when the calculated memory capacity is lower that the lowest limit value; a field interval calculating step of calculating a field interval in proportion to the calculated memory capacity; and a step of designating the calculated field interval for the sampling step.

Claim 7

A coding method as defined in claim 3 further comprising: a raising detection step of detecting that the memory capacity is raised in the memory capacity raising step; and a step of controlling the hierarchical coding so that the code amount is increased, when the raising detection step detects the raising of the memory capacity.

Claim 8

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate first and second code sequences, each comprising a plurality of code layers arranged in an order according to priority in a code sequence; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; and a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means.

Claim 9

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate first and second code sequences, each comprising a plurality of code layers arranged in an order according to priority in a code sequence; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; and a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means.

Claim 10

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control means for storing a code layer, which has the highest priority among the code layers in the respective code sequences, in a code storage means, and storing other code layers in a temporary storage means; and a transfer judge means for transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means, from the temporary storage means to the code storage means.

Claim 11

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control means for storing a code layer, which has the highest priority among the code layers in the respective code sequences, in a code storage means, and storing other code layers in a temporary storage means; and a transfer judge means for transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means, from the temporary storage means to the code storage means.

Claim 12

A coding apparatus comprising: a sampling means for sampling fields of an image signal with a designated time interval; a hierarchical coding means for performing hierarchical coding for the image signal data sampled in the sampling steps, said hierarchical coding means raising a code quantity to a prescribed quantity when the code quantity is lower than the prescribed quantity, said sampling means controlling a sampling rate in accordance with the code quantity; a memory capacity calculating means for calculating a memory capacity used in the hierarchical coding step; a memory capacity raising means for raising the memory capacity to a prescribed lowest limit value when the calculated memory capacity is lower than the lowest limit value; a field interval calculating means for calculating a field interval in proportion to the calculated memory capacity; and means for designating the calculated field interval for the sampling step.

Claim 13

A coding apparatus comprising: a sampling means for sampling fields of an image signal with a designated time interval; a hierarchical coding means for performing hierarchical coding for the image signal data sampled in the sampling steps, said hierarchical coding means raising a code quantity to a prescribed quantity when the code quantity is lower than the prescribed quantity, said sampling means controlling a sampling rate in accordance with the code quantity; a memory capacity calculating means for calculating a memory capacity used in the hierarchical coding step; a memory capacity raising means for raising the memory capacity to a prescribed lowest limit value when the calculated memory capacity is lower than the lowest limit value; a field interval calculating means for calculating a field interval in proportion to the calculated memory capacity; and means for designating the calculated field interval for the sampling step.

Claim 14

A coding apparatus as defined in claim 7 further comprising: a raising detection means for detecting that the memory capacity in raised in the memory capacity raising step; and means for controlling the hierarchical coding so that the code amount is increased, when the raising detection step detects the raising of the memory capacity.

Claim 15

A coding method, comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, the first code sequence being stored in the code storage means prior to the second code sequence; and a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step, a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence being judged, and when the storage region does not have a sufficient capacity for the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence.

Claim 16

A coding method, comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, the first code sequence being stored in the code storage means prior to the second code sequence; and a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step, a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence being judged, and when the storage region does not have a sufficient capacity for the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence.

Claim 17

A coding method, comprising: a hierarchical coding step of performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control step of storing a code layer having the highest priority among the code layers in the respective code sequences in a code storage means, and storing other code layers in a temporary storage means; a transfer judge step of transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means, from the temporary storage means to the code storing means; a region control step of assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage control step storing the plural code sequences in the assigned memory region; a code transfer step of filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a step of recovering a region in the assigned storage region, which region is not used for the storage.

Claim 18

A coding method, comprising: a hierarchical coding step of performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control step of storing a code layer having the highest priority among the code layers in the respective code sequences in a code storage means, and storing other code layers in a temporary storage means; a transfer judge step of transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means, from the temporary storage means to the code storing means; a region control step of assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage control step storing the plural code sequences in the assigned memory region; a code transfer step of filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a step of recovering a region in the assigned storage region, which region is not used for the storage.

Claim 19

A coding apparatus, comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, said storage control means storing the first code sequence in the code storage means prior to the second code sequence; and a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means, said priority judge means judging a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence, and when the storage region does not have a sufficient capacity for storing the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence.

Claim 20

A coding apparatus, comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, said storage control means storing the first code sequence in the code storage means prior to the second code sequence; and a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means, said priority judge means judging a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence, and when the storage region does not have a sufficient capacity for storing the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence.

Claim 21

A coding apparatus, comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control means for storing a code layer, which has the highest priority among the code layers in the respective code sequences, in a code storage means, and storing other code layers in a temporary storage means; a transfer judge means for transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means from the temporary storage means to the code storing means; a region control means for assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage control means storing a plurality of code sequences in the assigned memory region; a code transfer means for filling a vacancy in the storage region between the stored code sequences by transferring one of the code sequences to the vacancy; and a region recover means for recovering a region in the assigned storage region, which region is not used for the storage.

Claim 22

A coding apparatus, comprising: a hierarchical coding means for performing hierarchical coding for data to be coded to generate at least two code sequences, each comprising a plurality of code layers; a storage control means for storing a code layer, which has the highest priority among the code layers in the respective code sequences, in a code storage means, and storing other code layers in a temporary storage means; a transfer judge means for transferring, according to priority, the code layers in the respective code sequences stored in the temporary storage means from the temporary storage means to the code storing means; a region control means for assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage control means storing a plurality of code sequences in the assigned memory region; a code transfer means for filling a vacancy in the storage region between the stored code sequences by transferring one of the code sequences to the vacancy; and a region recover means for recovering a region in the assigned storage region, which region is not used for the storage.

Claim 23

A coding method comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step; a region control step of assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage step storing the plural code sequences in the assigned memory region; a code transfer step of filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a step of recovering a region in the assigned storage region, which region is not used for the storage.

Claim 24

A coding method comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step; a region control step of assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage step storing the plural code sequences in the assigned memory region; a code transfer step of filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a step of recovering a region in the assigned storage region, which region is not used for the storage.

Claim 25

A coding method comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, the first code sequence being stored in the code storage means prior to the second code sequence; a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step, a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence being judged, and when the storage region does not have a sufficient capacity for the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence; a region control step of assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage step of storing the plural code sequences in the assigned memory region; a code transfer step of filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a step of recovering a region in the assigned storage region, which region is not used for the storage.

Claim 26

A coding method comprising: a hierarchical coding step of performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control step of storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, the first code sequence being stored in the code storage means prior to the second code sequence; a priority judge step of storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control step, a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence being judged, and when the storage region does not have a sufficient capacity for the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence; a region control step of assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage step of storing the plural code sequences in the assigned memory region; a code transfer step of filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a step of recovering a region in the assigned storage region, which region is not used for the storage.

Claim 27

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means; a region control means for assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage means for storing the plurality of code sequences in the assigned memory region; a code transfer means for filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a region recover means for recovering a region in the assigned storage region, which region is not used for the storage.

Claim 28

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers; a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means; a region control means for assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage means for storing the plurality of code sequences in the assigned memory region; a code transfer means for filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a region recover means for recovering a region in the assigned storage region, which region is not used for the storage.

Claim 29

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, said storage control means storing the first code sequence in the code storage means prior to the second code sequence; a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means, said priority judge means judging a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence, and when the storage region does not have a sufficient capacity for storing the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence; a region control means for assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage means for storing the plural code sequences in the assigned memory region; a code transfer means for filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a region recover means for recovering a region in the assigned storage region, which region is not used for the storage.

Claim 30

A coding apparatus comprising: a hierarchical coding means for performing hierarchical coding of data to be coded to generate first and second code sequences, each comprising a plurality of code layers; a storage control means for storing the first and second code sequences in a storage region of a code storage means having successive addresses, respectively from opposed ends of the storage region, according to priority given to the code layers, said storage control means storing the first code sequence in the code storage means prior to the second code sequence; a priority judge means for storing a code layer in either of the first and second code sequences, which code layer has the highest priority at present, prior to the other code sequence, when an overlap occurs in the storage control means, said priority judge means judging a code layer in the first code sequence which is lower in priority than a code layer in the second code sequence, and when the storage region does not have a sufficient capacity for storing the code layer in the second code sequence, a code layer in the second code sequence is written over the judged code layer in the first code sequence; a region control means for assigning a storage region of a prescribed size from the successive storage regions in the code storage means; said storage means for storing the plural code sequences in the assigned memory region; a code transfer means for filling a vacancy in the storage region between the stored code sequences, by transferring one of the code sequences to the vacancy; and a region recover means for recovering a region in the assigned storage region, which region is not used for the storage.