As the number of different video compression algorithms in use and also the specific bit rates at which they are operated increase, there is a growing need for converters from one algorithm or bit rate to another. In general, this can only be accomplished by decoding and re-encoding. It has previously been assumed that the additional delays introduced by such decoding and re-encoding are additive and thereby become unacceptable for some interactive applications. This paper shows that it is possible to construct a transcoder such that the aggregate end-to-end delay is substantially less than the sum of the delays from the two encode and decode pairs. Two techniques are described. The first is more general while the second is simpler but is restricted to the case of reducing the bit rate and keeping the same compression algorithm. Results from simulations of the latter method are included.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Geoffrey MORRISON, "Video Transcoders with Low Delay" in IEICE TRANSACTIONS on Communications,
vol. E80-B, no. 6, pp. 963-969, June 1997, doi: .
Abstract: As the number of different video compression algorithms in use and also the specific bit rates at which they are operated increase, there is a growing need for converters from one algorithm or bit rate to another. In general, this can only be accomplished by decoding and re-encoding. It has previously been assumed that the additional delays introduced by such decoding and re-encoding are additive and thereby become unacceptable for some interactive applications. This paper shows that it is possible to construct a transcoder such that the aggregate end-to-end delay is substantially less than the sum of the delays from the two encode and decode pairs. Two techniques are described. The first is more general while the second is simpler but is restricted to the case of reducing the bit rate and keeping the same compression algorithm. Results from simulations of the latter method are included.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_6_963/_p
Copy
@ARTICLE{e80-b_6_963,
author={Geoffrey MORRISON, },
journal={IEICE TRANSACTIONS on Communications},
title={Video Transcoders with Low Delay},
year={1997},
volume={E80-B},
number={6},
pages={963-969},
abstract={As the number of different video compression algorithms in use and also the specific bit rates at which they are operated increase, there is a growing need for converters from one algorithm or bit rate to another. In general, this can only be accomplished by decoding and re-encoding. It has previously been assumed that the additional delays introduced by such decoding and re-encoding are additive and thereby become unacceptable for some interactive applications. This paper shows that it is possible to construct a transcoder such that the aggregate end-to-end delay is substantially less than the sum of the delays from the two encode and decode pairs. Two techniques are described. The first is more general while the second is simpler but is restricted to the case of reducing the bit rate and keeping the same compression algorithm. Results from simulations of the latter method are included.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Video Transcoders with Low Delay
T2 - IEICE TRANSACTIONS on Communications
SP - 963
EP - 969
AU - Geoffrey MORRISON
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1997
AB - As the number of different video compression algorithms in use and also the specific bit rates at which they are operated increase, there is a growing need for converters from one algorithm or bit rate to another. In general, this can only be accomplished by decoding and re-encoding. It has previously been assumed that the additional delays introduced by such decoding and re-encoding are additive and thereby become unacceptable for some interactive applications. This paper shows that it is possible to construct a transcoder such that the aggregate end-to-end delay is substantially less than the sum of the delays from the two encode and decode pairs. Two techniques are described. The first is more general while the second is simpler but is restricted to the case of reducing the bit rate and keeping the same compression algorithm. Results from simulations of the latter method are included.
ER -