영어 해석 좀 해주세요
-
게시물 수정 , 삭제는 로그인 필요
<!--StartFragment--> Audio data consists of 9 blocks of 76 bytes, giving a maximum audio data rate of 10 tracks/frame * 9 blocks/track * 76 bytes/block * 8 bits/byte * 29.97 frames/sec = 1.64 Mbps. Four 32-kHz, 12-bit channels require a data rate of 4 channels * 32/1000 MHz * 12 bits = 1.536 Mbps, the maximum digital audio data rate. (Two 48-kHz, 16-bit channels also need 2 * 48/1000 * 16 = 1.536 Mbps.) The aggregate recording rate, including parity but less the ITI sector, is about 10 * ((90 * 163) + (12 * 12)) * 8 * 29.97 = 35.5 Mbps. Thus about 35.5 - 25.15 - 1.64 = 8.7 Mbps or about 25 percent of the recorded data is devoted to subcode data, error detection, and error correction. Video and audio data is accompanied by error-correcting rank (inner) and file (outer) parity codes. Figure 7 shows a simple error correction system created by a single outer and inner parity bit for an 8- by 8-bit matrix (8 bytes). To create the parity bit, you count the number of 1 bits in each column and row. Add a 1 to the parity cell for columns or rows with an uneven number of 1 bits (called even parity.) If a single bit gets "flipped" during recording or playback, the inner and outer parity bits can locate the flipped bit and correct the error. Single-bit parity, however, can't correct multiple-bit errors in a single column or row for a bit matrix larger than 3 by 3. More sophisticated error correction codes based on polynomial expansions are used for large blocks of data. Like CD-ROMs, DV uses Reed-Solomon (RS) error detection and correction coding. RS can correct localized errors, but seldom can reconstruct data damaged by a dropout of significant size (burst error). Error concealment techniques use an estimate of the missing data based on preceding and succeeding fields or frames; error concealment techniques are not described in the Specification. If concealment is implemented in DV devices, it is assumed that proprietary methods will be used, because concealment is a device-internal function. Concealment is a very complex process and requires a substantial amount of RAM to be successful.
Video and audio data is accompanied by error-correcting rank (inner) and file (outer) parity codes. Figure 7 shows a simple error correction system created by a single outer and inner parity bit for an 8- by 8-bit matrix (8 bytes). To create the parity bit, you count the number of 1 bits in each column and row. Add a 1 to the parity cell for columns or rows with an uneven number of 1 bits (called even parity.) If a single bit gets "flipped" during recording or playback, the inner and outer parity bits can locate the flipped bit and correct the error. Single-bit parity, however, can't correct multiple-bit errors in a single column or row for a bit matrix larger than 3 by 3. More sophisticated error correction codes based on polynomial expansions are used for large blocks of data. Like CD-ROMs, DV uses Reed-Solomon (RS) error detection and correction coding. RS can correct localized errors, but seldom can reconstruct data damaged by a dropout of significant size (burst error). Error concealment techniques use an estimate of the missing data based on preceding and succeeding fields or frames; error concealment techniques are not described in the Specification. If concealment is implemented in DV devices, it is assumed that proprietary methods will be used, because concealment is a device-internal function. Concealment is a very complex process and requires a substantial amount of RAM to be successful.
#영어 해석 #영어 해석기 #영어 해석 잘하는법 #영어 해석 순서 #영어 해석 연습 #영어 해석 잘하는법 디시 #영어 해석해 줘 #영어 해석하는 법 #영어 해석이 안되는 이유 #영어 해석 방법
