← Back to Patent Explorer
US5675383A Expired / Lapsed US ⏱️ 0.0 years remaining

Encoding method, encoding unit, decoding method, decoding unit, recording medium, and transmission method

Assignee: Sony Corp
•
Filing: 1996-04-24
•
Granted: 1997-10-07
•
Expires: 2016-04-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An improvement in solving the problem of the wraparound state. A moving image is coded in an encoder. The resulting coded data is supplied to a buffer through a multiplexor and stored in the buffer. The address used for storing the coded data in the buffer is generated in an address controller. The coded data supplied from the encoder is combined with the address in the multiplexor in a multiplexing manner.

Inventors

  • 👤 Yoichi Yagasaki
  • 👤 Hideki Koyanagi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 05:11
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/20; H04N21/23; H04N21/236; H04N19/00; H04N19/10; H04N19/102; H04N19/134; H04N19/146; H04N19/152; H04N19/42; H04N19/423; H04N19/46; H04N19/60; H04N19/61; H04N21/40; H04N21/43; H04N21/434; H04N19/50

Claims Analysis

Total Claims: 29
Claim 1
Independent Claim 98 words
A moving-image coding method comprising the steps of: performing a predetermined coding operation on an input moving-image signal to generate coded data; receiving information pertaining to first and second portions of the coded data to be stored in storage means and generating respective write addresses representing the positions in which said first and second portions of the coded data are to be written into said storage means so as not to cause a wraparound condition to occur in said storage means; and combining said coded data with said writing addresses in a multiplexing manner to generate multiplexed data.
Claim 2
Dependent Claim 98 words
A moving-image coding method comprising the steps of: performing a predetermined coding operation on an input moving-image signal to generate coded data; receiving information pertaining to first and second portions of the coded data to be stored in storage means and generating respective write addresses representing the positions in which said first and second portions of the coded data are to be written into said storage means so as not to cause a wraparound condition to occur in said storage means; and combining said coded data with said writing addresses in a multiplexing manner to generate multiplexed data.
Claim 3
Dependent Claim 37 words
A moving-image coding method according to claim 1, wherein said writing addresses are generated in such a manner that addresses of said storage means are consecutively arranged between the writing start address and the writing end address.
Claim 4
Dependent Claim 31 words
A moving-image coding method according to claim 1, wherein said writing addresses are generated in such a manner that the writing end address is always greater than the writing start address.
Claim 5
Dependent Claim 41 words
A moving-image coding method according to claim 1, wherein the receiving and generating step includes determining whether the amount of said coded data fits into the available capacity of said storage means, and upon this determination, determining the respective writing address.
Claim 6
Dependent Claim 40 words
A moving-image coding method according to claim 4, wherein the respective writing address is generated in such a manner that the writing end address is always greater than the writing start address within the available capacity of said storage means.
Claim 7
Dependent Claim 56 words
A moving-image coding method according to claim 1, further comprising the steps of: generating reading addresses for reading from said storage means the stored coded data; and writing said coded data into said storage means according to the respective writing addresses and reading from said storage means the stored coded data according to said reading addresses.
Claim 8
Dependent Claim 38 words
A moving-image coding method according to claim 6, wherein the rate at which said coded data is read from said storage means is higher than the rate at which said coded data is written into said storage means.
Claim 9
Dependent Claim 119 words
A moving-image coding unit comprising: coding means for performing a coding operation on an input moving-image signal to generate coded data; storage means having a predetermined storage capacity for storing said coded data; address generating means for receiving information pertaining to first and second portions of the coded data to be stored in said storage means and for generating respective write addresses representing the positions in which said first and second portions of the coded data are to be written into said storage means so as not to cause a wraparound condition to occur in said storage means; and multiplexed-data generating means for combining said coded data with said writing addresses in a multiplexing manner to generate multiplexed data.
Claim 10
Dependent Claim 119 words
A moving-image coding unit comprising: coding means for performing a coding operation on an input moving-image signal to generate coded data; storage means having a predetermined storage capacity for storing said coded data; address generating means for receiving information pertaining to first and second portions of the coded data to be stored in said storage means and for generating respective write addresses representing the positions in which said first and second portions of the coded data are to be written into said storage means so as not to cause a wraparound condition to occur in said storage means; and multiplexed-data generating means for combining said coded data with said writing addresses in a multiplexing manner to generate multiplexed data.
Claim 11
Dependent Claim 40 words
A moving-image coding unit according to claim 8, wherein said address generating means generates said writing addresses in such a manner that addresses of said storage means are consecutively arranged between the writing start address and the writing end address.
Claim 12
Dependent Claim 34 words
A moving-image coding unit according to claim 8, wherein said address generating means generates said writing addresses in such a manner that the writing end address is always greater than the writing start address.
Claim 13
Dependent Claim 39 words
A moving-image coding unit according to claim 8, wherein said address generating means determines whether the amount of said coded data fits into the available capacity of said storage means, and upon this determination, determines the respective writing address.
Claim 14
Dependent Claim 40 words
A moving-image coding unit according to claim 11, wherein the respective writing address is generated in such a manner that the writing end address is always greater than the writing start address within the available capacity of said storage means.
Claim 15
Dependent Claim 61 words
A moving-image coding unit according to claim 8, wherein said address generating means includes means for generating reading addresses for reading from said storage means the stored coded data and means for writing said coded data into said storage means according to the respective writing addresses and reading from said storage means the stored coded data according to said reading addresses.
Claim 16
Dependent Claim 38 words
A moving-image coding unit according to claim 13, wherein the rate at which said coded data is read from said storage means is higher than the rate at which said coded data is written into said storage means.
Claim 17
Dependent Claim 119 words
A moving-image decoding method for decoding coded data including predetermined control information, comprising the steps of: separating said predetermined control information and coded moving-image data from said coded data, said control information including writing addresses representing the respective positions in which first and second portions of said coded moving-image data are to be written into storage means so as not to cause a wraparound condition to occur in said storage means; writing said coded moving-image data into said storage means according to said writing addresses; reading said coded moving-image data from said storage means after said data has been stored in said storage means; and decoding said coded moving-image data read from said storage means to generate moving-image data.
Claim 18
Dependent Claim 119 words
A moving-image decoding method for decoding coded data including predetermined control information, comprising the steps of: separating said predetermined control information and coded moving-image data from said coded data, said control information including writing addresses representing the respective positions in which first and second portions of said coded moving-image data are to be written into storage means so as not to cause a wraparound condition to occur in said storage means; writing said coded moving-image data into said storage means according to said writing addresses; reading said coded moving-image data from said storage means after said data has been stored in said storage means; and decoding said coded moving-image data read from said storage means to generate moving-image data.
Claim 19
Dependent Claim 37 words
A moving-image decoding method according to claim 15, wherein said writing addresses are set in such a manner that addresses of said storage means are consecutively arranged between the writing start address and the writing end address.
Claim 20
Dependent Claim 32 words
A moving-image decoding method according to claim 15, wherein said writing addresses are set in such a manner that each respective writing end address is always greater than the writing start address.
Claim 21
Dependent Claim 41 words
A moving-image decoding method according to claim 3, wherein a determination is made as to whether the amount of said coded data fits into the available capacity of said storage means, and upon this determination, the respective writing address is set.
Claim 22
Dependent Claim 40 words
A moving-image decoding method according to claim 18, wherein the respective writing address is set in such a manner that the writing end address is always greater than the writing start address within the available capacity of said storage means.
Claim 23
Dependent Claim 58 words
A moving-image decoding method according to claim 15, further comprising the step of generating reading addresses for reading from said storage means the stored coded data, wherein said coded data is written into said storage means according to the respective writing addresses and said stored coded data is read from said storage means according to said reading addresses.
Claim 24
Dependent Claim 38 words
A moving-image decoding method according to claim 20, wherein the rate at which said coded data is read from said storage means is higher than the rate at which said coded data is written into said storage means.
Claim 25
Dependent Claim 133 words
A moving-image decoding unit for decoding coded data including predetermined control information, comprising: storage means for temporarily storing data; separation means for separating said control information and coded moving-image data from said coded data, said control information including writing addresses representing the respective positions in which first and second portions of said coded moving-image data are to be written into said storage means so as not to cause a wraparound condition to occur in said storage means; writing means for writing said coded moving-image date into said storage means according to said writing addresses; reading means for reading said coded moving-image data from said storage means after the data has been stored in said storage means; and means for decoding said coded moving-image data read from said storage means to generate moving-image data.
Claim 26
Dependent Claim 133 words
A moving-image decoding unit for decoding coded data including predetermined control information, comprising: storage means for temporarily storing data; separation means for separating said control information and coded moving-image data from said coded data, said control information including writing addresses representing the respective positions in which first and second portions of said coded moving-image data are to be written into said storage means so as not to cause a wraparound condition to occur in said storage means; writing means for writing said coded moving-image date into said storage means according to said writing addresses; reading means for reading said coded moving-image data from said storage means after the data has been stored in said storage means; and means for decoding said coded moving-image data read from said storage means to generate moving-image data.
Claim 27
Dependent Claim 113 words
A recording medium in which coded data is recorded for use with an encoding unit and/or a decoding unit, comprising: a header section for recording control data for controlling said coded data; and a data section for recording said coded data and writing addresses in a multiplexing manner, each of said writing addresses represents a respective position in which a portion of said coded data is written into storage means provided in the appropriate one of the encoding unit or the decoding unit such that first and second portions of the coded data are written into said storage means so as not to cause a wraparound condition to occur in said storage means.
Claim 28
Dependent Claim 113 words
A recording medium in which coded data is recorded for use with an encoding unit and/or a decoding unit, comprising: a header section for recording control data for controlling said coded data; and a data section for recording said coded data and writing addresses in a multiplexing manner, each of said writing addresses represents a respective position in which a portion of said coded data is written into storage means provided in the appropriate one of the encoding unit or the decoding unit such that first and second portions of the coded data are written into said storage means so as not to cause a wraparound condition to occur in said storage means.
Claim 29
Dependent Claim 21 words
A moving-image coding method according to claim 1, further comprising the step of transmitting said multiplexed data to a transmission channel.

References Cited (Backward Citations)

US5475499A Cited
US5134475A Cited
US5432769A Cited
US5459516A Cited
US5537156A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-10-06 2001-04-07 2001-10-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-10-06 2005-04-07 2005-10-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-10-06 2009-04-07 2009-10-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag