||||||||||||l||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
`
`USUflfilZZUlUA
`
`United States Patent
`Emelko
`
`[191
`
`[11] Patent Number:
`
`6,122,010
`
`[451 Date of Patent:
`
`*Sep. 19, 2000
`
`[54] TELEVISION SIGNAL DATA TRANSMISSION
`SYSTEM
`
`[25]
`
`lnventor: Glenn A. Enlelko, Willoughby, Ohio
`
`[23] Assignec: Vidieast Ltd., Mentor, Ohio
`
`[‘j Notice:
`
`issued on a continued pros-
`This patent
`ecution application filed under 32 CFR
`l.53{d), and is subject to the twenty year
`patent
`term provisions of 35 U.S.C.
`154(a)(2),
`
`[21] Appl. No.: 082898314
`
`[22]
`
`Filed:
`
`Jul. 22, 1992
`
`Related U.S. Application Data
`
`[(13]
`
`Continuation—impart of application No. 082261321, Dec.
`If), 1990.
`
`
`Int. C1,? ....................................................... H04N 2208
`[51]
`.......................... 3482461; 3482465; 3482423;
`[52] U.S. Cl.
`3252295; 341256
`Field of Search ..................................... 3482461, 463,
`3482465, 462, 423, 223, I2, 21; 3252295,
`340, 341; 341256, 52; HO4N 2208
`
`[58]
`
`[56]
`
`References Cited
`U.S. PA'I'EN'I' DOCUMENTS
`
`10922 Miller ...................................... 3402342
`3,634,855
`.. 3482463
`221073 Bitzeret a].
`..
`3,243,262
`
`.. 3482402
`3,922,250 1221925 Rainger
`_
`_
`3,984,624 102192!) Wagge net
`.....
`
`4.183.054
`121980 Patisaui el al.
`34826
`4,362,488
`10983 Leventer et at.
`
`4,484,328
`112 1984 Sehlafly
`.
`4,538,124
`821985 Gargini el al.
`
`4,556,923 1221985 Uenulra
`482464
`4,626,913
`1221986 (.iurtlnturth}r ..
`
`3482480
`4,065,43l
`521982 Cooper
`4,250,036
`(121988 Martinez
`34802
`
`4,289,895
`1221988 Muslale cl al.
`3482464
`4,800,428
`10989 Johanndeiler et al.
`3482468
`
`20989 (ireenherg ................ 3482460
`4,815,020
`..................... 3482460
`4,810,031
`220189 Broughton c1 al.
`
`34822
`
`
`
`30990 Fisher
`32509
`4,910,250
`421990 Cook .......
`.. 3482552
`4,920,503
`90990 Jonnalagadda el al.
`348221
`4,958,230
`110990 O’Gmdy et :11.
`3482423
`4,969,041
`521991 1’0ka el al.
`3432?
`..
`5,014,125
`.. 3482484
`11.11991
`(iibson
`5,063,446
`
`.. 3482432
`1221991 Pollen el :11.
`5,025,223
`348213
`121993 Martinez .....
`5,122,604
`
`341256
`30993 Fisher et :11.
`5,191,330
`
`40993 Bronfin et al.
`..
`.. 3482460
`5,200,822
`
`90993 Deleon el :11.
`..
`.. 3482423
`5,243,423
`
`1021993 Cook ...............
`. 395220026
`5,251,301
`.. 3482426
`20994 Gerdcs et al.
`5,322,232
`221995 Montgomery el al.
`.
`.. 3432423
`5,382,941
`
`421995 Montgomery ......
`.. 3482423
`5,410,360
`.. 3482420
`921995 Citla
`5,452,009
`.. 3252295
`50992 Willming
`5,629,958
`
`1121992 De La (Tierva. Sr.
`. 3482461
`5,686,966
`60998 Nemimfsky
`348213
`5,262,896
`
`52 1999 Emelko ..................................... 341256
`5,903,231
`FOREIGN PATENT DOCUMENTS
`
`I} 490 5114 A2
`W0 96226602
`2310645
`WO 94209528
`PCI‘2I'1‘962
`[10032
`
`European I’at. Off.
`621992
`HIM-I, 25249
`European i’at. Off.
`821996
`H04N 2203
`..
`. H1141. 25248
`221925 Nelhe rla nds ......
`Sweden ......................... 1104]. 22022
`40994
`
`0996 WIPO .............................. HIMN 2203
`
`OTHER PUBIJCATIONS
`
`Harlow W. Neu, Some Techniques of Pulse Code Modula-
`tion, Buiiett'n Sci‘twet‘zerisdtert Elektmtectmt‘schcn Vet‘et'rts,
`vol. 51, No. 20, Oct. 8, 1960, pp. 928—985.
`
`Pritttofit' ii'xotttitter—John K. Peng
`Assistant throtttitter—Jean W. Désir
`
`Attorney, Agent, or I‘Tt‘ttt—Arter & Hadden LLP
`
`[57]
`
`ABSTRACT
`
`Asyslem for high-speed data transmission using a television
`signal to communicate encoded data. A mulli-level encoding
`method is employed whereby raw data values are converted
`into one of a plurality 01‘ voltage levels. The encoding
`method allows for improved data transfer rates, conservation
`of bandwidth. and self-synchronization for decoding. Mock
`timing data signals are generated to comply with television
`signai standards, such as N'l'SC, SECAM, PAL and HDTV.
`
`53 Claims, 20 Drawing Sheets
`
`
`3 [00. 0|.
`
`EVERY SHE HAS 4
`POSSIBLE STATES It]
`FRMEIIION T0.
`IitAIJES 0.
`EMIIIJIMIS ‘ll-E2. MB
`10. Ill
`
`Roku EX1024
`
`U.S. Patent No. 7,589,642
`
`Roku EX1024
`U.S. Patent No. 7,589,642
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 1 0f 20
`
`6,122,010
`
`25
`
` ENCODE l
`Fig.
`I
`
`24
`
`ENCUUE 0
`
`ENCDBE 1
`
`ENCODE 2
`
`OUTPUT
`LEVEL B
`
`39
`
`ENCODE o
`
`ENCUDE a
`
`ENEODE 1
`
`ENEUDE o
`
`ENCODE l
`
`ENCUDE 2
`
`ENEOBE 1
`
`ENCODE 0
`
`ENCUDE 2
`
`Fig. 2
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 2 0f 20
`
`6,122,010
`
` EVERY STATE HAS 4
`l0. 1])
`
`POSSIBLE STATES TO
`TRANSITION T0.
`ENCODING THE
`VALUES 0,
`l. 2. AND
`3 [00. 01.
`
`

`

`US. Patent
`
`Scp.19,2000
`
`Sheet3 0f20
`
`6,122,010
`
`MIHP
`
`
`o_o—
`
`._....EH_._.....___.
`
`u4w>m4
`Pathso
`
`whsmzH
`.m:4<>
`
`.Hzmhzo
`
`4u>m4
`
`.m~<mpHm
`
`w.9:
`
`om
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 4 0f 20
`
`6,122,010
`
`BO
`
`
`
`FIRST = TRUE
`
`READ INPUT
`VALUE
`
`62
`
`64
`
`
`
`56
`
`Fig. 5
`
` IS
`
`INPUT < LAST
`VAliUE
`
`
`IF INPUT VALUE =O
`THEN
`OUTPUT LEVEL“ A
`AND LAST = D
`
`IF INPUT VALUE=O
`THEN
`OUTPUT LEVEL=B
`AND LAST = 1
`
`
`
`IF INPUT VALUE =1
`IF INPUT VALUE =I
`THEN
`THEN
`
`OUTPUT LEVEL = B
`OUTPUT LEVEL = C
`AND LAST = I
`AND LAST = 2
`
`
`
`
`IF INPUT VALUE =2
`IF INPUT VALUE =2
`THEN
`THEN
`
`OUTPUT LEVEL = C
`OUTPUT LEVEL = D
`
`AND LAST = 2
`AND LAST = 3
`
`
`IF INPUT VALUE=3
`IF INPUT VALUE=3
`THEN
`THEN
`
`
`OUTPUT LEVEL = D
`OUTPUT LEVEL = E
`
`
`AND LAST = 4
`AND LAST =3
`
`
`
`FIRST: FALSE
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 5 0f 20
`
`6,122,010
`
`100
`
`FIRST = TRUE
`
`READ OUTPUT
`VALUE
`
`
`
`IF OUTPUT LEVEL= A
`THEN
`
`INPUT VALUE = 0
`
`IF OUTPUT LEVEL= B
`THEN
`INPUT VALUE = 1
`
`IF OUTPUT LEVEL- C
`THEN
`INPUT VALUE = 3
`
`
`
`
`
`
`
`102
`
`104
`
`106
`
`[08
`
`110
`
`112
`
`114
`
`HE)
`
`NO
`
`[18
`
`IF INPUT VALUE>LAST
`THEN
`INPUT VALUE = INPUT VALUE -1
`
`Fig. 6
`
`STORE
`INPUT
`VALUE
`
`IF OUTPUT LEVEL = O
`THEN
`
`INPUT VALUE = 3
`
`
`
`IF OUTPUT LEVEL= E
`THEN
`INPUT VALUE - 4
`
`FIRST= FALSE
`
`
`
`
`%
`
`LAST = INPUT VALUE
`
`
`
`
`
`
`

`

`US. Patent
`
`Scp.19,2000
`
`Sheetfi 0f20
`
`6,122,010
`
`quh
`
`mm
`
`__o—
`
`am<am<
`
`‘4‘.
`
`<m
`
`u4m>u4
`
`Hampzo
`
`Hzmzfi
`
`u=4<>
`
`hzmhzo
`
`4m>m4
`
`mH<mPHm
`
`u.3
`
`,l#/r.om~
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 7 0f 20
`
`6,122,010
`
`
`
`8.2%22:2;88%
`
`
`88058.2%:3azunaooowzu5:852:
`Ea5:?onEa
`
`
`
`m2vmfim?
`
`{/02
`
`
`
`
`may“?22:fififimuSauna
`
`9.383E832was:
`
`02EE/
`
`02
`
`ma:
`
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 8 0f 20
`
`6,122,010
`
`
`
`ACTIVE
`VIDEO
`
`PERIOD
`
`52. 44 1.15
`
`
`HORIZONTAL
`BLANKING
`
`INTERVAL
`II.IEJJS
`
`HORIZONTAL
`SYNC
`PULSE
`15734 Hz
`
`I
`¢77us
`I
`lIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIlII'
`
`“I§§fi?I£?LA
`TRIGGERED
`BY SYNC
`(llIJs HINl
`
`
`
`
`
`
`
`Iris}. 1()
`
`VERTICAL
`VERTICAL
`EQUALIZINE
`ACTIVE
`VERTICAL
`SYNC
`TEIOEEEED
`SEIIIE
`PULSES
`IEIEEIEE
`PULSE
`
`BY SYNC
`241 5 LINES
`{3-31‘5’
`21 LINES
`59-94 Hz
`{1.3 ms MIN]
`'
`5 LINES
`
`
`
`
`

`

`US. Patent
`
`2
`
`MmS
`
`6
`
`m
`
`.5528W3.23::353::
`.:5Ea
`w,:2:
`
`oumouzm
`
`amaouZM
`
`¢H¢am88E
`
`mwe;:3was;:3
`
`0;
`
`0In,N.E_1d.am
`
`
`
`asEasE8m
`
`
`
`mam
`
`«om
`
`omfi
`
`
`
`mmmouuu\mm>Hmuummucouzmxmmpszmz<mp
`
`
`
`mop<44Humo:\<
`
`mmhmu>zou
`
`mzo_p<u_z:=zou
`
`(\o
`
`
`
`zaHam:aubmm>2ou
`
`vow
`
`map<44Humo
`
`mom
`
`
`
`

`

`US. Patent
`
`Sep. 19,2000
`
`Sheet 10 of 20
`
`6,122,010
`
`muxu¢4m
`
`xu¢4m
`
`24:9aw-..
`
`¥u<4mo
`
`H
`
`uszzoo_ul
`
`._¢uHEm>|I'_ HHHHHHHHHH
`
`
`_A||-mmfimm2§25m
`
`
`
`p30amxzcgmzummum
`
`m:H_mfizpmszza
`
`¥u¢mHzomm
`
`:umomIago;
`
`
`onhiszKZ_ummfiqm.om_-mmm4=muz>m4<uHhmm:-H_
`
`
`umm.«¢.¢mMMsz”Zym4¢uHhmm:2Hmzoflhxmmmm
`
`
`
`
`
`mmzhuHmummfifim.~-mmm4=¢mzHN_4<=am-H
`
`2.m:a
`
`mumm-mmMA=muz>m4¢hzom_mo=-H__
`
`><4mmHa
`
`Am>m;
`
`um—
`
`4m>m4
`
`
`
`Ammammahma_onp¢zmomzH
`
`MPHI:om
`
`MPHIzow
`
`uHsz
`
`MHHI:ow
`
`MPHI:om
`
`xqum
`
`mmxu¢4m
`
`¥u¢4mz¢zh
`
`E.5
`
`22hamjgammz<
`
`omnouzmmucouzm HUJm<w
`_emu—mammammnemammoomanaaHthinauaouzmhampzoupmhm
`
`
`¢P¢oauaouzw4¢pmoHa4¢FHo_omm:
`
`
`
`Hoooooooogo_oooHo.Iurm.hmm>\.mzoxmmh<pm
`
`.oooooo_ow«a.Hmflmflm¥z¢4m.sz;\.mmo=mmp<hm
`
`
`
`.ooooooo_ummfl_OO_H¢m4m>u4vuhqpm
`
`.ooooofifiogmmA__owm“4D_\<AM>M4mMH<_W
`
`
`nooooofi_#.«mmH_“__huJw>w4hmp<wm
`
`Hoooooo__amm__o__aoa4m>m4aWhipm
`
`Hooooo_o_Hoo__#o_gmuAm}M4mwhipm
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 11 0f 20
`
`6,122,010
`
`SECOND SCAN
`
`1400
`
`FIRST SCAN
`
`200
`
`
`
`30010001200
`
`
`
`TIME(1.1s} Fig.148
`
`S _J
`‘12-:
`:2
`mmH
`mm
`33;:
`8m'—
`,_zVII LL
`EDLI...
`
`500
`
`400
`
`250
`
`200
`
`5
`
`0
`
`5
`
`ENCDDED DIGITAL DATA VALUES
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 12 0f 20
`
`6,122,010
`
`
`
`I320I340
`
`I300
`
`
`
`
`
`TIMEi;15) F:9.14C
`
`1280
`
`EEE—
`
`_——
`*—_._
`—_—u-—
`‘‘—
`‘——
`_—._._
`—‘—
`
`FIRST5cmLINE
`
`250
`
`200
`
`50
`
`0
`
`ENCDDED DIGITAL DATA VALUES
`
`[260
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 13 of 20
`
`6,122,010
`
`Ln
`CI”I
`OJ
`--
`
`o
`g
`.0
`
`Ln
`m
`N
`
`A QVI
`
`q 0.
`8
`9-.
`‘m -
`I:
`535
`H
`l— LI...
`
`#52
`ru
`
`01
`
`"-
`0.:
`
`.—
`Sun
`-_
`—I—:a
`
`._
`Stu——
`
`_, =___
`__.—-
`:-
`H
`...
`g
`__._—
`
`23..
`
`._
`
`a:
`
`H
`
`*
`
`:L”_ —"
`.— —h 2»
`=~--
`-'
`" “h;
`2
`H
`g
`—~—-_
`n—0
`S
`—
`-h——.
`ILA—fl
`-— EL
`:u-I—
`'-
`_. EL.
`:Lu—
`" E'—
`..
`IgiiillIIIII-¢
`"'I-u—_—
`C
`._
`-§=—
`
`
`
`_u——_
`
`-§w—
`:m_—
`
`§5“=
`
`
`I
`I
`I
`I
`
`C!
`LD
`I'LI
`
`C)
`0
`t'U
`
`D
`LI"
`
`D
`D
`
`D
`Ln
`
`LO
`LO
`m
`D—
`
`ENCOBED DIGITAL DATA VALUES
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 14 of 20
`
`6,122,010
`
`F79'15A
`
`238
`
`5”“.EEMENEE
`
`STE/BLANK [N5
`HAVEFORH CONT IMJOUSLY
`
`’f‘fifl
`
`COLLECT OATA TO BE
`SENT TO FIFO
`
`SET OUTPUT
`TO ZERO
`
`
`
`SET OUTBUT
`TO THO
`
`
`
`ARE IE IN
`BLANKINB OR APPROAEHIIE
`
`BLAAKING ?
`
`
`FIFO 9?”
`EHENBES
`
`
`15 "E
`
`
`
`N
`
`UIPUT
`
`
`
`
`
`REPEAT ONCE FOR
`
`
`EACH PAlR OF BITS IN
`BONE ENCODING
`
`
`8 BIT DATA BYTE.
`IS THERE
`THIS BYTE
`A BIT PAIR? TO ENCOOE
`
`
`
`
`
`
`MATCH T0 FIG. ISB
`
`250
`
`

`

`US. Patent
`
`Sep. 19,2000
`
`Sheetls 0f20
`
`6,122,010
`
`ovam
`
`vow
`
`wa
`
`aHmm
`
`ummm
`
`emm
`
`exp.o¢m~
`
`zmummmo
`
`nqmm
`
`nmmm
`
`nmmm
`
`nomm
`
`Hum.amau:4¢:xmu:m_¢mh_mwmzh__
`
`.mwmxhohppmh=o
`
`Hum.obengqn1mg:m_¢m_HmMthmH
`
`.mmmzbo__=mH=o
`
`hum.ahowsgflp1mi:memH_mm_=_u.
`
`.mmmxhophzmhzo
`
`_mm.cnom=4¢:cmu:m_<m__mmwzhu_
`
`.xaouohH=¢H=o
`
`
`
`Ex:25&3oa“5.5.cm::mfiqmhHmmflmh‘— _mm
`
`uvmm
`
`ummm
`
`ummm
`
`comm
`
`hum._m:“24::tm<=cHdmHHmm_:_EH
`
`.xsomo—_=mh=o
`
`
`
`bum.Hbeunduu1Mi:x_¢m_HmmHIPmH
`
`.ma_25&8
`
`Em4aSi:xm4:m_¢mH_mw_=_EH
`
`.u:_mopHzmhac
`
`Hum._mo”:41:am::m_¢mHHmmthmm
`
`.mb_ma»H=mb=o
`
`m«:mH¢mpHmm_:Hb— hum
`.macmch—=m_=o_gom=4¢3
`
`uwmm
`
`ummm
`
`ummm
`
`nomm
`
`
`
`hum.Nnom=4qn1m;:«Him__mw_:hma
`
`.m:__CHHzm—ao
`
`pum.mbemagi:1Mi:m_¢m__mm_:_mH
`
`.x_mchHzmhzo
`
`hum.mgom=4¢>‘m¢xzH<¢_Hmmgzh__
`
`.meoh—=mh=o
`
`
`
`hum.mm:“24‘:xm;:x~¢mHfimm_:_m_
`
`.meohHzmhso
`
`Hmm.mm:m=4¢b«mi:«*1;h_mwH:_“—
`
`.uhflmahHzmpzo
`
`Hum.mwem=4¢1¢m¢zdemh_mmmzh“—
`
`.zm,mmchp=m_=a
`
`mi:mHgm_HmmHm_“—
`
`Em.m.5”5.5...
`
`.zu>mmohham—3o
`
`pmm.mmo“24::1Mi:m_¢mH_mmfizh“H
`
`.zuyumopp2¢b=o
`
`_mm.mbem=4¢piMi:m_¢mWmmw_:_m_
`
`.zm>mmohhamp=o
`
`
`
`Em.m.5”*3;xm::z_¢m__mm_:hkw
`
`.x_mchHam—2:
`
`mea:
`
`«mm
`
`mm:H‘s:
`
`
`
`«H4:_m¢;
`
`wHzmhao
`
`<25:2.20::
`
`o'.|.|.
`
`
`
`.I.I.|.I.ln.III.I.I.|.I.lI-I.|.l.l.l.|.ll.l.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 16 of 20
`
`6,122,010
`
`‘1
`
`flETEET PRESENCE
`
`W ENCOOED SIGNAL
`
`333
`
`
`
`
`
`
`
`IAIT FOR A
`LITTLE BIT
`
`338
`
`
`
`BREAK INPUT SIGNAL 000
`RANGES. HITH COOES FOR
`LEVEL A TI-IRU LEVEL E
`
`334
`
`336
`
`ABOVE
`LEVEL A
`?
`
`YES
`
`34
`
`Fig. 16A
`
`0
`
`
`
`
`START OUR TIMING
`CHAIN FOR ICOOING
`
`343
`
`SET LAST LEVEL
`TO A
`
`REPEAT THE
`FOLLOH Ihfi
`
`344
`
`346
`
`1HAIT UNTIL THE LAST THREE
`HISTORICAL SAMPLES HATCH
`THE PRESENT SAH’LE
`
`348
`
`
` ARE IE
`AT A DIFFERENT
`LEVEL ?
`
`
`
`MATCH T0 FIG. I63
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 17 0f 20
`
`6,122,010
`
`MATCH T0 FIG. TBA
`
`
`
`VHAT HAS
`LAST LEVEL
`
`
`
`
`
`
`
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`
`
`
`
`IS A. DECOOE A
`IS A. DECOE A
`IS A.
`IICOBE A
`IS A. ECODE A
`IS B. DECDII A
`
`
`
`BIT-PAIR OF 00
`BIT PAIR OF DO
`BIT PAIR OF DO
`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
`
`
`[S C. DECOII A
`IS B. DECODE A
`IS TI. DECODE A
`IS 3. BECODE A
`IS B. DECDEE A
`
`
`
`BIT PAIR OF OI
`BIT PAIR OF 01
`BIT PAIR OF OI
`BIT PAIR OF 01
`BIT PAIR OF OI
`
`
`
`
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`
`
`
`
`3fi4c
`
`
`
`IF THIS LEVEL
`IF THIS LEVEL
`IF THIS LEVEL
`IF IHIS LEVEL
`IF THIS LEVEL
`
`IS D. DECOE A
`IS D. EEODE A
`IS (I. DECODE A
`[S D. EEODE A
`IS E. ICON A
`
`
`
`BIT PAIR OF 10
`BIT PAIR OF 10
`BIT PAIR OF IO
`BIT PAIR OF IO
`BIT PAIR OF 10
`
`
`
`
`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 E. OECOII A
`IS D. DECODE A
`IS E. DECODE A
`IS E. DECODE A
`IS B. BECODE E
`
`
`
`
`
`
`
`
`BIT PAIR OF I]
`BIT PAIR OF 11
`BIT PAIR OF
`11
`BIT PAIR OF
`ll
`BIT PAIR OF IT
`
`
`
`
`
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`AND STORE IT.
`
`
`
`
`
`
`
`
`
`
`HAVE HE
`
`SELECT THE NEXT BIT
`ECWLETED A BYTE
`
`PAIR [N THE OUTPUT
`
`[BOT FOUR PAIRS)
`
`
`BYTE
`T
`
`
`
`
`
`
`
`
`
`STORE THE BYTE IN T|-[
`FIFO. RESET TO FIRST PAIR
`[F TEXT DECODED BYTE
`
`
`Fig. 168
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 18 of 20
`
`6,122,010
`
`TABLE 2:
`
`ORIGINAL
`DIGITAL
`ENCODED
`DATA
`
`E?fi23§°
`INFORMATION
`
`ENCODER
`STATE
`
`DIFITAL
`ENCODED
`INPUT
`DATA RANGE
`
`NP T
`PATTERN
`(IN [2..0]!
`
`STATE 2
`
`LEVEL E
`
`STATE T
`
`>218 AND <255
`
`LEVEL D
`
`STATE 6
`
`>184 AND <218
`
`LEVEL C
`
`STATE 5
`
`>150 AND <134
`
`LEVEL B
`
`STATE 4
`
`>116 AND <150
`
`LEVEL A/IDLE
`
`STATE 3
`
`<116
`
`BLANKINB
`
`STATE 2
`
`SYNCH/VQ.
`
`ITIg. I?
`
`

`

`US. Patent
`
`Sep. 19, 2000
`
`Sheet 19 0f 20
`
`6,122,010
`
`TABLE 3:
`
`i ndB
`
`l
`
`r
`
`0
`
`r
`
`D
`
`.II
`
`D
`
`r
`
`5
`
`
`
`
`
`WOOUDUUOODDDIDIUIOIU111111111111Oil-0101010
`
`.MOIUIUIOIUIUI[010101001010101011010101010
`
`
`
`500000000000000000000llllllllllllllllllll
`
`00000000000000D0000DDUODUDDOOUOIUIDIDIDI
`
`
`
`10....1111111111ODUDUODDUOUOODUODDUG1111111111
`
`
`
`
`
`w.
`WUOGOIIDUIIDD1...11100110011000Dillon—11001.11]
`
`"100100000000[00-00000000100[OGDDGOOUIDOI
`
`9.000n.n...UU0b"NNNNNNNor—Ir—(I-[[r—r-
`]]]JJ11J
`
`
`
`EUUUOOUIIIIUDOOOUI111.00001111110000IIIIII
`
`"0011001110000IIOUIIUDUUIIUDI10000111001100
`
`F19. l8
`
`

`

`US. Patent
`
`Sep. 19,2000
`
`Sheet 20 of 20
`
`6,122,010
`
`oo.mfl
`
`oo.o_
`
`.muq_mzwp
`
`mucouua
`
`mpqhm
`
`
`
`.zmmahw~wmmz—k\mumohmu=41>
`
`moJ<Z¢
`
`¢h¢a
`
`zmoum>¢x
`
`omm
`
`m8
`
`ommlmmm
`
`ELSE
`
`mafia.
`
`8..Tm_
`
`Ewe?
`
`DIGITAL ENCUDED 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 (CI?) of
`co-pending US. application Ser. No.08t‘767,371 liled Dec.
`16, 1996.
`
`FIELD OF TIIE 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.
`
`BACKGROUND OF 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 required for the original purpose is relatively low.
`For instance,
`these methods were designed to allow a
`television signal to carry closed-captioning andfor 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 hits 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 and teletext 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 ofthis "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 wavefomis,
`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 Arcnet, 0AM {Quadrature Amplitude Modulation), ASK
`(Amplitude Shift Keying), I’SK (Phase Shift Keying}, FSK
`(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, which is 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” ot' the future relies on high-
`Speed data transmission to distribute image, soqu and video
`to multiple access points worldwide. Currently, the distri-
`bution bottleneck is the data rate (defined in bits per second)
`
`5
`
`it]
`
`15
`
`so
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`2
`capabilities of the communications medium in use. For
`example, one minute ol‘oompressed digital video data may
`be represented by approximately ten megabytes of data.
`Currently available communications mediums include voice
`grade modems, leased line modems, ISDN services. 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 baud rate of 2400 baud, and encode
`4 bits per baud. The “baud“ defines a number oftransitions
`made on the base carrier each second, and the number of bits
`per baud multiplied by the baud rate provides a number of
`bin; per second (bps).
`Another aspect of the present invention is directed to the
`encoding of digital 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. This is
`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 streant
`is comprised of a signal having two
`voltage levels, one representing a digital “U,“ the other
`representing a digital “1.”
`In many cases, the data rate achievable by UARTs and
`ACIAs is insu flicient 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, t‘requency 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
`overcomes the data transfer rate limitations of the 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 of the present
`invention, there is provided a television signal data trans-
`mission system having a transmitter for encoding digital
`data and a mock television 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 data 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.
`
`It]
`
`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
`
`'Ihe above-mentioned and other features and objects of
`the invention and the manner of 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. 1 is 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 diflcrent input
`values into four output
`levels, according to a preferred
`embodiment of the present invention;
`FIG. 3 is a state diagram for encoding four dilIerent 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 difl’erent input values according to the state diagram
`shown in FIG. 3;
`FIG. 5 is a flow chart illustrating a preferred embodiment
`of the 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
`of the algorithm for decoding output levels into input values;
`FIG. '7 is a timing diagram illustrating the encoding of
`four different input values;
`FIG. 8 is a block diagram ofthe hardware arrangement for
`implementing the encoding algorithm of the present inven—
`tion;
`FIG. 9 is a block diagram ofthe hardware arrangement for
`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 N'I‘SC corn—
`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:
`
`so
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`4
`FIG. 14A is a table showing the states of the encoder state
`machine and corresponding outputs of the encoder;
`FIG. 14B is a timing diagram showing the digital encoded
`data for the first four phases ot'an NTSC signal and the first
`two scan lines of the active video phase;
`FIG. 14C is a timing diagram showing the digital encoded
`data for the first scan line shown in FIG. 143;
`FIG. 14D is a timing diagram showing the digital encoded
`data for a portion of the first scan line shown in 1’10. 14C;
`FIGS. 15A and 1513 provide a diagram illustrating the
`control unit logic for encoding data;
`FIGS. 16A and 168 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+I
`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 ofthe 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. I shows a state diagram 20 illustrat-
`ing the transition between states for encoding two different
`input values {i.e., “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 "O," the
`system transitions 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 one state
`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 shows a state diagram 30 illustrating the transition
`between states for encoding three input values (i.e., “0,“ " l "
`and "2") into four output levels (i.e., output levels A, B, C
`and D), according to a preferred embodiment of the present
`invention.
`
`FIG. 3 shows a state diagram 40 illustrating the transition
`is between states for the encoding of four input values (i.e.,
`"O”, "l", "2” and “3",' into five output levels (i.e., output
`levels A, B, C', I) and E), according to a preferred embodi-
`ment of the present invention. It should be appreciated that
`since there are four input values, each input value may
`represent a bit pair (1e, “m," "01," " l0,” and "11").
`Therefore, each output level will represent two bits, rather
`than one bit, as in conventional encoding systems.
`Moreover, where N different input values are encoded into
`at least N+l output levels, each input value can represent
`log2(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
`
`In
`
`15
`
`-
`
`5
`achievable, and bandwidth can be conserved. 11 should be
`appreciated that while in a preferred embodiment of the
`present invention the input values encode base 2 data (i.e.,
`log:(N) bits} the input values may also encode base X data.
`Therefore, the input values may represent values 0 through
`X—l
`in base X with the encoded output having at least X
`dilIerent output
`levels.
`It should also be understood that
`there may be more than N+1 output levels and transitions
`thereof for encoding N dill'erent 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 5. FIG.
`4 provides a timing diagram 50 which shows the transition
`of the output levels as each input value is encoded. It should
`be appreciated that in the embodiment shown in 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" represents bit pair “I l 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 U to 5 volts. The input values shown
`in FIG. 4 are encoded into output levels A thru Ii according _
`to the algorithm shown in llow chart 60 of FIG. 5. Beginning
`with step 62, a FIRST [lag is set to TRUE. This will indicate
`that this is the lirst 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 value is the first input value to be encoded,
`by determining the status of the FIRST flag. 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 second set of rules (steps 80—86) should be applied. as will
`be discussed below. For instance, in FIG. 4, the first input
`value is a “0” (corresponding to hit pair “0”). 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 “U.” The LAST variable is used as the reference value
`to determine the appropriate set of rules to be applied
`following the first 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 whether the 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 "l“ is greater than the LAST
`variable, which has been previously set to “U” 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
`
`an
`
`35
`
`4t]
`
`45
`
`50
`
`55
`
`60
`
`55
`
`6
`determine the output level for the next consecutive encoded
`input value. In particular, the next consecutive input 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 as different
`output levels. In the case of the lirst “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 [low chart 100
`which illustrates an algorithm for decoding output
`levels
`back into input values, according to a preferred embodiment
`ofthe present invention. Beginning with step 102, the FIRST
`flag is set to TRUE indicating that this is 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 cases this input value
`will be modilled, as will be explained below in connection
`with step 118. Therefore, the decoded input value will be
`determined based upon a set of rules determined by both the
`current output level and one or more prior output levels. If
`the output level is the first output level read in (i.e., FIRST-
`'I‘RUE), then the input value is not modified. In this respect,
`the algorithm will proceed from ste