CN1434634A - Compressed data processor for assembly transmission data package system - Google Patents
Compressed data processor for assembly transmission data package system Download PDFInfo
- Publication number
- CN1434634A CN1434634A CN02120437A CN02120437A CN1434634A CN 1434634 A CN1434634 A CN 1434634A CN 02120437 A CN02120437 A CN 02120437A CN 02120437 A CN02120437 A CN 02120437A CN 1434634 A CN1434634 A CN 1434634A
- Authority
- CN
- China
- Prior art keywords
- word
- data
- packet
- bag
- title
- 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.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims description 27
- 239000000872 buffer Substances 0.000 claims description 21
- 238000000034 method Methods 0.000 claims description 11
- 238000012545 processing Methods 0.000 abstract description 7
- 238000010276 construction Methods 0.000 abstract description 2
- 238000007906 compression Methods 0.000 description 14
- 230000006835 compression Effects 0.000 description 14
- 230000011218 segmentation Effects 0.000 description 13
- 230000015572 biosynthetic process Effects 0.000 description 6
- 235000019557 luminance Nutrition 0.000 description 6
- 230000004044 response Effects 0.000 description 5
- 230000001360 synchronised effect Effects 0.000 description 5
- 239000011159 matrix material Substances 0.000 description 4
- 230000000007 visual effect Effects 0.000 description 4
- 238000009825 accumulation Methods 0.000 description 3
- 239000003638 chemical reducing agent Substances 0.000 description 3
- 238000012937 correction Methods 0.000 description 3
- 239000003550 marker Substances 0.000 description 3
- 238000013144 data compression Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000013139 quantization Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 210000005036 nerve Anatomy 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
-
- 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
-
- 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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Color Television Systems (AREA)
- Television Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Editing Of Facsimile Originals (AREA)
Abstract
In a digital television signal processing system, a special codeword, a Packet Alignment Flag (PAF) (14), is inserted into an MPEG codeword bitstream to signify the presence of a Group of Pictures (GOP). The PAF immediately precedes a Picture Start codeword for an 'I' frame, which initiates a GOP. A data packet (12) under construction when a PAF (14) appears is terminated since a GOP is intended to begin at a packet boundary. Such termination may result in an abbreviated packet of less than a prescribed number of codewords needed to complete a data packet. The last word of each packet is designated as such to facilitate the subsequent combining of data packets (12) with respective headers (18). An incomplete data packet is filled with null (zeroed bits) words to make up a complete data packet with a prescribed number of words.
Description
The present invention relates to digital processing field, be contained in the method and apparatus of data flow that (for example) high-definition television system transmits the transmission bag of encoded MPEG formula data more specifically to being used for pack processing.
People's United States Patent (USP)s such as Acampora 5,168,356 described a kind of be used to handle must can answer the system of high definition TV (HDTV) signal of length coding through the MPEG formula.MPEG is the coded format by a kind of standard of circle mark standardization body foundation.This standard to describe is in document " International Standards Organization ", in be applicable to digital storage media ISO/IEC DIS 11172 (revision on November 23rd, the 1991) standard of mobile image and the coding of companion's chapter, this document is incorporated herein, participate-reform during for the general coded format of explanation.In this system of people such as Acapora, code word is high priority and the low prior information of reflection base in data flow of composing with priority.This code word data flow is transferred to a transmission processor, and this processor becomes respectively to comprise the transmission unit of the pay(useful) load joint of header section and packed data with contract (packs) of code word data, and the data flow output of high priority and low priority is provided.
Major function of this transmission processor is that the answered length code digital data that will be produced by priority processor before the choosing is combined into the packed data word.The adding up of compression word be about to for packet be to begin with a transmission header.
This transport packet format increases the synchronous again and signal recovery performance of receiver end, for example, transmission channel causes after the destruction owing to disturbing, in a single day owing to provide title data, receiver just can determine thus that the transmission data are lost or when destroying, reentered the reentry point of data flow.Because begin a picture group resembles (GOP) and also helps data sync at the MPEG decoder on the border of a bag.A GOP desires to become a series of one or more images or the frame that helps a random-access encoded video bit stream sequence just as will be seen.According to beginning code word by coding (intracoded) I-frame image in the response in the system of mpeg standard, and, also be convenient to again synchronous by image being begun the border that code word places bag.
According to the principle of the invention, in the system of variable length codewords in a transfer data packets (for example mpeg code word), have to be less than and give the fragmentary data bag of deciding number of words with a non-operation " zero word " assembling, producing a regular length bag, and define parlor (inter-Packet) border that the code designation word can occur.
In a most preferred embodiment disclosed herein, a private code word, bag alignment mark (PAF) is inserted into a mpeg data stream, with the beginning of presentation image group (GOP).This PAF was right after before the image of interior coding (intracoded) " I " frame of a GOP of beginning begins code word.This PAF indication image beginning code word is about to occur, and has such clock cycle, i.e. during the clock cycle at this moment, carry out some " internal affairs processings " function after, image occurs in the starting point of next bag again and begin code word.These internal affairs processing capacities comprise (for example): with accumulator zero setting, check the title state, and when PAF occurs, the packet in building is produced a last word designator.In case PAF occurs, begin a GOP owing to be defined in a packet border, and the packet in the termination structure.This termination can cause comprising the cripetura bag that is less than regulation assembling number of words.This cripetura packet is filled with empty (zero-bit) word, setting up a complete data bag with regulation number of words, and defines the parlor border that an image beginning code word can occur.The word of 30 32-position regular lengths constitutes a packet, and this packet is by the title titled with a 32-position.
In the accompanying drawing:
Fig. 1 is according to the data word controller that comprises of the present invention, and packet forms the calcspar of the video coder part of device (datapacker) and data/title unit equipment.
Fig. 2 A, the word controller of 2B and 2C presentation graphs 1 and packet form the details of device.
Fig. 3 is the relevant truth table of operation with word state controller shown in Fig. 2 A.
Fig. 4 represents the details of a packed data assembler network.
Fig. 5 to 16 has described several examples that last word produces.
Figure 17 represents the details of data shown in Figure 1 and title assembled unit.
Figure 18 is and the relevant state diagram of state controller operation shown in Figure 17.
Figure 19 is the calcspar that comprises according to a HDTV coded system of present device.
Figure 20 A and 20B are schematically illustrating the image field/frame sequence of encoded video signal.
Figure 21 is to schematically illustrating that the data block that is produced by coding/compression device in Figure 19 system forms.
Figure 22 is a kind of general the schematically showing to the data format that is provided by coding/compression device in Figure 19 system.
Fig. 1 is the calcspar that the packet of a transmission processor forms device 12 and packed data word controller 10.Mention that as the front major function of transmission processor is the data word that the code word data compression of variable-length is become regular length (for example 32).30 cumulative data words constitute a packet, and this packet is begun by a transmission header at last.A kind of like this transmission processor can be applicable to one in the system that handles MPEG formula compressed video signal, as the back will be discussed Figure 19.Will be about other characteristics of mpeg formatization and processing procedure in conjunction with Figure 20,21 and 22 discuss.
The accumulative total of controller 10 monitoring and the corresponding length data word of bag alignment mark [Pocket Alignment Flag (PAF)], with finishing of the 32-bit data word determining to be assembled into by a variable length codewords stream, and the finishing of the long packet in 960-position.This length data be one the definition its length with the six parallel-by-bit words that variable length codewords is consistent.The binary value of this length is represented the consistent figure place of variable length codewords with actual representative mpeg code word waiting for transmission.Each variable length codewords appears on the bus of one 32 bit wide with the variable amount of bits of the significance bit (1 to 32) of representing mpeg code.
PAF so forms by input processor 14, begins the just previous code word of code word so that PAF appears at MPEG " I " (interior coding) frame image that a picture group resembles when beginning.PAF can detect the appearance that the I frame image begins code word by utilization-data comparator and produce.Unit 14 also comprises a signal delay network, in order to handling image beginning code word and PAF so that PAF appear at code word in the clock cycle just before the I frame image begins code word.This delay network guarantees that also the output signal that is added to unit 10 and 12 presents correct time synchronized.
Word address is sent to packet and forms device 12, and this packet forms device and receives the variable length codewords that is used to assemble, to guarantee to import the correct link of variable length codewords.The word control signal also is sent to bag and forms device 12, so that the explanation short word indicates that last word and 30 the packed data word sequences of assurance in the bag are correctly alignd with the respective transmissions title.Controller 10 is followed the tracks of finishing of compression by the binary value of accumulation length word.Each value is represented the number of significant digit in the correlative code word.When totally having 960, just finished a bag.The starting point of this counting, or say that initialization is the appearance by PAF, the inside accumulator zero setting in the controller 10 is formed.
Whenever the packed data word is but that this packed data word of time spent just is sent to data/title combiner 15.Equally, but whenever the title time spent, just transmission header is sent to the combiner 15 input FIFO title buffer 17 from title generator 18.Title generator 18 is used for forming the information of title from input processor 14 and 10 acquisitions of word controller.A title is write enable signal and represented: a title is available, and makes these titles can write FIFO17.Titled with suitable title, and the transmission package that will form thus or piece go to output speed buffer as shown in Figure 19 to combiner 15 before each packed data pay(useful) load.Combiner 15 also produces a dateout ready signal, passes on expression packed data word or the ready wait of transmission header.A title indicator signal represents that title carries out the clock cycle of transport process.This signal serves as the mark on a transmission package border, causes the successor operation such as forward error correction (FEC) to be added to transmission unit in good time.
Each title comprise with this title corresponding data bag in the relevant information of data.This heading message is assisted the data compilation of receiver and synchronously and comprise such as COS (for example, audio frequency, video, data), frame type, frame number and burst number information such as (slice number).Relevant that part of such title and the processing procedure thereof described of using the HDTV digital information processing system of mpeg signal coding in people's such as Acampora the United States Patent (USP) 5,168,356.
A packet can comprise (for this example) from 1 to 29 word, promptly is less than 30 packed data word.As will discussing in conjunction with Figure 20 to 22, a GOP begins a visual initial code word of encoding the I-frame appears occurring immediately being positioned in the PAF one that is provided by input processor 14.This image initial code word of an intra coded frame always begins a new bag, and shows the end of a packet and the beginning of a new bag immediately following PAF the preceding.The bag alignment of this image initial code word helps to obtain data flow fast at receiver.When during forming fixed length word, PAF occurring, promptly form the packet of a cripetura.All the other positions form in the device 12 at packet and are filled out with some " zero-bits " (zeroed bits) (from 1 to 31) when building this compression word.In addition, the remaining word in this packet will be filled out in combiner 15 equally with " zero word " (from 1 to 29), keep the life size of transmission package with this.The necessity of this " zero filling word " is before 30 data words have been sent to combiner 15, is indicated by the appearance of a last word designator.
Last word in packet of correct identification is important.This last word has guaranteed the correct record that has the bag that its corresponding transmission title constitutes to one.Last word also constitutes the filling bag (filled packet) that the MPEG group (being intra coded frame) of image border is located, and this is to such as being absolutely necessary synchronously again at the television receiver/decoder place under the situation such as changing after the channel.Mensuration to last word is not a valueless job, and depends on the specific understanding to the bag state, such as when finishing a bag, and if finished, whether have data segment that enters by next bag or the like.When last word is formed in present clock interior at interval word or the word in next clock interval to be formed, and this has several situations.
Some object lesson that last word forms is described as follows.Finish when bag under not having the PAF situation, then last word (being the 30th word in this example) is last word and makes this mark by a last word designator.This is an example of " very " last word.A PAF may occur in a bag and finish when not having the position section to enter next bag simultaneously, that is, this word finishes the border at bag just.A last word of finishing bag is identified as last word, because the fact is exactly like this.This is another example of " very " last word.PAF also may occur in a bag and finish when some section has entered first word of next bag simultaneously.In the case, form and therefore identified two last words in succession.This last word of finishing bag is identified as at last (one " very " last word), and first word of next bag also is identified as at last simultaneously, because PAF forces this bag cripetura.Under a kind of cripetura bag situation in back, the last word of appearance causes " zero word is filled " to finish this bag before sending 30 words.Provide other examples of last word below.PAF can occur in one and not finish bag and be in the construction sometime.If an internal word is to enter under next word situation in some section to finish; Then this partial words becomes last word.A kind of situation of special trouble is: do not finish and wrap in when building when one, an internal word is finished under the situation that enters next word without any the position section.After this internal word can be sent to data/title combiner, just to indicate this word be last word to data (that is, PAF occur) thereafter, and this just can not reach correct recognition purpose worthy of the namely.In the case, a zero word that is called " puppet " last word produces and is identified as last word.The last word of this puppet, the last word of segmented (not exclusively) that is filled zero-bit with (for example) part is different, is to constitute with zero-bit fully.These and other some examples will be discussed relating at Fig. 5-16 o'clock.
Some significant feature of this exposing system that will describe are the formation of distance of zero mark degree PAF below, to send the signal that GOP is about to begin, and be convenient to produce and identify last word in the packet, with will the time produce pseudo-last word, with the relevant signal specific of variation that produces with last word appearance.
Fig. 2 A illustrates the details of Fig. 1 controller 10.This controller is included in an accumulator 20 that has in the feedback device of mould 960 circuit 22.Be included in a buffer register 23 in this feedback loop, new accumulated value is kept at the end in each length input cycle.Input PAF and length word are sent to form unit 22 and accumulator 20 respectively via input register 24.The value of length word adds up by unit 20 continuously, the feedback of accumulator 20 and mould 960 unit 22 combination simultaneously with the length setting of a bag at 960.The accumulator output that obtains from register 23 represent this in a bag the position and be sent to state controller 25.
When showing, the null value length word that receives has distance of zero mark degree blank code word, that is, during not operation (NO-OP) code word, 20 free time of accumulator, and keep position count value at last.An exception of this rule be PAF will always to force accumulator value be zero, and irrelevant with the position count value.Another exception occurs in a bag and just finishes on the border (that is, accumulator count is 960) of bag.In next clock cycle of following, the accumulator count value will be corrected to the binary value of next length word via mould 960 unit 22.When accumulator count is equal to or greater than 960, just finish a bag.
In Fig. 2 B, represent the 10 bit accumulators output of accumulation length to be illustrated as I0 to I9.When the accumulation length of compressed code word is equal to or greater than 960, just finish a bag.This condition is represented as: when all being in the logical one state as four MSB positions of the accumulator I6 to I9 that is added to door (AND) 30.Very zero be represented as: when as being added to or all ten accumulator bits of door 31 state when all being in logical zero." non-residue " state is meant and is added to or door five LSB accumulator bits I0 to I4 of 32 all are in the logical zero state.The word address that packet forms device is six LSB accumulator bits of response, and I0 to I5 forms.When running into bag alignment mark (PAF), force word address with gate array 34 to logical zero state (word address resets).
The packet of Fig. 2 C presentation graphs 1 forms the details of device 12.Variable length codewords is sent to data shift device 35.This shift unit can be the barrel shifter of 74AS8838 type of resembling Dezhou (Texas) instrument company and so on.For suitably locating the significance bit that is used to link variable length codewords, a LSB subclass (subset) of length accumulator output is sent (seeing Fig. 2 A and 2B) and is sent to the data shift device as word address from bag state controller 25.When the link from variable length codewords had formed 32 word, this compression word was sent to and keeps register 36.The validity of this packed data word is to make mark by a word ready signal that is sent by register 36, so that this word can be sent to data compilation network 37.Data compilation network 37 is used to from the control signal WEN1 that compresses word controller 10 (Fig. 1), WEN2 and WZERO send for a fifo buffer that comprises in the data of Fig. 1 and title combiner 15 to have its data to write to enable and the packed data word of last word mark.
Next transmits title and inserts this data splitting stream and trail that the last word of a bag sends so that the title of next bag inserts in the last word back of current bag.A title controller uses this accumulator output (Fig. 2 A) to go to indicate the position of some code word in this bag, so that these positions can be described in the entrance field in title domain.Can produce last word designator and the mark that makes data word can write fifo buffer easily by the logic array (logic arrays) relevant with word state controller 26 and data compilation network 37.Following table 1 expression is used for response logic array input PAF (bag alignment mark), PC (bag is finished), the operate condition of TZ (very zero) and the last word of REM (residue, field area designator) generation.Data compilation network 37 can form its output signal by slave controller 26 easily through the output signal that buffer register 28 applies.What these signals comprised the last word expressed in next clock cycle now writes enable signal WEN1, express last word in the present present clock period write enable signal WEN2 and produce a last word of puppet write zero-signal WZERO.The last word of this puppet appears at PAF and the bag that resides in the internal code word boundary of not finishing bag and forms (formation) consistent the time.
Table 1
The state of word state controller
The action that PAF PC TZ REM takes
Be that N/A is that current word mark is as last word, the then word of next clock
Mark same (situation 1)
Be that N/A denys that current word mark is as last word (situation 2)
Whether N/A is that next clock mark word is as last word (situation 3)
Not whether next clock forms pseudo-zero word, and identifies it as last
Word (situation 4)
Not that N/A N/A identifies current word as last word (situation 5)
Neither one (situation 6a) whether
It deny N/Z NA neither one (situation 6b)
Annotate 1: the last word mark of current word enables 2 and provides signal by writing.
Annotate 2: the last word mark of the word in next clock enables 1 and provides signal by writing.
Annotate 3: the formation of pseudo-word provides signal and enables 1 sign by writing by writing zero.
As will further discussing with regard to Fig. 5-16, produce WEN1 for the example (the situation 1-6 of table 1) of different operating condition, the truth table of WEN2 and WZERO is shown in Fig. 3.Annex A has provided the algorithm of table 1.After coming the output signal of self-controller 26 to be added to output buffer 28, be re-used as the output word control signal and be conducted to data compilation network shown in Figure 4.
The data compilation network of Fig. 4 comprises the output network of packet formation device 12 among Fig. 1.This data compilation network comprises and gate 42 and 44, or gate 46 and the D flip- flop 43 and 45 as scheming to be disposed.The data word of 32 compressed bit wides is via being sent to a data FIFO with gate 42, and word ready signal that forms circuit from formerly bag is by with gate 44 and become the data that are used for Fig. 1 data FIFO 16 and write enable signal.From the data write control signal WEN1 of compression word state controller (Fig. 2 A), WEN2 and WZERO are added to trigger 43 and 45 and gate 46 as shown.WEN2 represents a last word mark relevant with current word, and WEN1 represents a last word mark relevant with a word in next clock cycle.The WZERO control signal represents to be designated by WEN1 the forming of one the last word of puppet (situation 4 in the table 1) of last word.In the case, the all-zero word that is referred to as pseudo-last word is inserted into packed data word stream, and is written to data FIFO 16.The ready input signal of word to compilation door 44 keeps register 36 (Fig. 2 C) to provide by one, to represent a validity that is compressed into 32-position word.
Following discussion relates to the several examples that formed by relevant last word shown in Fig. 5 to 16.Wherein some examples shows follow-up with one and the influence of the consistent distance of zero mark degree NO-OP word of PAF formerly.
Fig. 5 and 6 has illustrated several modification of situation 5 in the table 1.In Fig. 5, one wraps in the mode that enters next bag with segmentation and finishes (that is, the accumulator place value is greater than 960).Among Fig. 6, a bag is just in time finished (that is, accumulator value equals 960) on the border of bag, enter next bag without any segmentation or remainder.In both cases, last word mark occurred in the bag deadline.This incident and true zero-sum residue designator are irrelevant, because there is not PAF.Not so, having under the PAF situation, must consider the indication of true zero-sum residue.
Fig. 7 and 8 illustrates the situation 2 of table 1.In Fig. 7, PAF appears immediately after a bag is finished, and not having and then simultaneously, a 32-bit image begins the segmentation of code word.Fig. 8 is similarly, just except that image begin the code word front got involved three distance of zero mark degree non--operation (NO-OP) code word this point.In this two figure, all to finish signal consistent and do not having end packet under the surplus section situation that enters next bag with bag for PAF.Fig. 7 represents to add up immediately and begins the more typical case of code word with 32 long images.Fig. 8 represents to allow to get involved the NO-OP word.
Fig. 9 belongs to the situation 6a of table 1, and herein, it is inconsistent that PAF and bag are finished signal.PAF occurs after bag is finished, and does not have segmentation simultaneously and follow an image beginning code word after the NO-OP word.In the case, a last word indication is finished the signal correction connection with bag, but not relevant with PAF last word indication, because comprise very zero indication because accumulator caused in zero free time in the case.
Figure 10 and 11 illustrates the situation 1 of table 1.In Figure 10, a PAF is right after bag and finishes appearance afterwards, and the segmentation of following an image beginning code word is arranged.Figure 11 got involved the NO-OP word in the past except that begin code word at image, and was identical with Figure 10.Because the event of segmentation residue needs two last word designators.Because this segmentation form makes a last word designator appear at bag and finishes the interval, and another appears at a clock interval of PAF back.
Figure 12,13 and 14 show the situation 3 of table 1.In these examples, during PAF appears at bag sometimes and forms, but not in word boundary (that is, having the segmentation that enters next word), and do not finish indication and conform to bag.Last at that time word signal occurs in next clock interval of PAF back usually as a result of part banner word (owing to segmentation).In Figure 12, PAF occurs after some NO-OP words with segmented after finishing a bag, follows an image beginning code word.In Figure 13, PAF occurs when finishing a word immediately, with an image beginning of segmented mode heel code word.In Figure 14, PAF has caused that segmentation occurs later on after finishing a word and at some codes.
Figure 15 and 16 illustrates the situation 4 of table 1, promptly about being necessary to produce the last word of specific pattern, the situation of pseudo-last word.This situation relate to PAF after a word is finished immediately (Figure 15) occur or after some times (Figure 16), no segmentation promptly directly appears on the word boundary of 32 multiples.In the case, prerequisite be finish word the notice (providing) by follow-up PAF it be that last word was issued in the past.Form and send one complete zero pseudo-last word.This allows, because MPEG allows at zero of a preposition arbitrary number in beginning code word front, and has guaranteed the appearance of visual beginning code word immediately following PAF.In addition, in these situations, the balance of bag (balance) will be filled zero-bit (sky) word to it by data/title combiner and be reached.In the case, owing to sent one zero word and be designated as last word by puppet, so combiner will send less than a word (one less word).In Figure 15, then image beginning code word of PAF appears in (not having segmentation) immediately when a word is finished.A word is finished (not having segmentation) back immediately following the NO-OP word of getting involved in Figure 16.Occur PAF then, the back is an image beginning code word and then.
Figure 17 represents other details of data/title combiner 15 (Fig. 1).Write the enable signal title division and be written into title FIFO70 whenever title generator 18 produces title of titles response.Similarly, produce, write enable signal with regard to response data and be written into data FIFO 72 whenever the packed data word forms device 12 by packet.No matter last whether word be the 30th word, all follows the last word of a bag and produce a last word designator in data compression process.Unit 70 and 72 title and data output by multiplexer 76 by on multipath conversion to a common bus and be added to output register 78.Register 78 is with ready for data signal, and bag data and title reach the title designator and be conducted to speed- buffering device 713 and 714 shown in Figure 19.Multiplexer 76 can respond from fifo status controller 74 one and send zero-signal (Issue zero signal) and send zero word by order.
Two cell fifos 70 and 72, multiplexer 76 and output register 78 are by controller 74 management, and this controller is a state machine.In energized or after similarly restarting, controller 74 is waited for an available title.Available title is sent to the output bus of multiplexer 76 with title designator of data ready designator.Controller 74 is data FIFO 72 services then, extracts data available until last word designator occurring.Each data that is sent with the data ready designator are sent to output register 78.If in the end the word designator has been served 30 data words after occurring, controller 74 will reexamine the useful information of title FIFO70.If controller 74 services are less than 30 data words, then go to indicate multiplexer 76 to send zero word, with the balance bag by sending zero order.All these classes zero word all is accompanied by the data ready designator.When not having title or data to send, controller 74 just indicates multiplexer 76 to send zero word, simultaneously during data are unavailable without any the data ready designator.Figure 18 shows and describes aforesaid state machine driving operational flowchart (state diagram) to combiner 15.Data ready designator and title designator are sent to speed- buffering device 713 and 714 among Figure 19 by output register 78.These designators are represented to the speed-buffering device: data and heading message are arranged on the bus, and keep the aligning of title/data so that carry out forward error correction (FEC) coding and data cross behind the speed-buffering device.In this system (Figure 19), the FEC and the range request that intersected: at first transmit title, that is to say, will send to the speed-buffering device start of header earlier in the packet front of describing by this title.The empty marking signal of sending from title FIFO70 and data FIFO 72 represents not have title or data word sending respectively, so state machine controller 74 is in idle condition.This shape shape is shown among Figure 18, " no title " of description status 0 and state 1 and " no word " situation.When one relevant when reading enable signal and being sent to title FIFO70 or data FIFO 72 respectively, come self-controller 74 title/data select signal indication multiplexer 76 or will be from the unit 70 title output or will be from the unit 72 data output be transformed into signal bus to the input of output register 78.
Zero word will be added to one not exclusively for producing required 30 digital packets, the output buffer 78 of cripetura bag is showing greater than the title buffer 70 of front and data buffer 72.These buffers advantageously receive and deal with data incessantly continuously.The operation that this nothing is interrupted has greatly been simplified regularly and synchronizing function, for example, stops/beginning synchronous difficulty because eliminated clock.
As previously mentioned, utilize the full bag that gives measured length easily with the mode that adds empty word in case of necessity, retrieve under the arbitrary data state that helps in such as a variable length codewords system, to find with synchronously.A beginning code word, specifically 1 frame begins the specific synchronous points again (specific re-synchronizing point) in the data flow that code word is a mpeg compatible.This begins the border that code word appears at a bag, and it is convenient especially favourable utilizing the zero-bit empty word to produce this code word in institute's exposing system, thereby finishes a censored data bag and defined the border of this bag.Mpeg standard allows to have a beginning code word front zero word of any number, and receiver/decoder these zero-empty words of ignoring.In this example, output buffer 78 is big and free nerve (time sesilient), therefore be a kind of be used to carry out the empty word combination operation [packing operation) delivery vehicle easily.Be noted that thus: between bag alignment mark and the appearance of an image beginning code, carrying out the available time compole short (for example, clock cycle) of empty word combination at packet boundary.
Figure 19 illustrates one can will be applied to the typical HDTV coded system of transmission processor part by equipment of the present invention.Figure 19 represents that this system is just handling the situation of single video input signals, but should be appreciated that: brightness and chrominance component signal are separated to handle, and produce the chromatic component of compression with luminance shifting vector (lum-inance motion vctors).The brightness of this compression and chromatic component were formed macro block by staggered before analyzing in code word priority.Other data of relevant Figure 19 system can find in people's United States Patent (USP)s such as Acampora 5,168,356.
Image field/frame sequence shown in Figure 20 A is added to circuit 705, and it rearranges field/frame according to Figure 20 B.This retracing sequence is added to compressor reducer 710, produces a frame sequence according to the compression of MFEG formula form coding.This form be layering and be shown among Figure 22 with the cripetura form.The MPEG hierarchical format comprises and has the multilayer of heading message separately.On each justice, each title comprises an initial code, data relevant with each layer and to the regulation of additional header expansion
When mentioning the MPEG formula signal that produces by this system, then mean: (a) the sequential chart image field/frame of vision signal is according to I, P, B coded sequence coding, (b) coded data on this picture level (Picture level) is divided sheet mode or piece prescription formula coding with the MPEG formula, the sheet number of wherein every/frame can be different, and every macro block number also can be different.The I coded frame is interframe (intraframe) compression, so that only needs I frame packed data for reappearing an image.The P coded frame is given according to the forward motion compensation and is seen method coding, and wherein P frame coded data is to produce from present frame and an I frame or the P frame that took place before present frame.The B coded frame is given according to two-way motion compensation and is seen the method coding.B coded frame data are to produce from present frame with from I and the P frame that appears at these present frame front and back.
The coding output signal of native system is segmented into field/frame group, or by the group of picture (GOP) shown in the capable L2 of grid (Figure 22).Each GOP (L2) comprises the title of heel pictorial data (branch) section.The GOP title comprises and level and vertical image size the ratio of width to height, field/frame rate, the data that bit rate etc. are relevant.
The visual title that comprises back heel piece data (L4) corresponding to the pictorial data (L3) of each image field/frame.This image title comprises a field/frame number and image code type.Each sheet (L4) comprises the sheet title of a plurality of data block MBi of heel.This sheet title comprises group number and quantization parameter.
Every MBi (L5) represents a macro block and comprises the title of heel mobile vector and code coefficient.This MBi title comprises the macro block address, macroblock-type and a quantization parameter.This code coefficient is shown among layer L6.Each macro block comprises 6, and every comprises 4 luminance block, a U chrominance block and a V chrominance block (seeing Figure 21).A PEL (picture element) matrix of representing one (for example 8 * 8) is carried out discrete cosine transform (DCT) on this matrix.Four luminance block be one 16 * 16 PEL (picture element) matrix of a representative (for example) 2 * 2 in abutting connection with the luminance block matrix.The representative of colourity (U and V) piece and four gross areas that luminance block is identical.That is to say, before compression, carrier chrominance signal be with respect to two levels of brightness and vertical (speed) by subsample (subsampled).A slice data are corresponding to representative and the corresponding visual rectangle partial data of being represented by a macro block adjacent set of an area.One frame can comprise the raster scan of 360 compositions, promptly vertically takes advantage of 6 levels for 60.
The piece coefficient is provided by plot of DCT.The DC coefficient occurs earlier, follows separately DCT AC coefficient by its relative importance order again.At each end of data block place that occurs continuously, add an end of block code EOB.
In Figure 19, after handling, priority processor 711 is added to a transmission processor 712 from the data of compressor reducer 710 again, and it is high priority (HP) and standard priority (SP) two parts with data sementation.These parts are coupled to separately forward error coded unit 715 and 716 via rate buffer 713 and 714.The data and the title of the temporary compression of this rate buffer are so that after this by FEC error coded network extraction.A rate controller 718 cooperates buffer 713,714 to go to adjust the average data transfer rate that is provided by compressor reducer 710.After this, signal is coupled to a transmission modem 717, and there, HP and SP data are carried out quadrature amplitude modulation to each carrier wave in the standard 6MHz TSC-system television channel scope.
Annex A, last word form algorithm and contain positive clock edge=1, and if ∞ is the bag alignment mark
If bag is finished
If residue
Marker word ready with finish as last bag consistent then at next clock
Ready as last mark short word
Otherwise
Ready and the last bag of marker word is finished consistent
Otherwise
If residue
Ready as next last clock mark word
Otherwise
If not very zero
At next clock generating one zero word with to identify this puppet word be last word
Otherwise connect (that is, what is not done) otherwise
If bag is finished
Marker word ready with finish consistent the end as last bag
Claims (4)
1. one kind is used to produce method of compressing data, may further comprise the steps:
Produce packet according to variable length codewords data flow, this packet comprises and contains the short packages that is less than the regulation number of words;
Fill described short packages with the not operation empty word in case of necessity, the fixed-length data bag that has described regulation number of words with generation, and the parlor border of code designation word can appear in definition; And
With described data packet transmission to an output.
2. method according to claim 1 is characterized in that, also comprises the step of packet header being added to described packet.
3. method according to claim 2 is characterized in that, described interpolation step is further comprising the steps of:
Receive the title that contains with the content-related information of a related data packets from title buffer; And
Receive described packet from a data buffer.
4. method according to claim 3 is characterized in that, after described data and title buffer described empty word is offered described short packages.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US93/11583 | 1993-11-30 | ||
PCT/US1993/011583 WO1995015650A1 (en) | 1993-11-30 | 1993-11-30 | Data processor for assembling transport data packets |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN94112954A Division CN1099808C (en) | 1993-11-30 | 1994-11-29 | Packed data processor in a system for assembling transport data packets |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1434634A true CN1434634A (en) | 2003-08-06 |
CN1196331C CN1196331C (en) | 2005-04-06 |
Family
ID=22237242
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN94112954A Expired - Lifetime CN1099808C (en) | 1993-11-30 | 1994-11-29 | Packed data processor in a system for assembling transport data packets |
CNB021204373A Expired - Lifetime CN1196331C (en) | 1993-11-30 | 1994-11-29 | Compressed data processor for assembly transmission data package system |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN94112954A Expired - Lifetime CN1099808C (en) | 1993-11-30 | 1994-11-29 | Packed data processor in a system for assembling transport data packets |
Country Status (8)
Country | Link |
---|---|
EP (1) | EP0732032A4 (en) |
JP (1) | JP4357594B2 (en) |
KR (1) | KR100327684B1 (en) |
CN (2) | CN1099808C (en) |
AU (1) | AU5983794A (en) |
MY (2) | MY166757A (en) |
TW (1) | TW243578B (en) |
WO (1) | WO1995015650A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101635853B (en) * | 2003-11-18 | 2011-11-23 | 斯卡拉多股份公司 | Method for processing a digital image |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100821835B1 (en) * | 2001-06-30 | 2008-04-11 | 주식회사 케이티 | Method for realtime sorting of streaming data in Multimedia Messaging Server system |
JP4754648B2 (en) * | 2010-03-16 | 2011-08-24 | ゼネラル・エレクトリック・カンパニイ | How to process the data stream |
JP4648489B2 (en) * | 2010-03-17 | 2011-03-09 | ゼネラル・エレクトリック・カンパニイ | How to process the data stream |
CN108966000B (en) * | 2018-07-17 | 2021-01-29 | 北京世纪好未来教育科技有限公司 | Playing method and device, medium and terminal thereof |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB8929152D0 (en) * | 1989-12-22 | 1990-02-28 | Gen Electric | A digital augmentation system for actv-ii |
DE69122634T2 (en) * | 1990-02-06 | 1997-05-15 | Alcatel Italia | System, packet structure and device for processing the output information of a signal encoder |
BE1003827A4 (en) * | 1990-02-26 | 1992-06-23 | Alcatel Bell Sdt Sa | Universal coding method image signals. |
US5122875A (en) * | 1991-02-27 | 1992-06-16 | General Electric Company | An HDTV compression system |
US5289276A (en) * | 1992-06-19 | 1994-02-22 | General Electric Company | Method and apparatus for conveying compressed video data over a noisy communication channel |
-
1993
- 1993-11-30 WO PCT/US1993/011583 patent/WO1995015650A1/en not_active Application Discontinuation
- 1993-11-30 KR KR1019960702952A patent/KR100327684B1/en not_active IP Right Cessation
- 1993-11-30 AU AU59837/94A patent/AU5983794A/en not_active Abandoned
- 1993-11-30 EP EP94905919A patent/EP0732032A4/en not_active Withdrawn
- 1993-11-30 JP JP51556895A patent/JP4357594B2/en not_active Expired - Lifetime
-
1994
- 1994-08-31 TW TW083108027A patent/TW243578B/en not_active IP Right Cessation
- 1994-11-28 MY MYPI20021820A patent/MY166757A/en unknown
- 1994-11-28 MY MYPI94003161A patent/MY118734A/en unknown
- 1994-11-29 CN CN94112954A patent/CN1099808C/en not_active Expired - Lifetime
- 1994-11-29 CN CNB021204373A patent/CN1196331C/en not_active Expired - Lifetime
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101635853B (en) * | 2003-11-18 | 2011-11-23 | 斯卡拉多股份公司 | Method for processing a digital image |
Also Published As
Publication number | Publication date |
---|---|
TW243578B (en) | 1995-03-21 |
MY118734A (en) | 2005-01-31 |
EP0732032A4 (en) | 1998-12-30 |
CN1111876A (en) | 1995-11-15 |
JPH09507975A (en) | 1997-08-12 |
KR960706751A (en) | 1996-12-09 |
CN1196331C (en) | 2005-04-06 |
AU5983794A (en) | 1995-06-19 |
KR100327684B1 (en) | 2002-07-27 |
JP4357594B2 (en) | 2009-11-04 |
WO1995015650A1 (en) | 1995-06-08 |
CN1099808C (en) | 2003-01-22 |
MY166757A (en) | 2018-07-20 |
EP0732032A1 (en) | 1996-09-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN1076937C (en) | Data word indicator in a system for assembling transport data packets | |
US20190058865A1 (en) | System and method for encoding 3d stereoscopic digital video | |
EP1727090A1 (en) | Method and system for digital decoding 3d stereoscopic video images | |
JP2002530951A (en) | Apparatus and method for locating a coding unit | |
CN1121673A (en) | Method and apparatus for efficient addressing of dram in a video decompression processor | |
CN1045040C (en) | Television system for transmitting pictures in a digital form | |
CN1196331C (en) | Compressed data processor for assembly transmission data package system | |
US5767912A (en) | Datastream packet alignment indicator in a system for assembling transport data packets | |
CN1090869C (en) | Datastream packet allgnment indicator in a system for assembling transport data packets | |
CN1606881A (en) | Method and device for compressing video-packet coded video data | |
JP4497483B2 (en) | Device for processing data streams | |
JP4648489B2 (en) | How to process the data stream | |
JP5119522B2 (en) | Device for processing data streams | |
CN1124031C (en) | Appts. and method for generating on-screen-display messages using field doubling | |
JP4317925B2 (en) | Apparatus and method for processing a data stream | |
JP4808812B2 (en) | Device for processing data streams |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
C17 | Cessation of patent right | ||
CX01 | Expiry of patent term |
Expiration termination date: 20141129 Granted publication date: 20050406 |