← Back to Patent Explorer
US5519443A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for providing dual language captioning of a television program

Assignee: National Captioning Institute Inc
•
Filing: 1994-03-14
•
Granted: 1996-05-21
•
Expires: 2014-03-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of decoding data for a language having the Roman alphabet or a language having a syllabic alphabet from a television data stream includes the steps of receiving the data in the form of data packets and determining from bit values stored at particular bit positions whether the data is control data or represents printable character data comprising a head code or a tail code. Once it is determined that the data represents either a head code or a tail code of a printable character, the data bytes are valued for parity and, from that determination, a letter component is generated which points to a letter component or complete character for one or the other alphabet. Because characters of a syllabic language may be quite complex, the step of displaying the syllabic language character includes the steps of overlaying two or more letter components to form the syllabic character image.

Inventors

  • 👤 Amnon M. Salomon
  • 👤 Anthony M. Faust

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 09:09
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/40; H04N21/47; H04N21/488; H04N21/4884; H04N5/00; H04N5/76; H04N5/91; H04N5/92; H04N5/9201; H04N5/9206; H04N5/9208; H04N5/93; H04N7/00; H04N7/025; H04N7/035; H04N7/08; H04N7/087; H04N7/088; H04N7/0884; H04N7/0885

Claims Analysis

Total Claims: 33
Claim 1
Independent Claim 181 words
In decoder apparatus for decoding data encoded in caption layer data of a television data stream, a method for decoding the encoded data characterized by steps of: receiving the encoded data as service blocks, each service block comprising a header and at least two data bytes, retrieving data packets from the service blocks, decoding the data packets, each data packet comprising a plurality of data bytes, the data packets indicated by particular bit indications appearing in one of the plurality of bytes of each data packet, storing a plurality of letter components in memory for at least two languages, a first language having the Roman alphabet and a second language having a syllabic alphabet, determining if the data packet represents a non-printable character, and mapping remaining bit positions of the data packet for a printable character into a number of letter component pointer bytes less than or equal to the number of bytes comprising the data packets, the letter component pointer bytes for pointing to one of a Roman alphabet letter and a syllabic alphabet letter component in memory for display.
Claim 2
Dependent Claim 181 words
In decoder apparatus for decoding data encoded in caption layer data of a television data stream, a method for decoding the encoded data characterized by steps of: receiving the encoded data as service blocks, each service block comprising a header and at least two data bytes, retrieving data packets from the service blocks, decoding the data packets, each data packet comprising a plurality of data bytes, the data packets indicated by particular bit indications appearing in one of the plurality of bytes of each data packet, storing a plurality of letter components in memory for at least two languages, a first language having the Roman alphabet and a second language having a syllabic alphabet, determining if the data packet represents a non-printable character, and mapping remaining bit positions of the data packet for a printable character into a number of letter component pointer bytes less than or equal to the number of bytes comprising the data packets, the letter component pointer bytes for pointing to one of a Roman alphabet letter and a syllabic alphabet letter component in memory for display.
Claim 3
Dependent Claim 151 words
In decoder apparatus for decoding data encoded in capture layer data of a television data stream, a method for decoding the encoded data characterized by steps of: decoding data packets, each data packet comprising one head code and three tail codes, the data packets indicated by particular bit indications appearing in the head code of each data packet, storing a plurality of letter components in memory for at least two languages, a first language having the Roman alphabet and a second language having a syllabic alphabet, determining if the data packet represents a non-printable character, and mapping remaining bit positions of the data packet for a printable character into a number of letter component pointer bytes less than or equal to the number of bytes comprising the data packets, the letter component pointer bytes for pointing to a Roman alphabet letter or a syllabic alphabet letter component in memory for display.
Claim 4
Dependent Claim 151 words
In decoder apparatus for decoding data encoded in capture layer data of a television data stream, a method for decoding the encoded data characterized by steps of: decoding data packets, each data packet comprising one head code and three tail codes, the data packets indicated by particular bit indications appearing in the head code of each data packet, storing a plurality of letter components in memory for at least two languages, a first language having the Roman alphabet and a second language having a syllabic alphabet, determining if the data packet represents a non-printable character, and mapping remaining bit positions of the data packet for a printable character into a number of letter component pointer bytes less than or equal to the number of bytes comprising the data packets, the letter component pointer bytes for pointing to a Roman alphabet letter or a syllabic alphabet letter component in memory for display.
Claim 5
Dependent Claim 144 words
In decoder apparatus for decoding data encoded in capture layer data of a television data stream, a method for decoding the encoded data characterized by the steps of decoding data packets, each data packet comprising four bytes, the data packets indicated by particular bit indications appearing in one of the four bytes of each data packet, storing a plurality of letter components in memory for at least two languages, a first language having the Roman alphabet and a second language having a syllabic alphabet, determining if the data packet represents a non-printable character, and mapping remaining bit positions of the data packet for a printable character into a number of letter component pointer bytes less than or equal to the four bytes, the letter component pointer bytes for pointing to a Roman alphabet letter or a syllabic alphabet letter component in memory for display.
Claim 6
Dependent Claim 144 words
In decoder apparatus for decoding data encoded in capture layer data of a television data stream, a method for decoding the encoded data characterized by the steps of decoding data packets, each data packet comprising four bytes, the data packets indicated by particular bit indications appearing in one of the four bytes of each data packet, storing a plurality of letter components in memory for at least two languages, a first language having the Roman alphabet and a second language having a syllabic alphabet, determining if the data packet represents a non-printable character, and mapping remaining bit positions of the data packet for a printable character into a number of letter component pointer bytes less than or equal to the four bytes, the letter component pointer bytes for pointing to a Roman alphabet letter or a syllabic alphabet letter component in memory for display.
Claim 7
Dependent Claim 17 words
A method according to claim 1 wherein the number of bytes of each data packet is three.
Claim 8
Dependent Claim 18 words
A method according to claim 1 wherein each data packet comprises one head code and two tail codes.
Claim 9
Dependent Claim 15 words
A method according to claim 3 wherein the number of letter component bytes is three.
Claim 10
Dependent Claim 72 words
A method according to claim 1 further comprising a step of generating one or more letter blocks for display, wherein if the letter component pointer bytes point to a syllabic alphabet, one letter block is formed from two or more letter components, but if the letter component pointer bytes point to the Roman alphabet, one or more letter blocks are formed, each letter block corresponding to a single letter component pointer byte.
Claim 11
Dependent Claim 35 words
A method according to claim 7 further comprising the step of displaying a syllabic language syllable approximately three quaffer inch in height on a standard resolution television screen having approximately a 19 inch diagonal screen.
Claim 12
Dependent Claim 32 words
A method according to claim 7 wherein if the letter component pointer bytes point to a syllabic alphabet, the one letter block is formed by overlaying the two or more letter components.
Claim 13
Dependent Claim 25 words
A method according to claim 2 further comprising the step of evaluating at least two predetermined bit positions of each byte of the data packet.
Claim 14
Dependent Claim 26 words
A method according to claim 10 wherein the predetermined bit positions of each byte of the data packet comprise no more than two predetermined bit positions.
Claim 15
Dependent Claim 31 words
A method according to claim 10 wherein each byte of each data packet comprises eight bits numbered 0 through 7 and the predetermined bit positions comprise at least bit position 6.
Claim 16
Dependent Claim 75 words
A method according to claim 1 further comprising a step of evaluating whether a syllabic or non-syllabic mode has been selected for the decoder apparatus, and if the syllabic mode has been selected, mapping the remaining bit positions of the data packet into letter component pointer bytes for pointing to a syllabic alphabet, and if the syllabic mode has not been selected, mapping the remaining bit positions of the data packet into the Roman alphabet.
Claim 17
Dependent Claim 27 words
A method according to claim 1 further comprising an initial step of counting lines to determine one of two fields, each field representing a different language channel.
Claim 18
Dependent Claim 202 words
Apparatus for decoding data encoded in caption layer data of a television data stream, the apparatus comprising: a data extractor for extracting the encoded data from the caption layer data and outputting the extracted data, a closed caption data controller, responsive to the data extractor, for stripping parity from the extracted data, for determining whether the data comprises a printable character, and for outputting pointer data, a display random access memory having a plurality of pointer registers responsive to the closed caption data controller, and a character memory, responsive to the display random access memory, for outputting selected character data, the apparatus characterized in that the closed caption data processor further determines the identity of a head code or a tail code of printable character data from predetermined bit positions of the received printable character data, the printable character data representing one of a syllabic character and a Roman alphabet character and comprising a first plurality of bytes, the first plurality of bytes of printable character data being translated into a lesser number of letter component pointer bytes and the display random access memory stores letter component pointer data for uniquely pointing to a syllabic character letter component in the character memory.
Claim 19
Dependent Claim 202 words
Apparatus for decoding data encoded in caption layer data of a television data stream, the apparatus comprising: a data extractor for extracting the encoded data from the caption layer data and outputting the extracted data, a closed caption data controller, responsive to the data extractor, for stripping parity from the extracted data, for determining whether the data comprises a printable character, and for outputting pointer data, a display random access memory having a plurality of pointer registers responsive to the closed caption data controller, and a character memory, responsive to the display random access memory, for outputting selected character data, the apparatus characterized in that the closed caption data processor further determines the identity of a head code or a tail code of printable character data from predetermined bit positions of the received printable character data, the printable character data representing one of a syllabic character and a Roman alphabet character and comprising a first plurality of bytes, the first plurality of bytes of printable character data being translated into a lesser number of letter component pointer bytes and the display random access memory stores letter component pointer data for uniquely pointing to a syllabic character letter component in the character memory.
Claim 20
Dependent Claim 50 words
The apparatus according to claim 15 further characterized by a closed caption overlay circuit for overlaying a plurality of letter components output from the character memory to replace input video picture data, the remaining video picture data and the overlaid letter components being output for display on an associated screen.
Claim 21
Dependent Claim 29 words
The apparatus according to claim 16 further characterized in that a plurality of overlaid letter components output from the closed caption overlay circuit comprise a syllabic character for display.
Claim 22
Dependent Claim 26 words
The apparatus according to claim 15 further characterized in that the character memory comprises memory for storing display data for approximately three hundred twenty-seven letter components.
Claim 23
Dependent Claim 39 words
The apparatus according to claim 17 further characterized in that the overlaid letter components comprise a letter block having a size of 10×16, each letter component being identified by predetermined starting coordinates and predetermined dimensions within the letter block.
Claim 24
Dependent Claim 23 words
The apparatus according to claim 15 wherein the first plurality of printable character data bytes comprise a head code and three tail codes.
Claim 25
Dependent Claim 12 words
A method as in claim 2, wherein the second language is Korean.
Claim 26
Dependent Claim 12 words
A method as in claim 3, wherein the second language is Korean.
Claim 27
Dependent Claim 179 words
In decoder apparatus for decoding data encoded in caption layer data of a television data stream, a method for decoding the encoded data characterized by steps of: receiving the encoded data as service blocks, each service block comprising a header and at least two data bytes, retrieving data packets from the service blocks, decoding the data packets, each data packet comprising a plurality of data bytes, the data packets indicated by particular bit indications appearing in one of the plurality of bytes of each data packet, storing a plurality of letter components in memory for a first language having a syllabic alphabet, mapping remaining bit positions of each data packet into a number of letter component pointer bytes less than or equal to the number of bytes comprising each data packet, the letter component pointer bytes for pointing to two or more letter components in memory for display, retrieving the two or more letter components corresponding to the letter component pointer bytes from the memory, and creating a letter block by overlaying the two or more retrieved letter components.
Claim 28
Dependent Claim 179 words
In decoder apparatus for decoding data encoded in caption layer data of a television data stream, a method for decoding the encoded data characterized by steps of: receiving the encoded data as service blocks, each service block comprising a header and at least two data bytes, retrieving data packets from the service blocks, decoding the data packets, each data packet comprising a plurality of data bytes, the data packets indicated by particular bit indications appearing in one of the plurality of bytes of each data packet, storing a plurality of letter components in memory for a first language having a syllabic alphabet, mapping remaining bit positions of each data packet into a number of letter component pointer bytes less than or equal to the number of bytes comprising each data packet, the letter component pointer bytes for pointing to two or more letter components in memory for display, retrieving the two or more letter components corresponding to the letter component pointer bytes from the memory, and creating a letter block by overlaying the two or more retrieved letter components.
Claim 29
Dependent Claim 38 words
A method as in claim 23, further comprising the step of determining, prior to the step of mapping remaining bit positions of each data packet into letter component pointer bytes, whether the data packet represents a non-printable character.
Claim 30
Dependent Claim 87 words
A method as in claim 23, wherein the step of storing a plurality of letter components further includes storing letter components for a second language having a Roman alphabet in the memory, and further including the step of: determining whether the letter component pointer bytes point to a Roman or a syllabic alphabet, and, if the letter component pointer bytes point to a Roman alphabet, creating a letter block for each of the two or more letter components instead of overlaying the two or more letter components.
Claim 31
Dependent Claim 12 words
A method as in claim 23, wherein the first language is Korean.
Claim 32
Dependent Claim 31 words
A method as in claim 23, wherein the number of different letter blocks created by the overlaying of the two or more retrieved letter components exceeds the number of letter components.
Claim 33
Dependent Claim 29 words
A method as in claim 23, wherein the number of letter components retrieved from memory and the number of letter components overlaid to create the letter block is three.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-05-21 1999-11-20 2000-05-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-05-21 2003-11-20 2004-05-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-05-21 2007-11-20 2008-05-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag