CN101945265A - Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm - Google Patents

Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm Download PDF

Info

Publication number
CN101945265A
CN101945265A CN2010102581646A CN201010258164A CN101945265A CN 101945265 A CN101945265 A CN 101945265A CN 2010102581646 A CN2010102581646 A CN 2010102581646A CN 201010258164 A CN201010258164 A CN 201010258164A CN 101945265 A CN101945265 A CN 101945265A
Authority
CN
China
Prior art keywords
pid
multiplexing
video
pcr
frame
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
Application number
CN2010102581646A
Other languages
Chinese (zh)
Other versions
CN101945265B (en
Inventor
武爱敏
郭忠武
李国华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bo Hui Science and Technology Co., Ltd. of Beijing
Original Assignee
BEIJING BOHUI TECHNOLOGY Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by BEIJING BOHUI TECHNOLOGY Co Ltd filed Critical BEIJING BOHUI TECHNOLOGY Co Ltd
Priority to CN 201010258164 priority Critical patent/CN101945265B/en
Publication of CN101945265A publication Critical patent/CN101945265A/en
Application granted granted Critical
Publication of CN101945265B publication Critical patent/CN101945265B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Time-Division Multiplex Systems (AREA)
  • Television Systems (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention provides a bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm. The method calculates reference PCR of the program at current time strictly according to the output bandwidth to ensure the stability of output bandwidth, performs audio and video multiplexing according to the ratio of the required multiplexing data in the total bandwidth to ensure uniform insertion of each path of programs, and multiplexes a plurality of coded single-program TS flows into multiple program TS flows, wherein an encoder is avoided in the multiplexing process.

Description

The permanent code check TS stream of a kind of Polymera multiplexing algorithm based on bandwidth usage
Technical field
The invention belongs to the digital television program transmission technique field, particularly single program stream of digital television program is multiplexed with the algorithm of Polymera stream.
Background technology
Present TS stream multiplexing algorithm generally adopts the method for statistic multiplexing.
To the statistic multiplexing algorithm, the statistic multiplexing algorithm is according to the relation between needed code check of encoder compresses and the picture material, under the situation of static multiplex device output total bitrate, to a plurality ofly look, audio stream jointly controls, reach look more, the reasonably shared as far as possible total bitrate of audio stream.It must be encoder and multiplexer associated working, and encoder must have the function of dynamic code rate control.
In present Multiplexing Technology, because the multiplexing cooperation that needs encoder, be coding back data conditions for the single-unit order of some inputs, and be not suitable for; In this case,, add decoder and encoder the input program is carried out secondary coding, will inevitably reduce the quality of program if adopt the method for statistic multiplexing.
Summary of the invention
In the present invention, provide a kind of method that directly the single-unit order TS stream behind a plurality of codings is multiplexed with Polymera TS stream, avoided using encoder, kept picture quality.
The permanent code check TS stream of a kind of Polymera based on bandwidth usage multiplexing algorithm is characterized by, and calculates the program current time with reference to PCR according to output bandwidth, guarantees the stability of output bandwidth; Carry out sound, video multiplex according to the ratio of required multiplex data in total bandwidth, guaranteed that each road program evenly inserts; Make the single-unit order TS stream behind a plurality of codings be multiplexed with the method for Polymera TS stream, and in multiplex process, avoid using encoder.
Further, described algorithm comprises the following steps:
1) calculates the program current time with reference to PCR;
2) reading of data from the SPTS file, and judge whether these data are endings of file; If judged result is "No" then enters step 3); If judged result is "Yes" then finishes whole algorithm;
3) to whether wanting multiplexing pat table to judge, if judged result is "No" then enters step 4); Be the then multiplexing pat table of "Yes" and return step 1) as judged result;
4) to whether wanting multiplexing pmt table to judge; If judged result is "No" then enters step 5); Be the then multiplexing pmt table of "Yes" and return step 1) as judged result;
5) judge in the audio frequency tabulation whether the voice data that needs multiplexing PID is arranged, if judged result is "No" then enters step 6); As judged result is that the then multiplexing voice data with this PID of "Yes" returns step 1);
6) judge whether the video data that needs multiplexing PID is arranged in list of videos, if judged result is "No" then multiplexing empty bag; As judged result is that the then multiplexing video data with this PID of "Yes" returns step 1);
Up to step 2) in judged result be that "Yes" is then finished whole algorithm.
Further, the computational methods of described PCR are:
PCR(i)=PCR(0)+(total_bytes_sent+10)*8)/total_bit_rate
Wherein:
PCR (i) is if the value of the PCR that inserts;
PCR (0) is the counting of beginning 27M clock when multiplexing, is traditionally arranged to be 0;
Total_bytes_sent is from beginning to be multiplexed into the total amount of byte of TS multiplexing the current MPTS;
The 10th, last position in adjusting field of PCR;
Total_bit_rate is the total bitrate of our the MPTS output that is provided with;
The 8th, byte conversion is become the position.
Further, come determining step 3 by the PSI/SI form insert module of using) and 4), and draw the conclusion that whether needs multiplexing PAT or pmt table.
Multiplexing total principle of the audio or video further, step 5) and 6) is that code check shared ratio in the total bitrate of MPTS of basis this every frame audio or video itself carries out multiplexing:
The computing formula that this frame code check of a certain PID audio or video accounts for the ratio of total bitrate is:
Ratio_rate(pid)=bit_rate(pid)/total_bit_rate
Wherein bit_rate (pid) is for specifying the code check of the current participation multiplexed frame of PID;
The computing formula that the multiplexing data of this PID account for the ratio of the multiplexing total data of MPTS is:
Ratio_sent(pid)=Bytes_send(pid)/total_bytes_sent
Wherein said Bytes_send (pid) is the multiplexing byte number of this PID, and total_bytes_sent is the multiplexing total bytes of MPTS; If Ratio_sent (pid) more than or equal to Ratio_rate (pid), just stops the data of multiplexing this PID.
Further, described video is being carried out when multiplexing, needing to judge the priority relationship between each PID audio frequency, and at first multiplexingly thirsting for most the video that is re-used.
Further, if the part in the described video is a variable code rate, i.e. VBR, the video of a plurality of PID satisfies simultaneously:
Ratio_sent(pid)<Ratio_rate(pid)
Just the video of a plurality of PID need be re-used, and then needs to find out to thirst for being re-used most the PID video; The serious hope degree algorithm of the PID video that need be re-used is as follows:
Desiration(pid)=Ratio_sent(pid)/Ratio_rate(pid)
Desiration (pid) value is more little, shows to thirst for more being re-used; Each minimum PID of this value that takes out is as this multiplexing PID.
Further, need recomputate once instantaneous code check to every frame or several frame data of described variable code rate video.
Further, the computing formula of the instantaneous code check of a described frame variable code rate video data is:
Temp_bitrate(pid)=ts_bytes_current_frame(pid)*8/duration_current_fra?me(pid)
Wherein:
Ts_bytes_current_frame (pid) is the byte number of all TS bags of this PID present frame;
Duration_current_frame (pid) is the time spans of these frame data in MPTS.
Further, under the situation of variable code rate, the computing formula of described duration_current_frame (pid) is:
duration_current_frame(pid)=DTS_next(pid)-current_pcr-Video_Distance(DTS-PCR)
Wherein:
DTS_next (pid) is the current DTS that wants the next frame of transmit frame;
Current_pcr is the PCR in the multiplexing moment;
Video_Distance (DTS-PCR) is initial DTS that is provided with and the interval between the PCR.
Description of drawings
Fig. 1 is the flow chart of multiplexing algorithm disclosed in this invention.
Embodiment
As shown in Figure 1, disclosed algorithm may further comprise the steps among the present invention: calculate the program current time with reference to PCR, reading of data from the SPTS file then, after the reading of data, judge at first whether these data are endings of file, if not, then need whether to want multiplexing pat table to judge to it, if judged result is a "Yes", then multiplexing pat table also turns back to calculating current PC R step; If judged result is a "No", then continue to judge whether it needs multiplexing pmt table lattice, if judged result is a "Yes", then multiplexing pmt table also turns back to calculating current PC R step; If judged result is a "No", then continue to judge in the audio frequency tabulation, whether to have and need multiplexing PID, if judged result is a "Yes", the voice data of multiplexing this PID and turn back to and calculate current PC R step then, if judged result is a "No", then continue to judge in list of videos, whether to have and need multiplexing PID, if judged result is a "Yes", the video data of multiplexing this PID and turn back to and calculate current PC R step then, if judged result is a "No", then multiplexing empty bag, and the initial calculating current PC R step of the program that turns back to, in the step that judges whether " having read EOF " subsequently, the result who obtains is a "Yes", finishes whole algorithm.
The computational methods of the relevant parameter in aforementioned algorithm are as follows:
At first, by following PCR computing module, calculate the value of the PCR of each time:
When multi program multiplex, generally the bandwidth of Shu Chu MPTS is set to fixed-bandwidth.The value of the PCR of each time can be calculated by following formula like this:
PCR(i)=PCR(0)+(total_bytes_sent+10)*8)/total_bit_rate
Wherein:
PCR (i) is if the value of the PCR that inserts.
PCR (0) is the counting of beginning 27M clock when multiplexing, generally can be provided with 0.
Total_bytes_sent is from beginning to be multiplexed into the total amount of byte of TS multiplexing the current MPTS.
The 10th, last position in adjusting field of PCR.
Total_bit_rate is the total bitrate of our the MPTS output that is provided with.
The 8th, byte conversion is become position (down together)
Next step, the PSI/SI form insert module below using need to judge whether multiplexing PAT or pmt table:
In the DVB standard, different forms has stipulated that different transmissions at interval.We can send control at interval according to the time of current TS bag.Deduct time of TS bag when sending form last time with time of current bag, if this interval interval greater than our appointment (this is generally got less than the transmission of form requirement at interval at interval) just sends form one time.Every 500ms sends once as DVB regulation pat table, and we can be provided with to send and be spaced apart 400ms.
Then, the benchmark that uses the DTS/PTS computing module to judge as the time:
DTS/PTS has described the decode time and the demonstration time of ES stream, for video, different and different according to the IBP frame type, the DTS of I frame (decoded time stamp) and PTS (demonstration timestamp) are general identical with PTS or early than PTS, the DTS of P frame is generally early than PTS, and generally having only PTS in the B frame, its DTS is identical with PTS.For audio frequency, have only PTS, DTS is identical with PTS in expression.
For DTS, if its value with respect to PCR too early, will cause the overflow of buffering area,, be equal to or less than system clock if too late, will cause underflow, be a very crucial problem so between DTS and PCR, select a suitable difference.For video, a vbv_delay is arranged in the image head of each ES, it is used for being provided with the buffering area of decoder, to avoid decoder buffer overflow or underflow.Generally we get this difference and are:
0<Video_Distance(DTS-PCR)<=vbv_delay
Every frame video data vbv_delay value is generally about 700ms, also may be a value that constantly changes.
For audio frequency,, generally get according to the experiment situation
0<Audio_Distance(DTS-PCR)<=90ms
Notice that in the equation above, DTS need convert time value to divided by 90K.Identical processing is done in the place that uses DTS below.
At last, according to the description in the DTS/PTS computing module, be used in combination the following audio frequency interleaving block of looking and judge whether Voice ﹠ Video has the multiplexing PID of needs in tabulating.
For each program stream, need earlier audio frequency and video to be separated.
It is multiplexing that the total principle of program stream interlace-multiplex is that the code check shared ratio in the total bitrate of MPTS according to this every frame audio or video itself carries out, and the computing formula that this frame code check of a certain PID audio or video accounts for the ratio of total bitrate is:
Ratio_rate(pid)=bit_rate(pid)/total_bit_rate
Wherein (pid is for specifying the code check of the current participation multiplexed frame of PID for bit_rate.
The computing formula that the multiplexing data of this PID account for the ratio of the multiplexing total data of MPTS is:
Ratio_sent(pid)=Bytes_send(pid)/total_bytes_sent
Wherein Bytes_send (pid) is the multiplexing byte number of this PID, and total_bytes_sent is the multiplexing total bytes of MPTS.If Ratio_sent (pid) more than or equal to Ratio_rate (pid), just stops the data of multiplexing this PID.
Audio frequency
In multiplex process, it is multiplexing preferential audio frequency to all SPTS to carry out, and this is because audio frequency is permanent code check.Its DTS value needs and the basic keeping parallelism of PCR.
The buffering area of audio frequency is less, and fluctuation requires stricter than video to data.
In addition, because for video, the ratio that audio frequency accounts for is too little, so the priority of the audio frequency of each SPTS between carrying out need not considering when multiplexing.
Video
If the video of all SPTS all is permanent code check, can the same issue of priority of not considering each other with audio frequency.If it is variable code rate (VBR) that video is arranged, and the video of a plurality of PID satisfies simultaneously:
Ratio_sent(pid)<Ratio_rate(pid)
Also be that video with regard to a plurality of PID need be re-used, at this moment just need carry out the queuing of priority, find out the video of thirsting for that PID of being re-used most and come these videos that need be re-used, multiplexing at first.The serious hope degree algorithm of the PID video that need be re-used is as follows:
Desiration(pid)=Ratio_sent(pid)/Ratio_rate(pid)
Desiration (pid) value is more little, shows to thirst for more being re-used.We take out the minimum PID of this value as this multiplexing PID at every turn.
For the video of variable code rate, need every frame or a few frame (as a GOP) data to recomputate once instantaneous code check, with frame data is example, and the computing formula of instantaneous code check is: Temp_bitrate (pid)=ts_bytes_current_frame (pid) * 8/duration_current_frame (pid)
Wherein ts_bytes_current_frame (pid) is the byte number of all TS bags of this PID present frame, duration_current_frame (pid) is the time spans of these frame data in MPTS, consider under the situation of variable code rate, the previous frame data might take the space of next frame data, duration_current_frame (pid) should directly not get the interval between the DTS of two frame data, and computing formula is:
duration_current_frame(pid)=DTS_next(pid)-current_pcr-Video_Distance(DTS-PCR)
DTS_next (pid) is the current DTS that wants the next frame of transmit frame, and current_pcr is the PCR in the multiplexing moment.Video_Distance (DTS-PCR) is the DTS of our initial setting and the interval between the PCR.
The present invention is based on and encoded video/audio data are carried out multiplexing, guaranteed the not loss of quality of former video/audio, also reduced the implementation complexity of system simultaneously.
Compare with existing multiplexing algorithm, the present invention is not the system clock according to multiplexing equipment, but calculates in strict accordance with output bandwidth when calculating PCR, guaranteed the stability of output bandwidth; Carrying out audio frequency and video when multiplexing, the ratio in total bandwidth carries out multiplexingly according to every frame or several frame data, has guaranteed that each road program evenly inserts, and needn't use encoder in multiplex process.
For the use of PCR, when multiplexing, can use independent PCR by each program, also can the shared PCR of a plurality of programs.
Can significantly find out difference between the present invention and the prior art by following table:
Figure BSA00000236478900071

Claims (10)

1. the permanent code check TS stream of the Polymera based on a bandwidth usage multiplexing algorithm is characterized by: calculate the program current time with reference to PCR according to output bandwidth, guarantee the stability of output bandwidth; Carry out sound, video multiplex according to the ratio of required multiplex data in total bandwidth, guaranteed that each road program evenly inserts; Make the single-unit order TS stream behind a plurality of codings be multiplexed with the method for Polymera TS stream, and in multiplex process, avoid using encoder.
2. according to algorithm described in the claim 1, it is characterized by: comprise the following steps:
1) calculates the program current time with reference to PCR;
2) reading of data from the SPTS file, and judge whether these data are endings of file; If judged result is "No" then enters step 3); If judged result is "Yes" then finishes whole algorithm;
3) to whether wanting multiplexing pat table to judge, if judged result is "No" then enters step 4); Be the then multiplexing pat table of "Yes" and return step 1) as judged result;
4) to whether wanting multiplexing pmt table to judge; If judged result is "No" then enters step 5); Be the then multiplexing pmt table of "Yes" and return step 1) as judged result;
5) judge in the audio frequency tabulation whether the voice data that needs multiplexing PID is arranged, if judged result is "No" then enters step 6); As judged result is that the then multiplexing voice data with this PID of "Yes" returns step 1);
6) judge whether the video data that needs multiplexing PID is arranged in list of videos, if judged result is "No" then multiplexing empty bag; As judged result is that the then multiplexing video data with this PID of "Yes" returns step 1);
Up to step 2) in judged result be that "Yes" is then finished whole algorithm.
3. algorithm described in claim 1, it is characterized by: the computational methods of described PCR are:
PCR(i)=PCR(0)+(total_bytes_sent+10)*8)/total_bit_rate
Wherein:
PCR (i) is the value of the PCR that will insert;
PCR (0) is the counting of beginning 27M clock when multiplexing, generally can be provided with 0;
Total_bytes_sent is from beginning to be multiplexed into the total amount of byte of TS multiplexing the current MPTS;
The 10th, last position in adjusting field of PCR;
Total_bit_rate is the total bitrate of our the MPTS output that is provided with;
The 8th, byte conversion is become the position.
4. algorithm described in claim 2 is characterized by: come determining step 3 by the PSI/SI form insert module of using) and 4), and draw the conclusion that whether needs multiplexing PAT or pmt table.
5. algorithm described in claim 2 is characterized by: multiplexing total principle of the audio or video step 5) and 6) is that the code check shared ratio in the total bitrate of MPTS according to this every frame audio or video itself carries out multiplexing:
The computing formula that this frame code check of a certain PID audio or video accounts for the ratio of total bitrate is:
Ratio_rate(pid)=bit_rate(pid)/total_bit_rate
Wherein (pid is for specifying the code check of the current participation multiplexed frame of PID for bit_rate;
The computing formula that the multiplexing data of this PID account for the ratio of the multiplexing total data of MPTS is:
Ratio_sent(pid)=Bytes_send(pid)/total_bytes_sent
Wherein said Bytes_send (pid) is the multiplexing byte number of this PID, and total_bytes_sent is the multiplexing total bytes of MPTS; If Ratio_sent (pid) more than or equal to Ratio_rate (pid), just stops the data of multiplexing this PID.
6. according to algorithm described in the claim 1, it is characterized by: described video is being carried out when multiplexing, needing to judge the priority relationship between each PID audio frequency, and at first multiplexingly thirsting for most the video that is re-used.
7. according to algorithm described in the claim 6, it is characterized by: if the part in the described video is a variable code rate, i.e. VBR, the video of a plurality of PID satisfies simultaneously:
Ratio_sent(pid)<Ratio_rate(pid)
Just the video of a plurality of PID need be re-used, and then needs to find out to thirst for being re-used most the PID video; The serious hope degree algorithm of the PID video that need be re-used is as follows:
Desiration(pid)=Ratio_sent(pid)/Ratio_rate(pid)
Desiration (pid) value is more little, shows to thirst for more being re-used; Each minimum PID of this value that takes out is as this multiplexing PID.
8. according to algorithm described in the claim 7, it is characterized by: need recomputate once instantaneous code check every frame or several frame data of described variable code rate video.
According to Claim 8 described in algorithm, it is characterized by: the computing formula of the instantaneous code check of a described frame variable code rate video data is:
Temp_bitrate (pid)=ts_bytes_current_frame (pid) * 8/duration_current_frame (pid) is wherein:
Ts_bytes_current_frame (pid) is the byte number of all TS bags of this PID present frame;
Duration_current_frame (pid) is the time spans of these frame data in MPTS.
10. according to algorithm described in the claim 9, it is characterized by: under the situation of variable code rate, the computing formula of described duration_current_frame (pid) is:
duration_current_frame(pid)=DTS_next(pid)-current_pcr-Video_Distance(DTS-PCR)
Wherein:
DTS_next (pid) is the current DTS that wants the next frame of transmit frame;
Current_pcr is the PCR in the multiplexing moment;
Video_Distance (DTS-PCR) is initial DTS that is provided with and the interval between the PCR.
CN 201010258164 2010-08-19 2010-08-19 Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm Active CN101945265B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010258164 CN101945265B (en) 2010-08-19 2010-08-19 Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010258164 CN101945265B (en) 2010-08-19 2010-08-19 Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm

Publications (2)

Publication Number Publication Date
CN101945265A true CN101945265A (en) 2011-01-12
CN101945265B CN101945265B (en) 2013-05-08

Family

ID=43436995

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010258164 Active CN101945265B (en) 2010-08-19 2010-08-19 Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm

Country Status (1)

Country Link
CN (1) CN101945265B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111131858A (en) * 2019-12-30 2020-05-08 杭州当虹科技股份有限公司 Method for fixing code rate based on TS video PID

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1287745A (en) * 1998-11-04 2001-03-14 夏普公司 Digital broadcast receiving system
CN1381148A (en) * 2000-03-31 2002-11-20 皇家菲利浦电子有限公司 Methods and apparatus for making and replaying digital video recordings, and recordings made by such method
CN1411280A (en) * 2002-11-21 2003-04-16 北京中科大洋科技发展股份有限公司 Apparatus for making, transmitting and receiving broadcasting type quasi video frequency requested program
CN1681325A (en) * 2000-06-09 2005-10-12 通用仪器公司 Video size conversion and transcoding from MPEG-2 to MPEG-4
CN1794812A (en) * 2005-12-05 2006-06-28 上海广电(集团)有限公司中央研究院 Method of transmission flow multiplex
CN101068366A (en) * 2007-06-05 2007-11-07 南京大学 H.264 based multichannel video transcoding multiplexing method and multiplexer
CN101193290A (en) * 2006-11-22 2008-06-04 中兴通讯股份有限公司 A real time conversion system from MPEG-4 transmission code stream to Internet stream media alliance stream
CN101212671A (en) * 2007-12-21 2008-07-02 上海广电(集团)有限公司中央研究院 Low-delay real-time transport stream multiplexing method
CN101282483A (en) * 2007-03-28 2008-10-08 株式会社日立国际电气 Program clock reference correction circuit
CN101287127A (en) * 2008-02-26 2008-10-15 四川金网通电子科技有限公司 Terrestrial digital television system

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1287745A (en) * 1998-11-04 2001-03-14 夏普公司 Digital broadcast receiving system
CN1381148A (en) * 2000-03-31 2002-11-20 皇家菲利浦电子有限公司 Methods and apparatus for making and replaying digital video recordings, and recordings made by such method
CN1681325A (en) * 2000-06-09 2005-10-12 通用仪器公司 Video size conversion and transcoding from MPEG-2 to MPEG-4
CN1411280A (en) * 2002-11-21 2003-04-16 北京中科大洋科技发展股份有限公司 Apparatus for making, transmitting and receiving broadcasting type quasi video frequency requested program
CN1794812A (en) * 2005-12-05 2006-06-28 上海广电(集团)有限公司中央研究院 Method of transmission flow multiplex
CN101193290A (en) * 2006-11-22 2008-06-04 中兴通讯股份有限公司 A real time conversion system from MPEG-4 transmission code stream to Internet stream media alliance stream
CN101282483A (en) * 2007-03-28 2008-10-08 株式会社日立国际电气 Program clock reference correction circuit
CN101068366A (en) * 2007-06-05 2007-11-07 南京大学 H.264 based multichannel video transcoding multiplexing method and multiplexer
CN101212671A (en) * 2007-12-21 2008-07-02 上海广电(集团)有限公司中央研究院 Low-delay real-time transport stream multiplexing method
CN101287127A (en) * 2008-02-26 2008-10-15 四川金网通电子科技有限公司 Terrestrial digital television system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111131858A (en) * 2019-12-30 2020-05-08 杭州当虹科技股份有限公司 Method for fixing code rate based on TS video PID

Also Published As

Publication number Publication date
CN101945265B (en) 2013-05-08

Similar Documents

Publication Publication Date Title
US10827208B2 (en) Transmitting method, receiving method, transmitting device and receiving device
US9967616B2 (en) Method and system for priority-based digital multi-stream decoding
US11722702B2 (en) Method and apparatus for decoding an enhanced video stream
US7433946B2 (en) Mechanism for transmitting elementary streams in a broadcast environment
TW477128B (en) Using a receiver model to multiplex variable-rate bit streams having timing constraints
EP2253070B1 (en) Method and apparatus for demultiplexing a scalable video stream
US7486680B1 (en) Packet schedule timestamp for a compressed bitstream
EP0897245A2 (en) MPEG frame processing method and apparatus
US7630366B2 (en) Multiplexing apparatus, multiplexing method, program, and recording medium
US11722714B2 (en) Transmitting method, receiving method, transmitting device and receiving device
US20100232453A1 (en) Information processing apparatus and multiplexing method
CN101605252A (en) Program stream is converted to the method and system of transport stream
US10506265B2 (en) Transmitting method, receiving method, transmitting device and receiving device
US20070237187A1 (en) Multiplexer and multiplexing method
CN100499821C (en) Method for statistics of multiplex transmission stream
CA2359731A1 (en) Method and apparatus for delivering reference signal information within a specified time interval
CN101945265B (en) Bandwidth occupancy rate based multi-program constant code rate TS flow multiplexing algorithm
KR100732323B1 (en) Bandwidth control method and apparatus for transmission of auxiliary data in terrestiral dmb broadcasting system
US10080050B2 (en) System and method for insertion of a program clock reference during packetization of an encoded data stream
CN111988641B (en) Transport stream multiplexing audio and video time synchronization method
CN111131858B (en) Method for fixing code rate based on TS video PID
US8046623B2 (en) Timing recovery apparatus and method thereof
KR20080072169A (en) Clock reference recovery apparatus and method
Chen Examples of Video Transport Multiplexer

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
C56 Change in the name or address of the patentee

Owner name: BEIJING BOHUI TECHNOLOGY CO., LTD.

Free format text: FORMER NAME: BEIJING BOHUI SCIENCE AND TECHNOLOGY CO., LTD.

CP03 Change of name, title or address

Address after: 100094, No. 501, No. 7, incubator building, Feng Yin Middle Road, Yongfeng industry base, Beijing, Haidian District, B

Patentee after: Bo Hui Science and Technology Co., Ltd. of Beijing

Address before: 100085, Beijing, Haidian District on the East Road, No. 1, building 4, 6 floor

Patentee before: Beijing Bohui Technology Co., Ltd.