Decoding and regenerating device for decoding and regenerating frame coded data and method therefor

• US 5,880,686 A
• Filed: 08/27/1997
• Issued: 03/09/1999
• Est. Priority Date: 08/29/1996
• Status: Expired due to Fees

• Current Assignee: NEC Electronics Corporation (Renesas Electronics Corporation)
• Original Assignee: NEC Corporation
• Inventors: Morimoto, Kouichi
• Primary Examiner(s): Hoff, Marc S.
• Assistant Examiner(s): JEAN PIERRE, PEGUY
• Application Number:
  US08/917,724
• Time in Patent Office: 559 Days
• Field of Search: 341/50, 341/106, 370/441, 370/442, 370/464
• US Class Current: 341/50
• CPC Class Codes: H04N 19/423 characterised by memory arrangements H04N19/433 takes precedence
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 21/426 Internal components of the client ; Characteristics thereof H04N5/44 takes precedence
• CPC Class Codes: H04N 21/4347 Demultiplexing of several video streams
• CPC Class Codes: H04N 21/4435 Memory management allocation of memory to service a request G06F9/5016; addressing or allocating within memory systems or architectures G06F12/02
• CPC Class Codes: H04N 5/45 Picture in picture , e.g. displaying simultaneously another television channel in a region of the screen
• CPC Class Codes: H04N 5/50 Tuning indicators; Automatic tuning control
• CPC Class Codes: H04N 5/907 using static stores, e.g. storage tubes or semiconductor memories H04N5/91 takes precedence

Abstract

A decoding and regenerating device for frame coded data comprises a decoding unit which decodes frame coded data which is obtained by coding time series signals of a plurality of channels by entering on a frame-by-frame basis at every channel; a regenerative data buffer memory which places memory blocks to form a square matrix of rows and columns in number corresponding to the number of channels and selects alternately in every frame period a first data arrangement that regenerative data for one frame of the respective channels is stored in every row of the square matrix and a second data arrangement that regenerative data for one frame of the respective channels is stored in every column, to store the regenerative data as a stored state of the regenerative data; and a data regenerating unit for reading to regenerate the regenerative data which is stored in the regenerative data buffer memory.

Claims

1. A decoding and regenerating device for frame coded data which samples time series signals of a plurality of parallel channels, determines a given time interval as a single frame period, obtains frame coded data by coding as a single unit a plurality of samples which are contained in the frame in every single frame period on a channel-by-channel basis, and decodes to simultaneously regenerate the frame coded data of the plurality of channels, comprising:

a decoding means for decoding said frame coded data by inputting every channel of said time series signals on a frame-by-frame basis;

a temporary storing means for temporarily storing regenerative data for one frame of a single channel which is decoded by said decoding means;

a regenerative data storing means which places memory blocks, which have memory spaces for the number of words substantially corresponding to a quotient obtained by dividing the number of samples of said time series signals per frame by the number of channels of said time series signals, to form a square matrix of rows and columns in number corresponding to the number of channels of said time series signals, and selects alternately in every frame period a first data arrangement that the regenerative data for one frame of said respective channels is stored in every row of said square matrix as a stored state of said regenerative data and a second data arrangement that regenerative data for one frame of said respective channels is stored in every column, to sequentially read to store said regenerative data which is stored in said temporary storing means; and

a data regenerating means for reading said regenerative data which is stored in said regenerative data storing means and regenerating said regenerative data for all channels simultaneously.

2. The decoding and regenerating device for frame coded data as set forth in claim 1, wherein

when the number of samples of said time series signals per frame is not a multiple of the number of channels of said time series signals, said respective memory blocks of said regenerative data storing means adjusts the number of words in an address space among said plurality of memory blocks so to have address spaces for the number of words which correspond to the number of samples of said time series signals per frame by said memory blocks as a whole to configure a given row or column.

3. The decoding and regenerating device for frame coded data as set forth in claim 1, wherein

when said regenerative data is stored in said regenerative data storing means by said first data arrangement, said data regenerating means reads to regenerate said regenerative data which is stored in said memory blocks in the same columns of respective rows in the order from said first column of said square matrix of said memory blocks in said regenerative data storing means, and said regenerative data storing means repeats the processing of storing said regenerative data for one frame of a single channel stored in said temporary storing means into said memory blocks of the column from which reading by said data regenerating means has completed, up to the final column of said square matrix of said memory blocks in said regenerative data storing means;

and

when said regenerative data is stored in said regenerative data storing means by the second data arrangement, said data regenerating means reads to regenerate said regenerative data which is stored in said memory blocks in the same columns of respective rows in the order from the first column of said square matrix of said memory blocks in said regenerative data storing means, and said regenerative data storing means repeats the processing of storing said regenerative data for one frame of a single channel which is stored in said temporary storing means into said memory blocks of the row from which reading by said data regenerating means has completed, up to the final column of said square matrix of said memory blocks in said regenerative data storing means.

4. A decoding and regenerating method for frame coded data which samples time series signals of a plurality of parallel channels, determines a given time interval as a single frame period, obtains frame coded data by coding as a single unit a plurality of samples which are contained in said frame in every single frame period on a channel-by-channel basis, and decodes to simultaneously regenerate said frame coded data of said plurality of channels, comprising the steps of:

a step for decoding said frame coded data by inputting every channel of said time series signals on a frame-by-frame basis;

a step for temporarily storing regenerative data for one frame of a single channel which is decoded by said decoding step;

a step for regenerating by selecting alternately in every frame period a first data arrangement that said regenerative data for one frame of said respective channels is stored in every row of said square matrix as a stored state of said regenerative data and a second data arrangement that said regenerative data for one frame of said respective channels is stored on column-by-column basis, to store said regenerative data which is held by said temporary storing step into a regenerative data storing means in that memory blocks, which have memory spaces for the number of words substantially corresponding to a quotient obtained by dividing the number of samples of said time series signals per frame by the number of channels of said time series signals, are placed to form a square matrix of rows and columns in number corresponding to the number of channels of said time series signals, and sequentially reading said regenerative data which is stored in said regenerative data storing means to regenerate said regenerative data for all channels simultaneously.

5. The decoding and regenerating method for frame coded data as set forth in claim 4, wherein

when said regenerative data is stored in said regenerative data storing means by the first data arrangement, said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same columns of respective rows in the order from the first column of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the column from which reading has completed in said regenerative data storing means, up to the final column of said square matrix of said memory blocks in said regenerative data storing means;

and

when said regenerative data is stored by the second data arrangement into said regenerative data storing means, said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same rows of respective columns in the order from the first row of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the row from which reading has completed in said regenerative data storing means, up to the final row of said square matrix of said memory blocks in said regenerative data storing means.

6. The decoding and regenerating method for frame coded data as set forth in claim 4, wherein

when said regenerative data is stored in said regenerative data storing means by the first data arrangement, said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same columns of respective rows in the order from the first column of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the column from which reading has completed in said regenerative data storing means, up to the final column of said square matrix of said memory blocks in said regenerative data storing means, and

when said regenerative data is stored by the second data arrangement into said regenerative data storing means, said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same rows of respective columns in the order from the first row of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the row from which reading has completed in said regenerative data storing means, up to the final row of said square matrix of said memory blocks in said regenerative data storing means;

and further

in parallel with said step for reading to regenerate said regenerative data on a columnby-column or row-by-row basis from said regenerative data storing means in said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating, performs said decoding step and said temporary storing step on frame coded data in the next frame period of the frame under processing by said pertinent step.

7. A computer readable memory which stores therein a computer program for controlling a decoding and regenerating device for frame coded data which comprises sampling time series signals of a plurality of parallel channels, determining a given time interval as a single frame period, obtaining frame coded data by coding as a single unit a plurality of samples which are contained in the frame in every single frame period on a channel-by-channel basis, and decoding to regenerate said frame coded data of said plurality of channels simultaneously, wherein the computer program comprising the following steps:

a step for decoding said frame coded data by inputting every channel of said time series signals on a frame-by-frame basis;

a step for temporarily storing said regenerative data for one frame of a single channel which is decoded by said decoding step;

a step for regenerating by selecting alternately in every frame period a first data arrangement that said regenerative data for one frame of said respective channels is stored in every row of said square matrix as a stored state of said regenerative data and a second data arrangement that said regenerative data for one frame of said respective channels is stored on a column-by-column basis, to store said regenerative data which is held by said temporary storing step into a regenerative data storing means in that memory blocks, which have memory spaces for the number of words substantially corresponding to a quotient obtained by dividing the number of samples of said time series signals per frame by the number of channels of said time series signals, are placed to form a square matrix of rows and columns in number corresponding to the number of channels of said time series signals, and sequentially reading said regenerative data which is stored in said regenerative data storing means to regenerate said regenerative data for all channels simultaneously.

8. The computer readable memory as set forth in claim 7, wherein

when said regenerative data is stored in said regenerative data storing means by the first data arrangement, said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating according to the computer program repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same columns of respective rows in the order from the first column of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the column from which reading has completed by said regenerative data storing means, up to the final column of said square matrix of said memory blocks in said regenerative data storing means;

and

when said regenerative data is stored by the second data arrangement into said regenerative data storing means, said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating according to the computer program repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same rows of respective columns in the order from the first row of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the row from which reading has completed in said regenerative data storing means, up to the final row of said square matrix of said memory blocks in said regenerative data storing means.

9. The computer readable memory as set forth in claim 7, wherein

when said regenerative data is stored in said regenerative data storing means by the first data arrangement, said step for storing said regenerative data into said regeneration storing means and sequentially regenerating according to the computer program repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same columns of respective rows in the order from the first column of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the column from which reading has completed in said regenerative data storing means, up to the final column of said square matrix of said memory blocks in said regenerative data storing means;

and

when said regenerative data is stored by the second data arrangement into said regenerative data storing means, said step for storing said regenerative data into said regeneration storing means and sequentially regenerating according to the computer program repeats following steps,

a step for reading to regenerate said regenerative data which is stored in said memory blocks of the same rows of respective columns in the order from the first row of said square matrix of memory blocks in said regenerative data storing means, and

a step for storing said regenerative data for one frame of a single channel held by said temporary storing step into said memory blocks of the row from which reading has completed in said regenerative data storing means, up to the final row of said square matrix of said memory blocks in said regenerative data storing means; and

further

in parallel with said step for reading to regenerate said regenerative data on a columnby-by-column or row-by-row basis from said regenerative data storing means in said step for storing said regenerative data into said regenerative data storing means and sequentially regenerating, performs said decoding step and said temporary storing step on frame coded data in the next frame period of the frame under processing by the pertinent step.