*
`United States Patent
`Emelko
`
`115
`
`US006122010A
`fi1] Patent Number:
`[45] Date of Patent:
`
`6,122,010
`*Sep. 19, 2000
`
`3/1990) Fisher wo..c.cscsssssssessesesccssesnessseee 375/19
`4,910,750
`4/1990 Cook.......
`- 348/552
`4,920,503
`9/1990 Jonnalagadda et al.
`wee 348/21
`4,958,230
`11/1990 O'Grady et al.
`....
`348/473
`4,969,041
`5/1991 Pocock et al.
`..
`vecuce_348/7
`5.014.125
`.. 348/484
`11/1991 Gibson ........
`5,063,446
`
`. 348/432
`5,075,773 12/1991 Pullen etal.
`iccancsscsinceessenerigrinsiancacte 348/13
`SATEDOR
`TTSO3): Martner:
`
`issued on a continued pros-
`This patent
`we 341/56
`5,191,330
`3/1993 Fisheret al.
`
`ecution application filed under 37 CFR
`4/1993 Bronfin etal. ..
`. 348/460
`5,200,822
`
`..
`« 348/473
`5,243,423
`9/1993 DeJean et al.
`
`1.53(d), and is subject to the twenty year
`
`acd 093:Cook(wisn5 . 395/200.
`
`
`patent
`term provisions of 35 U.S.C.
`5,251,301
`10/1993 Cook
`200.76
`§,327,237
`«7/1994 Gerdes et al.
`......
`. 348/476
`
`2/1995 Montgomery et al.
`.
`|, 348/473
`154(a)(2).
`5.387.941
`5,410,360
`4/1995 Montgomery ......
`«+ 348/473
`-« 348/470
`5,452,009
`9/1995 Citta ............
`
`5,629,958
`5/1997 Willming ....
`« 375/295
`5,686,966 11/1997 De La Cierva, Sr.
`. 348/461
`
`wes 348/13
`5,767,896
`6/1998 Nemirofsky....
`5/1999! Bimedko ......-.csccosersencssssenssserensee 341/56
`§:903,231
`FOREIGN PATENT DOCUMENTS
`
`[54] TELEVISION SIGNAL DATA TRANSMISSION
`SYSTEM
`
`‘
`e
`-
`.
`Inventor: Glenn A. Emelko, Willoughby, Ohio
`[75]
`i
`i
`:
`[73] Assignee: Vidicast Ltd., Mentor, Ohio
`
`[*] Notice:
`
`[21] Appl. No.: 08/898,314
`[22]
`Filed:
`Jul. 22, 1997
`
`Related U.S. Application Data
`
`
`
`[SL]
`[52]
`
`
`
`[63] Continuation-in-part of application No. 08/767,371, Dec.
`6/1992
`........ HO4L 25/49
`European Pat. Off.
`0 490 504 A2
`16, 1996.
`
`8/1996
`European Pat. OM.
`........ HO4N 7/03
`WO96/26607
`_
`
`2/1975
`Netherlands......
`. HO4L 25/48
`7310645
`AMECY esccccuscccicaicsssscccascenmanaraninnwas HO4AN 7/08
`4/1994
`Sweden ..ssesccssusssseereeeee HO4L 7/027
`WO .94/09578
`ceccccccsssssssssnesseee 348/461; 348/465; 348/473;
`U.S. Ch.
`1906 WIPO
`PCT/IT96/
`375/295; 341/56
`HOAN 703
`
`
`
`[58] NAIR,WARictnerteercesntemsttsField of Search ccc 348/461, 463, MOEA ne
`348/465, 467, 473, 723, 17, 21; 375/295,
`OTHER PUBLICATIONS
`340, 341; 341/56, 57; HO4N
`7/08
`.
`‘
`:
`a Harlow W. Neu, Some Techniques of Pulse Code Modula-
`tion, Bulletin Schweizerischen Elektrotechnischen Vereins,
`vol. 51, No. 20, Oct. 8, 1960, pp. 978-985.
`Primary Examiner—John K. Peng
`Assistant Examiner—Jean W. Désir
`Aftorney, Agent, or Firm—Arter & Hadden LLP
`
`5
`[56]
`
`iN
`sRapannee
`Romero<a)
`U.S. PATENT DOCUMENTS
`3,634,855
`1/1972 Miller .eessscsscsssssesssessserrsseeenessees 340/347
`
`3,743,767
`7/1973 Bitzeretal.
`-- 348/463
`3,927,250 12/1975 Rainger .....
`« 348/467
`
`3,984,624 10/1976 Waggener .....
`348/473
`wa 348/6
`4,183,054
`1/1980 Patisaul et al.
`
`1/1983 Leventer et al.
`348/467
`4,367,488
`11/1984 Schlafly ........
`370/294
`4,484,328
`
`we 3548/7
`4,538,174
`8/1985 Gargini et al.
`370/490
`4,556,973 12/1985 Uemura «0.
`12/1986 Gurumurthy ..
`4,626,913
`
`5/1987 Cooper ......
`4,665,431
`
`6/1988 Martinez ...
`4,750,036
`ie
`348/464
`12/1988 Mustafa et al.
`......
`4,789,895
`
`1/1989 Johanndeiteret al.
`wa 348/468
`4,800,428
`
`2/1989 Greenberg ..cccsccscsscssssssssssnsen 348/460
`4,805,020
`2/1989 Broughton et al. wu. 348/460
`4,807,031
`
`[57]
`
`ABSTRACT
`,
`.
`.
`Asystem for high-speed data transmission using a television
`signal to communicate encodeddata. A multi-level encoding
`method is employed whereby raw data values are converted
`into one of a plurality of voltage levels. The encoding
`method allows for improved data transferrates, conservation
`of bandwidth, and self-synchronization for decoding. Mock
`timing data signals are generated to comply with television
`signal standards, such as NTSC, SECAM, PAL and HDT'V.
`
`53 Claims, 20 Drawing Sheets
`
`
`10. 11)
`
`EVERY STATE HAS 4
`POSSIBLE STATES TO
`TRANSITION TO.
`ENCODING THE
`VALUES O. 1. 2. AND
`3100. Ol.
`
`Roku EX1023
`US. Patent No. 9,911,325
`
`Roku EX1023
`U.S. Patent No. 9,911,325
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 1 of 20
`
`6,122,010
`
`ok
`
`ENCODE |
`
`ENCODE 0
`
`ENCODE 0
`
`ac
`ENCODE 0
`
`
`
`26
`
`ENCODE 1
`
`Fig.
`
`]
`
`24
`
`ENCODE 0
`
`ENCODE |
`
`ENCODE 2
`
`ENCODE 0
`
`STP
`LEVEL B
`
`30
`
`D>
`
`ENCODE 0
`
`ENCODE 1
`
`ENCODE 2
`
`ENCODE 1
`
`ENCODE 0
`
`ENCODE 2
`
`Fig. 2
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 2 of 20
`
`6,122,010
`
`LEVEL B EVERY STATE HAS 4
`3 (00. O1. 10. 11)
`
`
`POSSIBLE STATES 10
`TRANSITION TO.
`ENCODING THE
`VALUES 0, 1. 2. AND
`
`
`
`OUTPUT
`
`
`
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 3 of 20
`
`6,122,010
`
`pby
`
`WiL|e]2€2Ciete
`{preHE]
`
`
`
`Q2};0}/9/98/9}910}3/9]}0}]98]9/9!]¥)}9);9;0}]3)0]9]V
`Ol|OlIl0111}tf}Ol
`
`0S
`
`ao
`
`9TAA
`LNdLNO
`
`oOo
`
`<<
`
`INdNI
`
`INVA
`
`:UlVd118
`
`_AR]
`
`LNd1LNO
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 4 of 20
`
`6,122,010
`
`60
`
`
`
`
`
`FIRST = TRUE
`
`READ INPUT
`VALUE
`
`IS
`INPUT < LAST
`
`ies
`
`IF INPUT VALUE =0
`IF INPUT VALUE =0
`THENE
`THEN
`OUTPUT LEVEL =8
`OUTPUT LEVEL=A
`AND LAST =0 AND LAST=1
`
`
`
`
`
`IF INPUT VALUE =1
`IF INPUT VALUE = 1
`THEN
`
`THEN
`OUTPUT LEVEL=B
`OUTPUT LEVEL =C
`AND LAST = 1
`AND LAST=2
`
`
`IF INPUT VALUE =2
`IF INPUT VALUE =2
`THEN
`THEN
`OUTPUT LEVEL =C
`QUTPUT LEVEL = U0
`AND LAST =2
`AND LAST =3
`
`
`
`
`
`
`
`IF INPUT VALUE =3
`THEN
`OUTPUT LEVEL = 0
`AND LAST =
`
`
`
`IF INPUT VALUE =3
`THEN
`OUTPUT LEVEL=E
`AND LAST =4
`
`FIRST = FALSE
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 5 of 20
`
`6,122,010
`
`FIRST = TRUE
`
`READ OUTPUT
`VALUE
`
`
`
`IF OUTPUT LEVEL=A
`THEN
`
`INPUT VALUE = 0
`
`IF OUTPUT LEVEL=B
`
`THEN
`
`INPUT VALUE = |
`
`IF OUTPUT LEVEL=C
`THEN
`INPUT VALUE = 2
`
`
`
`102
`
`104
`
`106
`
`16
`
`ie
`
`lle
`
`¢'!4
`
`
`
`
`
`
`
`
`
`
`IF OUTPUT LEVEL =0
`THEN
`
`STORE INPUT VALUE=3
`INPUT
`
`VALUE
` T Lever=e]
`
`
`IF OUTPU
`THEN
`INPUT VALUE = 4
`
`FIRST= FALSE
`
`LAST = INPUT VALUE
`
`116e
`
`NO
`
`IF INPUT VALUE >LAST
`THEN
`INPUT VALUE = INPUT VALUE —1
`
`118
`
`Fig. 6
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 6 of 20
`
`6,122,010
`
`3WIL
`
`g2
`
`eo
`
`JaAI1
`
`INdLNO
`
`oOo
`
`=<
`
`LAdNI
`
`INVA
`
`Zby
`
`03Vv08}V
`
`INdLNO
`
`T3A31
`
`I]01
`
`ulVd118
`
`‘Gn
`
`

`

`
`
`EaJ1901y344naaig”o300N3
`SOTWNYoWwi1910|,WLVG
`9SISI2S]~
`9€|rel26
`9NI00930aateae
`
`6,122,010
`
`6‘bry
`
`Sep. 19, 2000
`
`Sheet 7 of 20
`
`0S]
`
`U.S. Patent
`
`
`03003N3bettsya4ngS01VNY03003N3NN
`v1¥OYB1NIANODvLVO
`
`
`
`
`
`
`‘00
`
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 8 of 20
`
`6,122,010
`
`
`
`ACTIVE
`VIDEO
`
`PERIOD
`
`Se. 44 us
`
`
`HORIZONTAL
`BLANKING
`INTERVAL
`Il. les
`
`HORIZONTAL
`SYNC
`
`
`
`
`
`
`
`
`
`HORIZONTAL
`RE TRACE
`TRIGGERED
`BY SYNC
`(Illus MIN)
`
`
`
`
`
`
`
`
`ACTIVE
`
`EQUAL IZING
`PULSES
`is ae)
`
`VERTICAL
`RETRACE
`TRIGGERED
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 9 of 20
`
`6,122,010
`
`0300930
`
`03009N3
`
`V1v0
`
`(WLISIG)
`
`YOLVTIL9SOa/v
`
`SNOTLVOINAWNOD
`
`YILYSANOI
`
`WTO4W
`
`03003N3
`
`VL¥0
`
`(WLISTG)
`
`¥/0
`
`YSLYSANOD
`
`c0&
`
`vOE
`
`061
`
`
`
`4300930/YSA13938
`
`Y300IN5/Y31L1IWSNVYL
`
`¥0e
`
`YOLVTITISO
`
`20¢
`
`TOYLNOD
`
`Ole
`
`21‘bis
`
`SNLVISVLvd
`
`SNLVIS7vivo
`
`SNdIdZs
`
`
`
`
`SN8Id
`
`Ss
`
`Ole
`
`
`
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 10 of 20
`
`6,122,010
`
`AV1dS10
`
`T3A31
`
`JLIHAO08
`
`SLIHM09
`
`SLTHM
`
`SLIHMOF
`
`SLIHMOe
`
`MOV19
`
`YaNIV18
`
`
`
`AOV18NVHL
`
`WILLYGA=OVE7t*——_—_=w9v181/—26
`
` LIMA00I—ITHIWILSIHONTUNOi"70RODWail3e172
`
`NVH]0b-——0
`Jul Yi¥0
`
`
`
`THAT|(Od01dOedOEdOPdOSdO9d0LdO))yiyqGagooNaIMd1LNo
`
`aeJ3SS061-S3SNdINASWILLYIA-11
`II]IIIII]
`
`O3009N3W119I0WV11910aSW3003N3Y3009N3
`
`
`
`
`(00000000)0(000)0‘HOAS.“LNGA/"Z¥OH23LV1S
`
`
`(00000010)79~ (o10)2=|YNV78“1N3A/‘ZY0H|2JLVIS
`(00000111)veeCUIDL372431LVIS
`(00000011)261(01199013431931VLS
`(00000101)091(101)S913037S31VLS
`
`(00000110)96(1IOVEYOYWAR|€FIVLS(00000001)921(001)%g73437yUVIS
`
`
`
`JISTp’SISWNdINASWIILYIANISNOTLYYYSS
`-3SNd
`goby,
`
`
`
`(SdO9d0/40)NOILYWYOINIALVIS
`
`
`33S7S-S¥SNdINASIWINOZIYOH-ITI
`
`J3S1S°2-S3SNdONIZITWNDI-1
`
`yano¥1a
`
`HIYOdHOuOd
`
`99INOU
`
`Velbl
`
`NOILYZIIVNOSONV
`
`|J1aVvi
`
`

`

`200
`
`1400
`
`1200
`
`1000
`
`800
`
`600
`
`400
`
`
`
`TIME(us) Fig.14B
`
`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 11 of 20
`
`6,122,010
`
`SECOND SCAN
`
`FIRSTSCAN
`
`‘a —_l
`w=
`==
`af—t
`eM”
`=.
`Ln—
`-=zv1) we
`=)i
`
`290
`
`200
`
`5
`
`0
`
`ENCODED DIGITAL DATA VALUES
`
`5
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 12 of 20
`
`6,122,010
`
`
`
`13201340
`
`1300
`
`
`
`
`
`14CTIME(us) Fig.
`
`WwW
`o
`oc*
`
`—“
`
`ui
`
`o L
`
`1280 So
`
`La
`=eS
`
`= ==
`
`<
`Qo
`“4
`
`i
`
`a
`cu
`
`S&S
`oO
`ou
`
`oS
`Ww
`
`So
`Oo
`
`ao
`wn
`
`ENCODED DIGITAL DATA VALUES
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 13 of 20
`
`6,122,010
`
` 1290
`
`1295
`
`1285
`
`
`1280TIME
`
`(us) Fig.14D
`
`1275
`
`1270
`
` 1265
`200
`
`0
`
`5
`
`ENCODED DIGITAL DATA VALUES
`
`(11)
`we
`
`11)(11)
`
`—
`
`SSS="2+§-——
`
`SeTs
`CtBB
`tL
`0 l
`(11) E i10)
`(11) E la
`(11) E F
`Oy| B8
`(11)(1) E
`
`11)(
`
`(11) E
`
`I) E
`
`250
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 14 of 20
`
`6,122,010
`
`Fig.
`
`ISA
`
`e3e
`
`START, GENERATE. NTSC
`
`SYNC/BLANK ING
`WAVEFORM CONTINUOUSLY
`
`f°
`
`COLLECT DATA TO BE
`SENT TO FIFO
`
`SET QUTPUT
`TO ZERO
`
`SET QUTBUT
`TO TWO
`
`
`
`ARE WE IN
`
`
`BLANKING OR APPROACHING
`BLANKING ?
`
`
`
`
`
`
`REPEAT ONCE FOR
`
`
`EACH PAIR OF BITS IN
`
`DONE ENCODING
`
`
`
`8 BIT DATA BYTE.
`IS THERE
`THIS BYTE
`A BIT is TO ENCODE
`
`
`
`MATCH TO FIG.15B
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 15 of 20
`
`6,122,010
`
`Dp9e
`
`9¢
`
`XIS
`
`09S¢
`
`9Se
`
`OAL“O43Z
`
`N3A3SU0
`
`Se
`
`SYALVHA
`
`
`
`V1¥0IS¥1
`
`&INdino
`
`ssaoeceeSSSssssasVGO14OLHOLVN
`
`qdr9e
`
`q29e
`
`48Se
`
`q9Se
`
`13S‘040SNAYSVHUI¥d118SIHLJI
`SVHYI¥d118STHJ]
`13S‘040SNIVAVY
`13S“040NWAYSVHUIV¥d118SIH!J]
`13S“0403MVA¥SVHYV¥d118SIHL4]
`13S“040SNAVSVHYI¥d118SIHLdl
`
`“JHNHLOLANdLAO
`
`"J3NHLOL1NdLNO
`
`“JSUHL01INdiNo
`
`‘YN04OLINdiNd
`
`“J3YH1OL1dLAO
`
`SVHUI¥d118STH!J]
`13S‘140SWAY
`13S“140SN1VA¥S¥HMIVd118STHL3]
`SVHYl¥d118SIHJI
`13S‘I40SWAY
`13S‘140SNAYSVHUI¥d119SIHLJI
`13S“1403NWA¥SVHUl¥d118SIHLJI
`
`UNOSOLINdLNO
`
`‘UNO01LAd1Nd
`
`“JALAOLINdLNO
`
`“SAISOLINd1NO
`
`‘UNOSO1LAGLNO
`
`9¥9e
`
`9292
`
`28S¢
`
`996¢
`
`Pp9e
`
`Pe9e
`
`Pgse
`
`P9Se
`
`13S‘240NWAVSVHYI¥d118SIHI4]
`SVHY1l¥d119SIHIJI
`13S“240SNAY¥
`13S‘240JNAYSVHUI¥d118SIHJl
`L3S‘e40SNAYSVHYIVd118SIHLJI
`13S‘240INVAVSVHUIVd118SIHJI
`
`"IALOLLAdLNO
`
`XISO1INdLNo
`
`XISOLINd1NO
`
`XIS01LNd1Nno
`
`“AISOLLAGLNO
`
`NBAIS01INdLNd
`
`NGAASO1INd1NO
`
`13S‘€40SNAYSVHYl¥d118SIH!JI
`L3S‘€40SNWAYSVHUI¥d116SIHLJ]
`13S“€40INVAYSVHUl¥d118SIHJl
`13S“€40ANAVSVHMIV¥d118SIHL4]
`SVHYIVd118SIHI41
`L3S“€30INWAY
`
`qc“bry
`
`NIAISOLLAdLNO
`
`N3AISOLLNGLNO
`
`XISO1LAGLAO
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 16 of 20
`
`6,122,010
`
`332
`
`334
`
`Fig. 16A
`
`OF ENCODED SIGNAL
`
`BREAK INPUT SIGNAL INTO
`RANGES, WITH CODES FOR
`LEVEL A THRU LEVEL E
`
`336
`
`ABOVE
`LEVEL A
`?
`
`YES
`
`340
`
`START OUR TIMING
`CHAIN FOR DECODING
`
`342
`
`SET LAST LEVEL
`TO A
`
`WAIT FOR A
`LITTLE BIT
`
`338
`
`300AX
`DETECT PRESENCE
`
`
`
`
`
`
`
`
`
`
`REPEAT THE
`FOLLOWING
`
`344
`
`346
`
`WAIT UNTIL THE LAST THREE
`HISTORICAL SAMPLES MATCH
`THE PRESENT SAMPLE
`
`348
`
` ARE WE
`AT A OIFFERENT
`LEVEL ?
`
`MATCH TO FIG.16B
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 17 of 20
`
`6,122,010
`
`MATCH TO FIG.1I6A
`
`
`
`
`
`
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`
`
`
`
`IS A. DECODE A
`IS A. DECODE A
`IS A. DECODE A
`IS A. DECODE A
`IS B. DECODE A
`
`
`
`
`BIT-PAIR OF 00
`BIT PAIR OF 00
`BIT PAIR OF 00
`BIT PAIR OF 00
`BIT PAIR OF 00
`
`
`
`
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`
`
`
`
`
`
`
`
`
`
`IF THIS LEVEL IF THIS LEVEL||IF THIS LEVEL IF THIS LEVEL
`
` IF THIS LEVEL
`
`
`JIS B, DECODE A
`IS B. DECODE A
`IS C, DECODE A
`IS B, DECODE A}
`IS C. DECODE A
`
`
`
`BIT PAIR OF 01
`BIT PAIR OF Ol}
`BIT PAIR OF Ol
`|BIT PAIR OF 01
`BIT PAIR OF O1
`
`
`
`
`
`AND STORE IT. AND STORE IT.}|AND STORE IT. AND STORE IT.
`
`AND STORE IT.
`
`
`
`
`
`
`
`
`
`
`
`
`IF THIS LEVEL IF THIS LEVEL||IF THIS LEVEL IF THIS LEVEL
`IF THIS LEVEL
`
`
`IS 0, DECODE A
`IS D. DECODE Ay
`JIS C, DECODE A
`IS C, DECODE A
`IS D0. DECODE A
`
`
`
`BIT PAIR OF 10
`BIT PAIR OF 10}
`|BIT PAIR OF 10
`BIT PAIR OF 10
`BIT PAIR OF 10
`
`
`
`
`
`AND STORE IT. AND STORE IT.{||AND STORE IT. AND STORE IT.
`
`AND STORE IT.
`
`
`
`
`368
`
`SELECT THE NEXT BIT
`
`PN ouTPUT
`
`
`
`
`
`
`
`
`
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`
`
`
`
`IS 0, DECODE A
`IS E, OECODE A
`IS E. DECODE A
`IS B. DECODE E
`IS E, DECODE A
`
`
`
`
`
`
`
`
`BIT PAIR OF II
`BIT PAIR OF
`11
`BIT PAIR OF 1]
`BIT PAIR OF 11
`BIT PAIR OF
`II
`
`
`
`
`
`
`
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`
`
`
`
`
`
`
`
`(GOT FOR PAIRS)
`
`
`STORE THE BYTE IN THE
`FIFO, RESET TO FIRST PAIR
`
`OF NEXT DECODED BYTE
`
`
`HAVE WE
`COMPLETED A BYTE
`
`Fig. 16B
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 18 of 20
`
`6,122,010
`
`TABLE 2:
`
`ORIGINAL
`DIGITAL
`ENCODED
`DATA
`
`ENCODED
`INPUT
`INFORMATION
`
`ENCODER
`STATE
`
`DIF ITAL
`ENCODED
`INPUT
`DATA RANGE
`
`INPUT
`PATTERN
`(IN Ce..0])
`
`<116
`
`LEVEL E
`
`LEVEL D
`
`LEVEL C
`
`LEVEL B
`
`STATE 7
`
`>218 AND <255
`
`STATE 6
`
`2184 AND <218
`
`STATE 5
`
`>150 AND <184
`
`STATE 4
`
`>116 AND <150
`
`LEVEL A/IDLE
`
`STATE 3
`
`BLANK ING
`
`STATE 2
`
`SYNCH/WQ.
`
`STATE 2
`
`Fig. I?
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 19 of 20
`
`6,122,010
`
`inde
`
`
`
`CDCO0DODOOCCOOOOOOOOCMGOeGeOoOMOCOeCOCOMeCeCeCcCccC0oO-o-o-C“Oo-
`
`TABLE 3:
`
`indl
`
`COMDOCCCOOCOOCOCOKOK-O-OKOneeaeeeeeSeeOreO-o-o-oOo
`
`indd
`
`resl
`
`DOOCODOOOOOOOOOOOOOOOOKHKeeeeRhReRPReeeeee
`
`resO ine
`
`
`
`——qoooocncooococococcceeceecS—sVr34Tarr"
`
`ODOoCoCCOC0OO-KH-OOTCWOCVCVOORK-HK-OCCcCoCCCCORF--oooeoeo°o°ooeo--
`
`«*resQ strobe
`1 £NOJ
`
`inl
`
`oo0oq0oc@gwe—-Oooeoeo°o-
`
`——--—-oO0000082-—-—--—-000000H433"0779°00
`
`ind
`
`oo--—-oO00--O0000--0
`Oe-K-CDO0O-K-TDORK-K-OCOCO--oO0O—--oCoO
`
`*res|
`
`
`oqoooo0o0or-—-—-ocoooc°coe
`
`Om-enHe-OCO0D0O——--HKoooo--—-—-—-—
`
`
`Qooo0ocero0-—00=-—-—"
`
`—-O0O—-—-0C0-—-—-C0C00O—-—-0C0ORHOOK
`
`oo-ooo0oocoeo°o-o°o
`cocoocooooCoOoO-c0a-c0c00cCcCCCoCo-CO
`
`[NO]
`
`(NO)
`
`oo=hal
`
`[NO]
`
`[NO]
`
`[NO]
`
`1 £NO)
`
`Fig. 18
`
`

`

`U.S. Patent
`
`Sep. 19, 2000
`
`Sheet 20 of 20
`
`_]
`
`S3SNd
`
`Oj14OL
`
`6,122,010
`
`00‘Oe00‘SI00‘OI
`
`
`
`(Ss)3WIL
`
`VL¥OSOTVNY
`SLIMLasY3LSI938NIaO3Y01S3A
`
`
`00yyy(00)(001
`
`WYOJSAVA
`
`Oet
`
`982
`
`gs2._SS2
`
`vgz1fSl!q091fOSIA261fv8l0peefBle
`
`DIGITAL ENCODED INPUT DATA
`AND OTHER DECODED DATA
`
`

`

`6,122,010
`
`1
`TELEVISION SIGNAL DATA TRANSMISSION
`SYSTEM
`
`RELATED APPLICATIONS
`
`The present application is a continuation-in-part (CIP) of
`co-pending U.S. application Ser. No.08/767,371 filed Dec.
`16, 1996.
`
`FIELD OF THE INVENTION
`
`The present invention relates to the field of high-speed
`data transmission, and more particularly,
`to a system for
`providing high-speed data transmission using a television
`signal.
`
`BACKGROUNDOF THE INVENTION
`
`There has been a failure in the field of data transmission
`
`systems to recognize the potential of a television signal, and
`in particular, the large bandwidth available using a television
`signal. At present, methods of encoding data into a television
`signal have been restricted to relatively low bandwidth and
`inefficient use of the television signal medium. The reason
`for this appears to be that the data encoding methods in use
`were designed more than twenty-five years ago, and the
`bandwidth requiredfor the original purpose is relatively low.
`For instance,
`these methods were designed to allow a
`television signal to carry closed-captioning and/or teletext
`information. The data rate needed for carrying this informa-
`tion is extremely low, and though the bit rate of the data
`transmission was fairly high (e.g., 4.5 million bits per
`second in bursts), the overall bandwidth utilization of the
`television signal generally does not exceed 45,000 bits per
`second, Moreover,
`the data encoding methods used for
`captioning andteletext are fairly rudimentary. In this regard,
`these methods divide a signal line of a television picture up
`into a number of time slices, and then impress digital
`information into the slots as a series of black or white spots,
`representing the digital values of zero and one. The data
`bytes are encoded into changing voltages (i.e., black and
`white spots), and decoded back into bytes by using a
`commonly available electronic device, such as UART
`(Universal Asynchronous Receiver Transmitter) or an ACIA
`(Asynchronous Communications Interface Adapter). One
`limitation of this “binary coding” scheme is that it limits the
`data transmission rate. In order to achieve greater transmis-
`sion rates, data has been encoded into complex waveforms,
`such as tones, which are then phase, frequency, and ampli-
`tude modulated in order
`to carry the information. For
`instance,
`this method is used in data modems for use in
`longer distance high-speed communications. Other forms of
`encoding for high-speed data transmission include RF
`(Radio Frequency) modulation, networks such as Ethernet
`or Arenet, QAM (Quadrature Amplitude Modulation), ASK
`(Amplitude Shift Keying), PSK (Phase Shift Keying), PSK
`(Frequency Shift Keying), TCM (Trellis Coded Modulation)
`and QPSK (Quadrature Phase Shift Keying). All of the
`foregoing methods encode data on to waveforms for
`transmission, whichis the next step beyond raw digital data.
`In order to derive further benefits from the use of the
`television signal as a transmission medium,
`it would be
`advantageous to encode multiple data bits in parallel as
`discreet levels into the television image.
`The “information highway”of the future relies on high-
`speed data transmission to distribute image, sound and video
`to multiple access points worldwide. Currently, the distri-
`bution bottleneck is the data rate (defined in bits per second)
`
`10
`
`15
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`2
`capabilities of the communications medium in use. For
`example, one minute of compressed digital video data may
`be represented by approximately ten megabytes of data.
`Currently available communications mediumsinclude voice
`grade modems, leased line modems, ISDNservices, fiber-
`optic or high-speed land-line links,
`radio modems and
`satellite data links.
`
`Prior art approaches to achieving higher data transmission
`rates have typically involved trying to compress the data or
`to pack more bits per basic transmission unit (baud) within
`the same channel bandwidth. For example, a 9.6 Kbps
`modem for use on standard two-wire telephone lines oper-
`ates within the 3 Khz bandwidth available. To reach 9.6
`Kbps,it may use a basic baudrate of 2400 baud, and encode
`4 bits per baud. The “baud” defines a numberoftransitions
`made on the base carrier each second, and the numberofbits
`per baud multiplied by the baud rate provides a number of
`bits per second (bps).
`Another aspect of the present invention is directed to the
`encoding ofdigital data. Prior art data encoding methods for
`encoding digital information have used two voltage levels,
`where each voltage level represents a single bit.
`In this
`respect, a first voltage level represents a digital value “0,”
`while a second voltage level represents a digital value “1.”
`As a result, a set of eight of these voltage levels is needed
`to encode one byte of digital data. Data bytes are encoded
`into changing voltages and decoded back into bytes. Thisis
`typically done by using a UART or an ACIA. UARTs
`convert parallel data (usually eight-bit words) to a serial data
`stream for transmission over a single wire cable and likewise
`convert a received serial bit stream to parallel words. The
`serial data stream is comprised of a signal having two
`voltage levels, one representing a digital “0,” the other
`representing a digital “1.”
`In many cases, the data rate achievable by UARTs and
`ACIAs is insufficient for the desired application. In order to
`achieve greater data rates for high-speed communications,
`data has been encoded into complex waveforms such as
`tones, which are then phase, frequency and amplitude modu-
`lated. As mentioned above, data has been encoded using RF,
`QAM, ASK, PSK, FSK, TCM and QPSK. All of the
`foregoing methods encode data into AC waveforms for
`transmission.
`
`The present invention provides a novel system for trans-
`mitting and receiving digital data using a conventional
`television signal for data transfer. In a preferred embodiment
`of the present invention an encoding system is used which
`overcomesthe data transfer rate limitations ofthe prior art
`encoding systems, and provides a system for encoding
`multiple data bits in parallel as transitions between discrete
`levels.
`
`SUMMARY OF THE INVENTION
`
`In accordance with a preferred embodiment ofthe present
`invention, there is provided a television signal data trans-
`mission system having a transmitter for encoding digital
`data and a mocktelevision signal, and a receiver for decod-
`ing the encoded digital data and the mock television signal.
`It is an object of the present invention to provide a data
`transmission system which uses a conventional
`television
`signal
`to transmit encoded digital data at very high data
`transmission rates.
`
`It is another object of the present invention to provide a
`data transmission system which encodes mock television
`signals to comply with government standards for regular
`broadcast television signals.
`
`

`

`6,122,010
`
`3
`It is another object of the present invention to provide a
`data transmission system which uses a multi-level encoding
`system to further increase the data transmission rate.
`It is another object of the present invention to provide a
`data transmission system which uses a television signal as a
`high-speed data transmission medium.
`It is still another object of the present invention to provide
`a data transmission system which uses the active video
`portion of the television signal to transmit data.
`It is still another object ofthe present invention to provide
`a data transmission system which significantly reduces the
`data transmission time and cost.
`
`It is yet another object of the present invention to provide
`a dala transmission system which uses standard, readily
`available television transmission and receiving devices.
`It is yet another object of the present invention to provide
`a data transmission system which provides greater band-
`width at lower cost.
`
`15
`
`These and other objects will become apparent from the
`following description of a preferred embodiment
`taken
`together with the accompanying drawings and appended
`claims.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`The above-mentioned and other features and objects of
`the invention and the mannerof attaining them will become
`more apparent and the invention will be best understood by
`reference to the following description of an embodiment of
`the invention taken in conjunction with the accompanying
`drawings and appended claims, wherein:
`FIG, Lis a state diagram for encoding two different input
`values into three output
`levels, according to a preferred
`embodiment of the present invention;
`FIG, 2 is a state diagram for encoding three different input
`values into four output
`levels, according to a preferred
`embodiment of the present invention;
`FIG. 3 is a state diagram for encoding four different input
`values into five output
`levels, according to a preferred
`embodiment of the present invention;
`FIG. 4 is a timing diagram illustrating the encoding of
`four different input values according to the state diagram
`shown in FIG. 3;
`FIG, 5 is a flow chart illustrating a preferred embodiment
`ofthe algorithm for encoding the input values according, to
`the state diagram shown in FIG. 3;
`FIG. 6 is a flow chart illustrating a preferred embodiment
`ofthe algorithm for decoding output levels into input values;
`FIG. 7 is a timing diagramillustrating the encoding of
`four different input values;
`FIG. 8 is a block diagram of the hardware arrangement for
`implementing the encoding algorithm of the present inven-
`tion;
`FIG. 9 is a block diagram of the hardware arrangementfor
`implementing the decoding algorithm of the present inven-
`tion;
`
`timing pictorial for an NTSC
`FIG, 10 is a horizontal
`compatible television signal;
`FIG, 11 is a vertical timing pictorial for an NTSC com-
`patible television signal;
`FIG, 12 is a block diagram of the television signal data
`transmission system, according to a preferred embodiment
`of the present invention;
`FIG. 13 is an NTSC television signal waveform for a
`black and white television transmission;
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`4
`FIG. 14Ais a table showingthe states of the encoderstate
`machine and corresponding outputs of the encoder;
`FIG. 14B is a timing diagram showingthedigital encoded
`data for the first four phases of an NTSC signal and thefirst
`two scan lines of the active video phase;
`FIG. 14C is a timing diagram showingthe digital encoded
`data for the first scan line shown in FIG. 14B;
`FIG. 14D is a timing diagram showingthe digital encoded
`data for a portion ofthe first scan line shown in FIG. 14C;
`FIGS. 15A and 15B provide a diagram illustrating the
`control unit logic for encoding data;
`FIGS. 16A and 16B provide a diagram illustrating the
`control unit logic for decoding data;
`FIG, 17 is a table showing the outputs of the decoder state
`machine and corresponding inputs;
`FIG, 18 is a table showing the outputs for various signal
`generated by the control unit logic for decoding data; and
`FIG, 19 is a timing diagram showing the outputs of the
`decoder.
`
`DETAILED DESCRIPTION OF THE
`PREFERRED EMBODIMENT
`
`invention, a
`In a preferred embodiment of the present
`novel system for encoding N input values into at least N+1
`output
`levels is used. This novel encoding system is
`described in detail below. However,it should be appreciated
`that other suitable encoding systems may be used with the
`present
`invention to yield similar results In a preferred
`embodiment of the novel encoding system each output level
`is represented by a different voltage. However, each output
`level may also be represented by a different frequency,
`phase, or amplitude. Referring now to the drawings wherein
`the showings are for the purpose of illustrating a preferred
`embodiment of the invention only, and not for the purpose
`of limiting same, FIG. 1 showsa state diagram 20illustrat-
`ing the transition between states for encoding two different
`input values (i.¢., “0” and “1”) into three output levels(i.e.,
`output levels A, B and C), according to a preferred embodi-
`ment of the present invention. For instance, beginning at
`state 22 (output level A), if the next input value is a “0,” the
`systemtransitions to state 24 (output level B). In contrast, if
`the next input value is a “1,” the system transitions to state
`26 (output level C). The system will transition from onestate
`to one of the other two remaining states as each consecutive
`input value is encoded. Importantly, it should be noted that
`no two consecutive input values will be encoded as the same
`output level.
`FIG, 2 showsa state diagram 30illustrating the transition
`between states for encoding three input values(i.c., “O,” “1”
`and “2”) into four output levels (i.¢e., output levels A, B, C
`and D), according to a preferred embodimentof the present
`invention.
`
`FIG. 3 showsa state diagram 40 illustrating the transition
`is between states for the encoding of four input values(1.e.,
`“o", “17, “2” and “3”,' into five output levels (i.¢., output
`levels A, B, C, D and E), according to a preferred embodi-
`ment ofthe present invention. It should be appreciated that
`since there are four input values, each input value may
`represent a bit pair (1.e., “00,” “O1," “10,” and “11”),
`Therefore, each output level will represent twobits, rather
`than one bit, as in conventional encoding systems.
`Moreover, where N different input values are encoded into
`at least N+1 output levels, each input value can represent
`log,(N) bits. As a result of using a single input value to
`represent a plurality of bits, higher data transfer rates are
`
`

`

`6,122,010
`
`5
`achievable, and bandwidth can be conserved. It should be
`appreciated that while in a preferred embodiment of the
`present invention the input values encode base 2 data(i.c.,
`log,(N) bits) the input values may also encode base X data.
`Therefore, the input values may represent values 0 through
`X-1 in base X with the encoded output having at least X
`different output
`levels.
`It should also be understood that
`there may be more than N+1 output levels and transitions
`thereof for encoding N different input values. This allows for
`simplified implementation of various error detection and
`correction methods.
`A detailed description of the present invention as applied
`to the encoding of four input values into five output levels,
`will now be described with reference to FIGS. 4 and 3. FIG.
`4 provides a timing diagram 50 which showsthe transition
`of the output levels as each input value is encoded. It should
`be appreciatedthat in the embodiment shownin FIG. 4, each
`input value represents a bit pair. For
`the purpose of
`illustration, input value “0” represents bit pair “01,” input
`value “1” represents bit pair “01,” input value “2” represents
`bit pair “10” and input value “3”representsbit pair “11.” As
`can be seen from FIG. 4, each consecutive output level will
`be different. Each output level A thru E is a discrete voltage
`level. For instance, output levels A thru E may correspond to
`voltages in the range of 0 to 5 volts. The input values shown
`in FIG, 4 are encodedinto output levels A thru E according
`to the algorithm shown in flow chart 60 of FIG. 5. Beginning
`with step 62, a FIRSTflag is set toTRUE. This will indicate
`that this is the first input value to be encoded. At step 64, an
`input value will be read in. Next, at step 66, it is determined
`whether the input valueis the first input value to be encoded,
`by determining the status of the FIRSTflag. If the input
`value is the first input value to be encoded,a first set of rules
`(steps 70-76) will be applied. If the input value is not the
`first input value to be encoded, it will be determined whether
`a secondset of rules (steps 80-86) should be applied, as will
`be discussed below. For instance, in FIG. 4, the first input
`value is a “O” (corresponding to bit pair “O"). Accordingly,
`the conditions exist for applying the first set of rules. In
`particular, step 70 will be executed. In this respect,
`the
`output level will be set to A and the LAST variable will be
`set to “0.” The LASTvariable is usedas the reference value
`to determine the appropriate set of rules to be applied
`following thefirst input value, as will be described below in
`connection with step 68,
`It should be understood that only one of the steps 70-76
`will be valid when applying the first set of rules.
`Accordingly, step 90 will follow step 70. Step 90 sets the
`FIRST flag to FALSE for the subsequent input values. The
`algorithm then returns to step 64 to read in the next input
`value. In FIG. 4, the next consecutive input value is a “1.”
`Since the FIRST flag is now set to FALSE, the algorithm
`will proceed from step 66 to step 68. At step 68,
`it
`is
`determined whether the input value is less than the LAST
`variable. This step determines whetherthe first set of rules
`(steps 70-76) should be applied or whether the second set of
`rules (steps 80-86) should be applied.
`In the present
`example, the input value of “1” is greater than the LAST
`variable, which has been previously set to “0” at step 70.
`Therefore, the algorithm will apply the second set of rules
`(steps 80-86). Since the input value is “1,” step 82 will be
`executed. Step 82 sets the output level to C and the LAST
`variable to 2. The algorithm then proceeds to step 90 and
`returns again to step 64 for reading in the next consecutive
`input value. The algorithm will continue in this manner until
`all of the input values have been encoded as output levels.
`With reference to FIG. 4, it should be appreciated that the
`output
`level of the preceding encoded input value will
`
`15
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`6
`determine the output level for the next consecutive encoded
`input value. In particular, the next consecutive inpul value
`will be encoded as one of the four remaining output levels.
`As a result, when two consecutive input values are the same,
`such as the consecutive 3’s following the first three input
`values in FIG, 4, each of the 3’s will be encoded asdifferent
`output levels. In the case of the first “3,” the output level is
`E, whereas the second 3 is encoded as output level D. Since
`no consecutive output level will be the same, the output
`levels will
`transition for each consecutive encoded input
`value.
`Referring now to FIG. 6, there is shown a flow chart 100
`which illustrates an algorithm for decoding output
`levels
`back into input values, according to a preferred embodiment
`of the present invention. Beginning with step 102, the FIRST
`flag is set to TRUE indicatingthat thisis the first output level
`to be decoded. At step 104, the output level is read in. For
`steps 106—114, an input value is determined based upon the
`output level read in. However, in some casesthis input value
`will be modified, as will be explained below in connection
`with step 118. Therefore, the decoded input value will be
`determined based upona set of rules determined by both the
`current output level and one or more prior output levels. If
`the outputlevel is the first output level read in (i.c., FIRST=
`TRUE), then the input value is not modified. In this respect,
`the algorithm will proceed from step 116 to step 120 where
`the LAST variable will be set the input value 5. It should be
`appreciated that the LASTvariable is used to det if an input