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

More documents

Recommendations

Info

When operating with QCIF the number of bits created by coding any single picture musí not exceed 64 -K bits. In both the above cases the bit count includes the picture start code and all other data related to Üiat picture including PSPAKE, GSPARE and MBA stuffíng. The bit count does not include error correction framing bits, fill indicator (Fi), fill bits or error correction parity'information described in § 5.4 below. Video data must be provided on every valid clock cycle. This can be ensured by the use of either the fill bit indicator (Fi) and subsequent fill all l's bits in the error corrector block framing (see Figure 13/H.261) or MBA stuffing (§ 4.2.3) or both. 5.3 Video coding delay HGURE 13/H.261 This item is included in this Recommendation because the video encoder and video decoder delays need to be known. to allow audio compensation delays to be íixed when H.261 is used to form part of a conversational service. This will afíow lip synchronization to be maintained. Annex C recommends a method by which the delay figures are established. Other delay measurement methods may be used but they must be designed in a way to produce similar results to the method given in Annex C. 5.4 Fonvard error correction for codea video signa! 5.4,1 Error correctlng code ! The transmitted bitstream contains a BCH (511,493) fonvard error correction code. Use of this by the decoder is optional.
5.4.2 Generator polynomial g(x) = (x* + x^ Example: for the input data of "01111 . . . 11" (493 bits) the resulting correction parity bits are "011011010100011011" (18 bits). 5.4.3 Error correction framing To allow the video data and error correction parity information to be identifíed by a decoder an error correction framing pattern is included. This consistí of a multiframe of eight frames, each frame comprising 1 bit framing, 1 bit fill indicator (Fi), 492 bits of coded data (or £11 all Is) and 18 bits parity. The frame alignment pattern is: (SiS2S3S4S5S6S7S8) = (00011011). See Figure 13/H.261 for the frame arrangement. The parity is calcúlate*! against the 493-bits including fill indicator (Fi). The fill indicator (Fi) can be set to zero by an encoder. In this case only 492 consecutive fill bits (fill all Is) plus parity are sent and no coded data is transmitted. This may be used to meet the requirement in § 5.2 to provide video data on every valid clock cycle. 5.4.4 Relock time for error corrector framing Three consecutive error correction framing sequences (24 bits) should be received before frame lock is deemed to have been aclüeved. The decoder should be designed such that frame lock will be re-established within 34 000 bits after an error corrector framing phase change. ¿Cuo o< Note — This assumes that the video data does not contain three correctly phased emulations of the error correction framing sequence during the relocking period. ANNEXA (to Recommendatíon H.261) Inverse transform accuracy specifícation A.l Genérate random integer peí data valúes in the range -L to +H according to the random number generator given below ("C" versión). Arrange into 8 by 8 blocks. Data set of 10 000 blocks should each be generated for (L = 256, H=255), (L = H=5)and(L = H = A.2 'For each 8 by 8 block, perform a separable, orthonormal, matrix multiply, fonvard discrete cosine transform using at least 64-bit floating point accuracy. \\ith u, v^x,y~ O, 1,2,.. .,7 7 7 F(u, v) = 1/4 C(w) C(v) £ Z A*, y) eos [n (2x + 1) u/16] eos [n (2y + 1) v/16] x=0 y=0 where xy = spatial coordinates in the peí domain, u,v = coordinates in the transform domain, C(w) = I/ -v/2 for u = O, othenvise 1, C(v) = I/ ^2 for v = O, othenvise 1.
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: FLC 0000 0001 (1) 0000 0010 (2) 000
Page 209 and 210: ANNEXB (to Recommendation H.261) Hy
Page 211 and 212: A video sequence lasting more than
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 ...

Create successful ePaper yourself

Delete template?

Save as template?