Tesis previa a la obtención del Título de Ingeniero en Electrónica y ...

More documents

Recommendations

Info

where: To meet this requirement the number of bits for the (w+l)th coded picture dn+± must satisfy: bn is buffer occupancy just after the time tn, tn is the time the nth coded picture is removed from the HRD buffer, R(f) is the video bit rate at the time t. ANNEX C (to Recommendation H.261) Codee delay measurement method The video encoder and video decoder delays wül vary depending on implementation. The delay will also depend on the picture íbnnat (QCIF, CIF) and data rate in use. This annex specifies the method by which the delay figures are established for a particular design. To allow correct audio delay compensatíon the overall video delay needs to be established from a user perception point of view under typical viewing conditions. FIGURE C.1/H.261 Point A is the video input to the video coder. Point B is the channel output from the video terminal (i.e. including any KEC, channel framing, etc.). Point C is the video outputfrom the decoder.
A video sequence lasting more than 100 seconds is connected to the video coder input (point A) in Figure C-1/H.261 above. The video sequence should nave the following characteristics: - it should contain a typical moving scene consistent with the intended purpose of the video codee; - it should produce a mínimum coded picture rate of 7.5 Hz at the bit rate in use; it should contain a visible identification mark at intervals throughout the length of the sequence. The visible identification should change every 97 video input frames and be located within the picture área represented by the first GOB in the picture. For example, the first block in the picture could change from black to white at intervals of 97 video frame periods. The identification mark should be chosen so that it can be detected at point B and does not significantly contribute to the overall coding performance. The codee and video sequence should be arranged so that the bitstream contains less than 10% stuffing (MBA stuffing + error correction fill bits). The encoder delay is obtained by measuring the time from when the visible identification changes at point A to the time that the change is detected at point B. Similarly, the decoder delay is obtained by taking measurements at points B and C. Several measurements should be made during the sequence length and the average period obtained. Several tests should be made to ensure that a consistent average figure can be obtained for both encoder and decoder delay times. Average results should be obtained for each combination of picture format and bit rate within the capability of the particular codee design. Note — Due to pre- and post-temporal processing it may be necessary to take a mid-level for establishing the transition of the identification mark at points B and C.
Page 1 and 2:
ESCUELA POLITÉCNICA NACIONAL FACUL
Page 3 and 4:
2.2.2 Clasificación de los servici
Page 5 and 6:
ESTUDIO Y PLANIFICACIÓN DE UN MODE
Page 7 and 8:
CAPITULO I 1.- PRINCIPIOS DE FUNCIO
Page 9 and 10:
Para el proceso de liberación de l
Page 11 and 12:
1.2 NORMAS DE COMUNICACION.- Los co
Page 13 and 14:
• Control de Sistema: unidad que
Page 15 and 16:
2. Para múltiples canales de B/H0|
Page 17 and 18:
1.3.- ALGORITMOS DE CODIFICACIÓN Y
Page 19 and 20:
quiere decodificar, el rendimiento
Page 21 and 22:
Codificador de Capa Diferencial .1
Page 23 and 24:
entrada son formateados para la com
Page 25 and 26:
modelos toman ventaja de la baja se
Page 27 and 28:
Quinto. La estructura y los paráme
Page 29 and 30:
de búsqueda. La mayoría de aplica
Page 31 and 32:
avanzada) o del recuadro de referen
Page 33 and 34:
LA RED DIGITAL DE SERVICIOS INTEGRA
Page 35 and 36:
2.1.1 Establecimiento de una RDSI.-
Page 37 and 38:
SoT a) Escenario Irrtercerrtrales b
Page 39 and 40:
2.2 VÍDEO COMUNICACIONES EN LA RDS
Page 41 and 42:
A continuación se describe el tipo
Page 43 and 44:
2.3.2 RDSI de Banda Ancha (RDSIBA).
Page 45 and 46:
ealizar enlaces de comunicación en
Page 47 and 48:
Esto era imposible para una red STM
Page 49 and 50:
ase de la estructura de esta aplica
Page 51 and 52:
Esta aplicación genera muchos y mu
Page 53 and 54:
CAPITULO III 3.1. EL VIDEO TELÉFON
Page 55 and 56:
3.1.1.3 Modo de Operación.- Para e
Page 57 and 58:
El video teléfono Picasso esta com
Page 59 and 60:
Pórtico Paralelo Procesador Host M
Page 61 and 62:
Mbytes de memoria para compresión
Page 63 and 64:
mouse que permite realizar este tip
Page 65 and 66:
eco de la habitación, permitiendo
Page 67 and 68:
obtener una buena imagen, un correc
Page 69 and 70:
El circuito de procesador lo diseñ
Page 71 and 72:
Tx Fkj. 3.5 Diagrama de bloques del
Page 73 and 74:
VIDEOCONFERENC1AS PUNTO A PUNTO A T
Page 75 and 76:
video en software se apoyan por lo
Page 77 and 78:
ejemplo, una empresa de diseño pod
Page 79 and 80:
CAPITULO IV ESTUDIO Y PLANIFICACIÓ
Page 81 and 82:
Para realizar la transmisión de'in
Page 83 and 84:
Características de las Fibras Máx
Page 85 and 86:
RELLENO DE GRASA FIBRA DE V1DEOCOM
Page 87 and 88:
) Pérdidas por Absorción Las pér
Page 89 and 90:
Red en Estrella. Las redes en estre
Page 91 and 92:
La decisión con respecto al númer
Page 93 and 94:
C. Determinación del Promedio de P
Page 95 and 96:
La atenuación máxima normalizada
Page 97 and 98:
utilizará enlace aéreo a través
Page 99 and 100:
Manhote Hardware 1 Cajetín de empa
Page 101 and 102:
En el presente diseño se plantea t
Page 103 and 104:
4.3.1.5 COSTOS TOTALES DE OPERACIÓ
Page 105 and 106:
Las normas de codificación de imá
Page 107 and 108:
6 Piso SIMBOLOGIA EH3 = Hub = Eieme
Page 109 and 110:
Calle Japón MAPA DE UBICACIÓN 0 9
Page 111 and 112:
FOREWORD e ITU Telecommunication St
Page 113 and 114:
INTRODÜCTION e purpose of this Rec
Page 115 and 116:
Bit number 1 2 3 * 5 6 7 8 (SC) S u
Page 117 and 118:
e FAW consists of "0011011" ¡n bit
Page 119 and 120:
ime alignment is defined to have be
Page 121 and 122:
le decoded BAS valué is valíd if:
Page 123 and 124:
ec. G.711 50 1 : 57 : 106 113 120 5
Page 125 and 126:
B!t1 M \ A2 3 A3 TS1 Inltial channe
Page 127 and 128:
[0] [1] [2] [3] [4] [5] [6] [7] [8]
Page 129 and 130:
;utral j-off, U a-off, F -law, OU
Page 131 and 132:
id-Ioop Video loop request (see Rec
Page 133 and 134:
'29.97 '29.97 id-imp(R) ideo-ISO V-
Page 135 and 136:
[0] [1] [2] [3] [4] [5] [6] m [8] [
Page 137 and 138:
irsor data on in LSD Cursor data sw
Page 139 and 140:
INTERNATIONAL TELECOMMUNICATION UNI
Page 141 and 142:
Recommendation H.230 1 Introduction
Page 143 and 144:
3.4 C&I related to simple multipoin
Page 145 and 146:
TABLE 1/H.230 Code First 3 bits (00
Page 147 and 148:
FOREWORD Che ITU Telecommunication
Page 149 and 150:
¿Vnnex A — Identification of the
Page 151 and 152:
'he total capability of a terminal
Page 153 and 154:
ourBAS attríbutes are commands: th
Page 155 and 156:
ame reínstatement sequence C ¡tho
Page 157 and 158:
4WOA TX m mode OF, BAS-cap.cycle FA
Page 159 and 160: TERMINAL X Incommg signal ramed Out
Page 161 and 162: ) Additional channels idle — This
Page 163 and 164: iv) wait for confirmation that the
Page 165 and 166: ) Procedurefor activation and de-ac
Page 167 and 168: Rec. V.35 VT DSU VT 0 sil E g DDS o
Page 169 and 170: Note that the valué (111) [24] is
Page 171 and 172: To ensure that the picture builds u
Page 173 and 174: Appendix I Initialization: Case of
Page 175 and 176: TERMINAL-X- Start communication TER
Page 177 and 178: TERMINAL "X- Swltch to mode OF L Se
Page 179 and 180: Appendix IV Examples of symmetrical
Page 181 and 182: Appendix VI Hierarchical capability
Page 183 and 184: or! Error! ot a valid leñame. INTE
Page 185 and 186: iecommendation H.261 'onsideríng e
Page 187 and 188: ,4 Source codirig olgorithm . . ,,
Page 189 and 190: 3.2.2 Motion compensation FIGURE 3/
Page 191 and 192: 3.2.6 Clipping of reconstructed pic
Page 193 and 194: 4.2.1 Picture ¡ayer Data for each
Page 195 and 196: 4.2.2.5 Spare Information (GSPARE)
Page 197 and 198: Intra Intra Prediction ínter ínte
Page 199 and 200: CBP 60 4 8 16 32 12 48 20 40 28 MVD
Page 201 and 202: 1 3 4 10 11 21 22 36 2 5 9 12 20 23
Page 203 and 204: Run 2 2 2 2 2 3 3 3 3 4 4 4 5 5 5 6
Page 205 and 206: FLC 0000 0001 (1) 0000 0010 (2) 000
Page 207 and 208: 5.4.2 Generator polynomial g(x) = (
Page 209: ANNEXB (to Recommendation H.261) Hy
Page 213 and 214: FOREWORD be ITU Telecommunication S
Page 215 and 216: System description 1 ' Block diagra
Page 217 and 218: ,3.2 Terminal types of visual telep
Page 219 and 220: )IIowing the conneclion esiahlishmm
Page 221 and 222: case the cali is dísconnecied for
Page 223 and 224: flaco wcu Maintenance Conference Te
Page 225 and 226: ) Loop ai lerminal-nelwork inlerl'a
Page 227: MARTIN E. ZULTOSKI, Aplicaciones de
show all

Tesis previa a la obtención del Título de Ingeniero en Electrónica y ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?