III US005715376A

United States Patent (19) 11 Patent Number: 5,715,376

Nakayama 45) Date of Patent: Feb. 3, 1998
(54) DATA TRANSFORMATION APPARATUS 141489 6/1995 Japan .............................. G06F 5/66
1595122 8/1981 United Kingdom............. HO4N A40
(75) Inventor: Tadayoshi Nakayama, Tokyo, Japan
73) Assignee: Canon Kabushiki Kaisha, Tokyo, Primary Examiner-Scott A. Rogers
Japan Attorney, Agent, or Firm-Fitzpatrick, Cella, Harper &
Scinto
21 Appl. No.: 380,797 57 ABSTRACT
22 Filed: Jan. 30, 1995
An address exchanger and a data exchanger are provided at
30 Foreign Application Priority Data both sides of a plurality of look-up tables (LUTs). An even
Jan. 31, 1994 (JPl Japan .................................. 6-01.007 number address is constantly accessed at one of the LUTs
Feb. 17, 1994 (JP) Japan ................................... 6-020686 and an odd number address is constantly accessed in the
other LUTs. An interpolating operation on the basis of
(51) int. Cl. ... H04N 1/56 values output from the respective LUTs may constantly
52 U.S. C. .. ... 395/109; 358/523: 358/525 cause the same results as can be obtained without address
58 Field of Search ............................ 395/109; 364/723; exchange. By this, for the memory to be accessed by the odd
358/523, 525, 518, 519 number address and the even number address, a grid point
56 References Cited data for other transformation characteristics may be stored.
Therefore, in the data transformation apparatus performing
U.S. PATENT DOCUMENTS data transformation through interpolation employing a plu
4,837,722 6/1989 Sara ........................................ 364/723 rality of LUTs, memories of respective LUTs can be effi
5,175,701 12/1992 Newman et al. ....................... 364/723 ciently used for permitting data transformation of a plurality
of kinds of transformation characteristics.
FOREIGN PATENT DOCUMENTS
063967 3/1993 Japan ............................... H04N 1/40 53 Claims, 91 Drawing Sheets
U.S. Patent Feb. 3, 1998 Sheet 1 of 91 5,715,376

muzSIJTCVEIARNG?JOINdÐ
U.S. Patent Feb. 3, 1998 Sheet 2 of 91 5,715,376

(Xhl, Yh-1, Zhi-1)

(Kh-1, Yht-1, Zh)

(Xh, Yh, Zh) (Xht-l, Yh, Zh)

FIG.2
U.S. Patent Feb. 3, 1998 Sheet 3 of 91 5,715,376

FIG.3
U.S. Patent Feb. 3, 1998 Sheet 4 of 91 5,715,376

FIG.4A FIG.4B
U.S. Patent Feb. 3, 1998 Sheet 5 of 91 5,715,376

FIG.5
U.S. Patent Feb. 3, 1998 Sheet 6 of 91 5,715,376

V
Q
N

I
9

Iz
† `--JOE
|
GÍZoz.
U.S. Patent Feb. 3, 1998 Sheet 7 of 91 5,715,376

2O2 20, 2O6, 2O7 2O5 2O3 204

Yh Xh Y EXNEX2 24 216 24 xf Yf
C C C O O C O

wN r
i.
r

3. LU
t (x)
Feb. 3, 1998 Sheet 8 of 91 5,715,376
U.S. Patent Feb. 3, 1998 Sheet 9 of 91 5,715,376

EX26

Xh C C.
-Hill."
|...:*:
IEL:
LX3:41: (x)
242 1254

FIG.9
U.S. Patent Feb. 3, 1998 Sheet 10 of 91 5,715,376

297 214 216

EX2C D
2O2
4
Y C

312. 31.5

FIG. 1 O
U.S. Patent Feb. 3, 1998 Sheet 11 of 91 5,715,376

2O2 4. Yf
4 3 3 205 203 o, ?2O4
Yh

GE 2s. 22.
3.35
O6 21
EXC 215

...
geX

FIG. 11
U.S. Patent Feb. 3, 1998 Sheet 12 of 91 5,715,376

40 423 428
EX2C C
4 48

fity
if X.
X413 422 J 427

*is
X2C
Yh9
i" V w A.

2.E.X.
E. x2q, ) 8 V Al
408 t 426
XS 4. V A.
M\
4 11 A.

FIG. 12
U.S. Patent Feb. 3, 1998 Sheet 13 of 91 5,715,376

492

491
LSB GE)
403
Zh&- 422 427

Ex2 Eli" | | |
X

YS
4.
V w
2.É.-X
42 7 7 7 7 7 7 S-7 7
EX ar

if Xxi
4OH-
4.
)
w

l 1.

FIG. 13
U.S. Patent Feb. 3, 1998 Sheet 14 of 91 5,715,376

492

FIG. 14
U.S. Patent Feb. 3, 1998 Sheet 15 of 91 5,715,376

5 .
4.09 CYC 427
EX2 O )
Just
rig-y-
is EX
EXC
421. 426 8
D
408,
Xh C
N 46 al
401-1
41
XX| | | |
)
l2
524.

442

404 Ill"
448
H
O
I.
48
5.
|
24

GE
Ox) 452

GO 472

Yf C
O GX) 455

-483 A57
af C. GX) 447 535

406 X. GO O
CYC C -
531.
O
U.S. Patent Feb. 3, 1998 Sheet 16 of 91 5,715,376

FIG. 16 FIG.16A

FIG.16A FIG.16B
S501

INTIAL STATE
IN TABLE TO BE ACCESSED BY EXl=O, EX2=O, EX3=0,
DATA OF M (MAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EXls, EX2=O, EX3=0,
DATA OF C (CYAN) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2-l, EX3=0,
DATA OF Y (YELLOW) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1, EX2=l, EX3=0,
DATA OF Bk (BLACK). FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EXl=O, EX2=O, EX3=l,
DATA OF MOMAGENTA) FOR OHP ARE STORED
IN TABLE TO BE ACCESSED BY EX1sl, EX2=0, EX3=1,
DATA OF C (CYAN) FOR OBP ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2=1, EX3=l,
DATA OF Y (YELLOW) FOR OHP ARE STORED
IN TABLE TO BE ACCESSED BY EX1 = 1 EX2=1, EX3=l,
DATA OF Bk (BLACK). FOR OHP ARE STORED
SAR
COMMON PAPER S1502 op
DEECTION SENSOR DECTION
DETECTION

SET Ex1=0, Ex2=0 SET EXlsO, EX2so

RGB DATA FOR ONE PAGE RGB DAA FOR ON PAGE
IS TRANSFORMED INTO S RANSFORMED INTO
M(MAGENTA) AND M(MAGENTA) AND
TRANSFORMED IMAGE RANSFORMED IMAGE
IS OUTPUT: IS OUTPUT
U.S. Patent Feb. 3, 1998 Sheet 17 of 91 5,715,376

S5 O
SET EXl=1, EX2=0 SET EXl=1,EX2=0
RGB DATA FOR ONE PAGE RGB DATA FOR ONE PAGE
IS TRANSFORMED INTO S TRANSFORMED INTO
C (CYAN) AND C (CYAN) AND
TRANSFORMED IMAGE RANSFORMED IMAGE
IS OUTPUT S OUTPUT

SET EXl=O, EX2=1 SET Ex1=0, EX2=l

RGB DATA FOR ONE PAGE RGB DATA FOR ONE PAGE
IS RANSFORMED NO S RANSFORMED INTO
Y (YELLOW) AND Y (YELLOW) AND
TRANSFORMED IMAGE RANSFORMED IMAGE
IS OUTPUT IS OUTPUT

SET EX1=l, EX2=l SET EX1=1 EX2=l

RGB OAA FOR ONE PAGE RGB DATA FOR ONE PAGE
S TRANSFORMED INTO S TRANSFORMED INTO
Bk (BLACK) AND Bk (BLACK) AND
RANSFORMED IMAGE RANSFORMED IMAGE
IS OUTPU S OUTPUT:

FIG.16B
U.S. Patent Feb. 3, 1998 Sheet 18 of 91 5,715,376

|LNIHd
NOWMNIWOO(IO3Iº?SIWeOi
’5)IH
I
Z
U.S. Patent Feb. 3, 1998 Sheet 20 of 91 5,715,376

FIG. 19

FIG. 19A

FIG. 19A FIG. 19B

S. 80.

NITA, SAE
IN TABLE TO BE ACCESSED BY EX1=0, EX2-0, EX3=0,
DATA OF MOMAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1Ex2=O, EX3=0,
DATA OF C (CYAN) FOR COMMN PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EXl=OEX2sl, EX3=0,
DATA OF Y (YELLOW) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1sl, EX2=1, EX3=0,
Bk (BLACK). FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2=O, EX3=l,
DATA OF M (MAGENTA) FOR OHP ARE STORED
IN TABLE TO BE ACCESSED BY EX1=l, EX2-0, EX3=1,
DATA OF C (CYAN) FOR OHP ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2-1, EX3 =1,
DATA OF Y (YELLOW) FOR OHP ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1 EX2=1, EX3=1,
DATA OF Bk (BLACK). FOR OHP ARE STORED
STAR
COMMON PAPER S1802 op.
DE ECON SENSOR DETECTION
S803 DETECTION S804
U.S. Patent Feb. 3, 1998 Sheet 21 of 91 5,715,376

RGB DAA
COMPLEED

PERFORM FOLLOWING FOUR TRANSFORMATION FOR

SAME RGB DATA
(1) SET Ex1=O, EX2-O TO TRANSFORM RGB DATA
INTO M (MAGENTA)
(2) SET Ex1=1, EX2=O TO TRANSFORM RGB DATA
INTO C (CYAN)
(3) SET Exil=0, EX2=1 TO TRANSFORM RGB DATA
INTO Y (YELLOW)
(4) SET Ex1=l, EX2=1 TO TRANSFORM RGB DATA
INTO Bk (BLACK)

TRANSFER FOUR TRANSFORMED DATA M, C, Y, Bk.

O IMAGE OUTPUT PORTION

S808

FIG. 19B
U.S. Patent Feb. 3, 1998 Sheet 22 of 91 5,715,376

|Fl_ SWI?CJ]XOT
|JNI?d,
U.S. Patent Feb. 3, 1998 Sheet 23 of 91 5,715,376

*EIONRÐACKI) MNOI)d, S|C?SwNI3oIWRNO&SGaIV,AJ INVTI?) ÖTVZO?INGST (Jind,o

TndIORSJANOS
I£SKNO^(WCG VIÌCNIH
NWISOVMIJOA), dVSYIiTJ?VI IZº9IH
ZJXIZÄIANGMOS)
YI
8

XCJ?I,VOWÇE\CIOM N"(IMORSdJIOi,
U.S. Patent Feb. 3, 1998 Sheet 24 of 91 5,715,376
S2O

NAL STA
IN TABLE TO BE ACCESSED BY EX1=0, EX2=O, DATA
OF M (MAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1 EX2-0, DATA
OF C (CYAN) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2=l,
Y (YELLOW) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1 EX2-1,
Bk (BLACK). FOR COMMON PAPER ARE STORED
START

SET Ex1=O Ex2=0 S2O2

RGB DAIA FOR ONE PAGE IS
TRANSFORMED INTO M (MAGENTA) AND
TRANSFORMED IMAGE IS OUTPUT

SET Ex1=1 Ex2=O S2O3

RGB DATA FOR ONE PAGE IS
TRANSFORMED INTO C (CYAN) AND
TRANSFORMED IMAGE IS OUTPUT

SET EX1=0, EX2s S2O4

RGB DAIA FOR ON PAGE IS
TRANSFORMED INTO Y (YELLOW) AND
TRANSFORMED IMAGE IS OUPU

SET EX=1 EX251 S2.05

RGB, DATA FOR ONE PAGE IS
TRANSFORMED INTO Bk (BLACK) AND
TRANSFORMED IMAGE IS OUTPUT

FIG.22
U.S. Patent Feb. 3, 1998 Sheet 25 of 91 5,715,376

N
U N
Qb
N

3.
U.S. Patent Feb. 3, 1998 Sheet 27 of 91 5,715,376
S24O1

NITA, STATE
IN TABLE TO BE ACCESSED BY EX1=0, Ex2=O, DATA
OF M (MAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1 Ex2=0 DATA
OF C (CYAN) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2=1, DATA
OF Y (YELLOW) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1,EX2=1, DATA
OF Bk (BLACK). FOR COMMON PAPER ARE STORED
SAR

UPDATE RGB OAA S24O2

S2403
RGB DAA YS
COMPETED

PERFORM FOLLOWING FOUR TRANSFORMATIONS FOR

SAME RGB DAA
(1) SET EXl=0, EX2=O TO TRANSFORM RGB DATA
INTO M (MAGENTA)
(2) SET EXl=l, EX2=O TO TRANSFORM RGB DATA
INTO C (CYAN)
(3) SET Ex1=0, Ex2=1 TO TRANSFORM RGB DATA
INTO Y (YELLOW)
(4) SET Ex1=1, Ex2=1 TO TRANSFORM RGB DATA
INTO Bk (BLACK)

TRANSFER FOUR TRANSFORMED DATA M, C, Y, Bk,

TO IMAGE OUTPUT PORTION
S2405

FIG.25
U.S. Patent 5,715,376

WXICOJT,S?
U.S. Patent Feb. 3, 1998 Sheet 29 of 91 5,715,376

I
£0

C"OITNOXÐIACNO I,MOdNOIJI,
TVOJENZInõS
:HJ,|C?woaSNIoIWRGNOI&S,NV INW'd) (IndJ/mo

L\,!CIN?w o.as?INVlAL IH
(5)
ZZ

YI
8

KCJHI,OVW&Z\MONI "NIOYMHES,
ZXCAMISOW:(GVNTÍ
U.S. Patent Feb. 3, 1998 Sheet 30 of 91 5,715,376

FIG.28
S270

NIA, SAE FIG.28A

IN TABLE TO BE ACCESSED BY Ex1=0,
DATA OF MOMAGENTA) FoR coMMON
PAPER ARE SORED
IN TABLE TO BE ACCESSED BY Ex1=1,
DATA OF M (MAGENTA) FOR OHP SHEET FIG.28B
ARE SORED
STAR
S2702
COMMON PAPER OHP
DEECTION SENSOR DELECTION
DETECTION

S2703 S27O7

(1) SET Ex1=0 SET EX1 =

TRANSFORM ONE PAGE OF RANSFORM ONE PAGE OF
RGB DATA TO M (MAGENTA) RGB DATA TO M (MAGENTA)
TO OUTPUT TRANSFORMED TO OUTPUT TRANSFORMED
IMAGE IMAGE
DURING NERVAL OF DURING INTERVAL OF
TRANSFORMATION, IN TRANSFORMATION, IN
TABLE TO BE ACCESSED ABE O BE ACCESSED
BY EX1=l, STORE DATA BY Ex1=O STORE DATA
OF C (CYAN) FOR COMMON OF CCCYAN) FOR
PAPER OEP SHEET
S2704 S2708

(1) SET EX1=1 SET EX=0

RANSFORM ONE PAGE OF RANSFORM ONE PAGE OF
RGB DATA To C (CYAN) TO RGB DATA TO C (CYAN) TO
OUTPUT TRANSFORMED OUTPUT TRANSFORMED
IMAGE IMAGE
DURING NERVAL OF DURING INTERVAL OF
TRANSFORMATION IN TRANSFORMATION, IN
TABLE TO BE ACCESSED ABE O BE ACCESSED
BY EX1=0, STORE DATA BY EX1=O STORE DATA
OF Y (YELLOW) FOR OF Y(YELLOW) FOR
COMMON PAPER OP SECE

FIG.28A
U.S. Patent Feb. 3, 1998 Sheet 31 of 91 5,715,376

(1) SET Ex1=0 SE EX's

RANSFORM ONE PAGE OF
RGB DATA TO Y (YELLOW)
O OUTPUT TRANSFORMED
IMAGE
DURING INTERVAL OF
TRANSFORMATION IN
TABLE TO BE ACCESSED
BY EX1=l, STORE DATA
OF Bk (BLACK). FOR
COMMON PAPER
TRANSFORM ONE PAGE OF
RGB DATA TO Y (YELLOW)
O OUTPUT TRANSFORMED
IMAGE
DURING NERVAL OF
TRANSFORMATION IN
TABLE TO BE ACCESSED
BY Ex1=O STORE DATA
OF Bk (BLACK). FOR
OHP SEE

(1) SET Ex1=1 SET EX1=O

RANSFORM ONE PAGE OF
RGB DATA TO Bk (BLACK)
TO OUTPU TRANSFORMED
IMAGE
DURING NERVAL OF
TRANSFORMATION, IN
ABLE TO BE ACCESSED
BY EX1=0, STORE DATA
OF M (MAGENTA) FOR
COMMON PAPER
(3) END
RANSFORM ONE PAGE OF
RGB DATA TO Bk (BLACK)
TO OUTPUT TRANSFORMED
IMAGE
DURING INTERVAL OF
TRANSFORMATION IN
TABLE TO BE ACCESSED
BY EX1=1, STORE DATA
OF M (MAGENTA) FOR
OBP SBEE
END

FIG.28B
U.S. Patent 5,715,376

6Z
I-I
(5)
U.S. Patent Feb. 3, 1998 Sheet 33 of 91 5,715,376

ZOII

(IOSN? "CTÍONRIÐJAC NMOI?), NºOIÐJE?NCOdI 3NW”Id) (TVOJENSIMÓ IndJ/mol

09’5)IA
{CLHIVW?NYZIOSM SMIVCÄIWLMJOCA),H ¿CÄIVNQOWCRI NMTORIJåAN,O SKM:O(WIC TVÍ
?MINTOCWIA8,
U.S. Patent Feb. 3, 1998 Sheet 34 of 91 5,715,376

INA, SAC
IN TABLE TO BE ACCESSED BY EXlsO, DATA
OF M (MAGENTA) FOR TEXT ARE STORED
IN TABLE TO BE ACCESSED BY EX1sl, DATA
OF MOMAGENTA) FOR NATURAL. IMAGE ARE STORED

S3OO2
LOAD 2 KINDS OF
RANSFORMATION AB
FOR AND NATURA
MAG DURING INRWA
Of RANSFORMATION
WHEN i = 1, C(CYAN)
WHEN i = 2, Y (YELLOW)
WHEN i = 3, Bk (BLACK)
REGON
DISCRIMINATION

RANSFORM RGB DATA NO

M(MAGENTA) WHEN i = 1
C (CYAN) WHEN i = 2
Y (YELLOW) WHEN i
Bk (BLACK). WHEN i

REGION ON ?

ONE PAGE
RANSFORMATION
COMPLETED 2

FIG.31
U.S. Patent Feb. 3, 1998 Sheet 37 of 91 5,715,376

< IMAGE SAMPLE X

TEXT REGION

EXT REGION

NATURA
MAGE
REGION

TEXT REGION

FIG.34
U.S. Patent Feb. 3, 1998 Sheet 38 of 91 5,715,376
FIG.35

FIG.35A

FIG.35B
FIG.35A

INA, SAE
5-so
FOUR KINDS OF DATA OF
M(MAGENTA) ARE STORED
IN TABLE TO BE ACCESSED BY EXl=0, EX2=0,
DAA OF TEXT REGION ARE SORED.
SAME FOR C, Y, Bk
IN TABLE TO BE ACCESSED BY EX1=1EX2=0,
DAA OF WIDEO IMAGE REGON ARE SORED.
SAME FOR C. Y. Bk
IN TABLE TO BE ACCESSED BY EX1=O, EX2-1,
DAA OF GRAPEC REGION ARE SORED.
SAME FOR C. Y. Bk
IN TABLE TO BE ACCESSED BY EXl=1, EX2=l,
DAA OF SCANNER IMAGE REGION ARE SORED.
SAME FOR C, Y, Bk
SART

RANSFORM ONE PAGE OF RGB DATA

INTO M (MAGENTA) DEPENDING UPON S34O2
A TRIBUTE BIR AND OUTPUT
RANSFORMED IMAGE S3403

o TRANSFORM ONE PAGE OF RGB DATA S34O4

INTO C (CYAN) DEPENDING UPON
ATTRIBUTE BIT AND OUTPUT
RANSFORMED IMAGE
U.S. Patent Feb. 3, 1998 Sheet 39 of 91 5,715,376

DURING INTERVAL OF DATA TRANSFORMATION,

STORE 4 KINDS OF Y (YELLOW) DATA
S3405
RANSFORM ONE PAGE OF RGB DAA
INTO Y (YELLOW) DEPENDING UPON S34O6
ARIBUTE BIR AND OUTPU
RANSFORMED IMAGE S3407

DURING INTERVAL OF DATA TRANSFORMATION

STORE 4 KINDS OF Bk (BLACK) DATA

.. RANSFORM ONE PAGE OF RGB DATA

INTO Bk (BLACK) DEPENDING UPON
ATRIBUTE BIT AND OUTPUT S3408
RANSFORMED IMAGE

FIG.35B
U.S. Patent 5,715,376

H
I
(5)
£
Z
U.S. Patent Feb. 3, 1998 Sheet 42 of 91 5,715,376

c IMAGE SAMPLE >

EXT REGION

COMPUTER
GRAPHIC
EXT REGION IMAGE
RGION

SCANNER
CAPURE
MAGE EXT REGION
REGON

FIG.38
U.S. Patent Feb. 3, 1998 Sheet 43 of 91 5,715,376

DATA TRANSFORMATION APPARATUS

CLOCK INPUT
RESET INPU 2 B
COUNER

EXERNAL M, C. Y. Bk
SWITCHING SEING
INPUT SIGNAL REGISTER

SENG
REGISTER

RANSFORMED
DATA DAA
RANSFORMING O
PORTION
OOO

FIG. 39
U.S. Patent Feb. 3, 1998 Sheet 44 of 91 5,715,376

ff.IzI8ZGIZI

z
r.
ff9
w IZ
29
†

W
ONI OXW
q

IzZ.I as SS
wn

ye C
rs
y

--- r
re- re
U.S. Patent Feb. 3, 1998 Sheet 45 of 91 5,715,376

222

E5. Ii.
Earl xf>zf>y
E. His sitti f(xf-YF)
22i. IS 22g x_MAx
Xife very fiz flyz fixfly 222 IS 2232 Y MAX
Xf
22O1
4. Yf A A HESigned
22O2
Xf
Yf NC |Signed
Z, O 522. Ed
Cs2237
O3 | 22.38 x MIN
Y MIN
223.9
2 MIN
4. 22414
d 4.

| Orig>"'
MA; 244, 2252 21.63
X MED D224 4- 4
epizzag Dro"
MED-74. )
2253 21.64
FIG.41 ) CSMN
U.S. Patent Feb. 3, 1998 Sheet 46 of 91 5,715,376

?U
U

&|?:Z/
LaelI|sasz
I
(oz.)
:
gS'I

2
8
99

TIgrz
I09Z Z08Z
U.S. Patent 5,715,376
U.S. Patent Feb. 3, 1998 Sheet 48 of 91 5,715,376

S
+
I S
+
S
U.S. Patent Feb. 3, 1998 Sheet 49 of 91 5,715,376

VALUE OF Adri; 4 OF ADDRESS TO BE ACCESSED

FIG.44
U.S. Patent Feb. 3, 1998 Sheet 50 of 91 5,715,376

-|#ŒWT#)
I?Y }|
|
")
U.S. Patent Feb. 3, 1998 Sheet 51 of 91 5,715,376

NVOIJ')d:S
U.S. Patent 5,715,376
U.S. Patent Feb. 3, 1998 Sheet 53 of 91 5,715,376

1082
U.S. Patent Feb. 3, 1998 Sheet 54 of 91 5,715,376

<!-
NOIJAVS“diº,
U.S. Patent Feb. 3, 1998 Sheet SS of 91 5,715,376

NOIJV,S"d('w NOIJV'dS
U.S. Patent 5,715,376

g
CN
U.S. Patent Feb. 3, 1998 Sheet 57 of 91 5,715,376

Gº?I
U.S. Patent Feb. 3, 1998 Sheet 58 of 91 5,715,376

VALUE OF Adri; 2 OF ADDRESS

INPUT TO RESPECTIVE LUTs

ex-oex1-1

FIG.51
U.S. Patent Feb. 3, 1998 Sheet 59 of 91 5,715,376

2.30 252. 250 2523 2.351

FIG.52
U.S. Patent Feb. 3, 1998 Sheet 60 of 91. 5,715,376

Z99Z.
Z
MO'I)
×
Þ09Z Z(83MOTI)
10Izzòrgcorz UIX\WIZ Z(HaMOTI)
U.S. Patent Feb. 3, 1998 Sheet 61 of 91 5,715,376

WALUE OF Adri; 4 OF ADDRESS

INPUT TO RESPECTIVE LUTs

ex-o ex

FIG.54
U.S. Patent Feb. 3, 1998 Sheet 62 of 91 5,715,376

(oz.)
:
as'?
(rz)
If
T

£99.Z

Z
Z99
Tiffz

TO
Z
£ †09Z (83ZMÓTI)
ZZOI
TOT
ÇOI
Z.
U.S. Patent Feb. 3, 1998 Sheet 63 of 91 5,715,376

92II92Z

OOO“TWIJN IRC,J
99'{DIH

SR:I?CWM 3:1£5)NIV HOX

U.S. Patent Feb. 3, 1998 Sheet 64 of 91 5,715,376

(VIJAVMCI CO
Z9ZI97IT

£99.Z

Z99Z

(×3MZOTI)
Feb. 3, 1998 Sheet 65 of 91 5,715,376

TOOOVIN?WRZI,J
; C

†
SECIMTVÍR:W);
U.S. Patent Feb. 3, 1998 Sheet 66 of 91 5,715,376

ON
l?)

N
Q r. N m V
Q V H V H V EH V E
N ven O N o n O N o
(N (N N -R (N N

r
S
r

S.
a C
q
if -
ry
-

amsuna
-
r
amura
A A A
-
: -
w
-

p
H

;
C

: iii, E
U.S. Patent Feb. 3, 1998 Sheet 67 of 91 5,715,376

2O3 2O2 2O
Zh Y Xh
O
4. 4. 4.
4. 4 4.
23 21 2.

4. 4. 4. 232
3 12
"OOO" LUT

2322
X MAX
Yax
2 MAX
SELECTOR
lur
CONTROL ADDRESS
SIGNAL SELECTION 232.3
EXCHANGE
X MMD 3 2
YZMMD
MMD lur

2324

11" LUT

12 cARRY CARRY
2 2
Xh LOWER 2. BITS GE 2 GE)
473
Yh LOWER 2. BITS

2h LOWER 2. BITS

EX 2361 FIG.60
U.S. Patent Feb. 3, 1998 Sheet 68 of 91 5,715,376

2O3 21 O2 2011
2h Y. X
C
4. 4. 4.

270
"Ooo" 3 273 27.2 27.

G) -G) () ('
X IMAX LUT
Max 27.5 27.4
ZMAX SELECTOR Sf
CONTROL G) --G) -G) C'
XMMD
Y MMD 3 SIGNA,
ECHANGE ... T 278 27.7
U

Z MMD

S.S.S. 2323 2721 272O

LUT
"111"

2 s ... 2324
LUT

2362
CARRY CARRY
2
X. LOWER 2 BTS GE) 2 GE) 2
2 2473
Y LOWER. 2 BIS
CARRY
2 2
Ah LOWER 2 BITS --GE
2 247
acK

2361 FIG.61
Sheet 70 of 91 5,715,376

--
N

N g O O. O.

sk, N
Vo

t
re
N

o
Sheet 72 of 91 5,715,376

GE)
-

9:782
U.S. Patent 5,715,376

†26 2

\O
QQ
Qb
N
N
U.S. Patent Feb. 3, 1998 Sheet 75 of 91 5,715,376
FIG.67
FIG.67A

FIG.67A SO
FIG.67B

INTIAL STATE
IN TABLE TO BE ACCESSED BY EXl=O, EX2-0
DATA OF M (MAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EXl=l, EX2s0,
DATA OF C (CYAN) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2el,
DATA OF M (MAGENTA) FOR OHP SHEET ARE STORED
IN TABLE TO BE ACCESSED BY EXl=1, EX2s1,
DATA OF C (CYAN) FOR OBP SHEET ARE STORED
- SAR

COMMON PAPER S3102 op

DETECTION SENSOR DETECTION
DELECTION
S303 S32
SET EX2=O SET EX2s.
S304 S33
SET EXl=O TRANSFORM SET Ex1=0, TRANSFORM
ONE PAGE OF RGB DATA ONE PAGE OF RGB DAA
TO M (MAGENTA) TO TO M (MAGENTA) TO
OUTPUT RANSFORMED OUTPUT TRANSFORMED
MAGE MAG
S305 S34
DURING INTERVAL OF DURING INTERVAL OF
TRANSFORMATION, IN TRANSFORMATION IN
ABLE TO BE ACCESSED TABLE O BE ACCESSED
BY EXl=O STORE DATA BY EXlsO STORE DATA
OF Y (YELLOW) FoR OF Y (YELLOW) FOR
COMMON PAPER OHP SEEET
U.S. Patent Feb. 3, 1998 Sheet 76 of 91 5,715,376

a as arr-H Hrs a - - - -w- - - - was a

• SET Exisl, TRANSFORM SET is TRANSFORM

ON PAGE OF RGB DAA. O. ON PAGE OF RGB DATA TO
c(cyAN) TO OUTPUT C(cyAN) To ouTPUT
RANSFORMED IMAG CONVERD IMAGE

DURING NERVAL OF DURING IN RVAL OF

TRANSFORMATION IN TRANSFORMATION, IN
TABLE TO BE ACC2SSED TABLE TO BE ACCESSED
By Ex1=1 STORE DATA BY EX1=l, STORE DATA
of Bk (BLACK) FOR OF Bk (BLACK). FOR
COMMON PAPER OEP SET

SET Exilso, TRANSFORM SET Exil=O TRANSFORM

ONE PAGE OF RGB DAA. O. ONE PAGE OF RGB DATA TO
Y (YELLOW) TO OUTPUT Y (YELLOW) To OUTPUT
RANSFORMED IMAG RANSFORMED IMAGE

DURING NERVAL OF DURING NERVAL OF

TRANSFORMATION IN TRANSFORMATION IN
ABLE TO 3 ACCESSED TABLE O B JACCESSED
BY EX1=0, STORE DATA BY EXl=O STORE DATA
OF M (MAGENTA) FOR OF M (MAGENTA) FOR
COMMON PAPER OHP SEE

SET EXl=1, TRANSFORM SET Ex1=l, TRANSFORM

ON PAGE OF RGB DAA. O ONE PAGE OF RGB DATA 'O
Bk (BLACK) To OUTPUT Bk (BLACK) TO OUTPUT
RANSFORMO IMAGE RANSFORMED IMAGE

DURING NERVAL OF DURING INTERVAL OF

TRANSFORMATION, IN TRANSFORMATION IN
ABLE O BE ACCESSED ABLE TO BE ACCESSED
BY EXl=O STORE DATA BY Ex1=O STORE DATA
OF C (CYAN) FOR OF MOMAGENTA) FOR
COMMON PAPER OEP SEE
END ND

FIG.67B
U.S. Patent Feb. 3, 1998 Sheet 79 of 91 5,715,376
FIG.7O

FIG.7OA

FIG.7OA FIG.7OB
S350

INITIAL STATE
IN TABLE TO BE ACCESSED BY EX1=O, EX2=O, DATA
OF M (MAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1,EX2=O, DATA
OF C (CYAN) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2=1, DATA
OF MOMAGENTA) FOR OHP ARE STORED
IN TABLE TO BE ACCESSED BY Ex1=1, Ex2=1,
C (CYAN) FOR OHP SHEET ARE STORED
START

COMMON PAPER
DETECON SENSOR DETECTION
DELECTION
S3503 S350

S3504 S35.
SET EX10, TRANSFORM • SET Ex1=O TRANSFORM
ONE PAGE OF RGB OAA O ONE PAGE OF RGB OATA 'O
M(MAGENTA) To ouTPUT M(MAGENTA) To OUTPUT
TRANSFORMED IMAGE RANSFORMED IMAGE
S352
SET EX1=1, TRANSFORM SET Ex1=l, TRANSFORM
ONE PAGE OF RGB DATA TO ONE PAGE OF RGB OAA O
C (CYAN) To ouTPUT c(cyAN) To ouTPUT
TRANSFORMED IMAGE RANSFORMED IMAGE
U.S. Patent Feb. 3, 1998 Sheet 80 of 91 5,715,376

DURING INTERVAL OF DURING INTERVAL OF

TRANSFORMATOIN, IN TRANSFORMATOIN, IN
AB O B JACCESSED ABLE TO BE ACCESSED
BY EXll, STORE DATA BY EX1=l, STORE DATA
OF Y (YELLOW) FOR OF Y (YELLOW) FOR OEP
COMMON PAPER IN TABLE SEET IN TABLE
TO BE ACCESS2D BY O BE ACCESSED BY
Exlal, STORE DATA OF Ex1=l, STORE DATA OF
Bk (BLACK). FOR COMMON Bk (BLACK). FOR OBP
PAPER SEEE

SET EXl.0, TRANSFORM SET Exl-O, TRANSFORM

ON PAGE OF RGB DATA 'O ONE PAGE OF RGB DATA TO
Y (YELLOW) To ouTPUT Y (YELLOW) TO OUTPUT
RANSFORMED IMAGE TRANSFORMED IMAGE

SET EX=l, TRANSFORM SET Ex1=l TRANSFORM

ONE PAGE OF RGB DAA. O. ON PAGE OF RGB DAA. O.
Bk (BLACK) TO OUTPUT Bk (BLACK) TO OUTPUT
RANSFORMED IMAG RANSFORMED IMAGE

DURING NERVAL OF DURING INTERVAL OF

TRANSFORMATOIN, IN TRANSFORMATOIN IN
ABLE TO BE ACCESSED TABLE TO BE ACCESSED
BY EXl=0, STORE DATA BY EXl=0, STORE DATA
OF MOMAGENTA) FOR OF MOMAGENTA) FOR OHP
COMMON PAPER IN TABLE SEER IN TABLE
TO BE ACCESSED BY O BE ACCESSED BY
EXl=1, STORE DATA OF Ex1=1, STORE DATA OF
C (CYAN) FOR COMMON C (CYAN) FOR OHP
PAP2R SEET
END
END

FIG.7OB
U.S. Patent Feb. 3, 1998 Sheet 81 of 91 5,715,376

ZCŠIOS‘WºNgO\ITJVSEINOV'ICX, MS?OCWGKNI3ILOSTNGE?C,JOHWId

|]dOJ, Nwoawoa ZC„IOSºogoVºIOTxWG;IV{ON'JCaIX, OS?OWGCK(IºNTEHILOGC?N,JUIOdSW

U.S. Patent Feb. 3, 1998 Sheet 82 of 91 5,715,376

FIG.72

FIG.72A

FIG.72A
FIG.72B
S360

NIAL SAE
IN TABLE TO BE ACCESSED BY EX1=OEX2=O, DATA
OF MOMAGENTA) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=l EX2-0, DATA
OF C (CYAN) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=0, EX2-1, DATA
OF Y (YELLOW) FOR COMMON PAPER ARE STORED
IN TABLE TO BE ACCESSED BY EX1=1 EX2-1, DATA
OF Bk (BLACK) FOR COMMON PAPER ARE STORED
SAR

COMMON PAPER S3602

DECTION SENSOR
DEECTION ?
S3603
OHP DECTION

IN TABLE TO BE ACCESSED BY EXO, EX2=0,

STORE DATA OF MOMAGENTA) FOR OHP SHEET
IN TABLE TO BE ACCESSED BY EX1=1 EX2=0,
STORE DATA OF C (CYAN) FOR OHP SHEET
IN TABLE TO BE ACCESSED BY EX1=OEX2al,
STORE DATA of Y (YELLOW) FOR OHP SHEET
IN TABLE TO BE ACCESSED BY EX1=1 EX2=1,
STORE DATA OF Bk (BLACK). FOR OHP SHEET
S36O4.
SET EX1s0, Ex2=O
TRANSFORM ONE PAGE OF RGB DATA TO M (MAGENTA)
O OUPU, RANSFORMED IMAGE
U.S. Patent Feb. 3, 1998 Sheet 83 of 91 5,715,376

SET EXl=1, EX2=O

TRANSFORM ONE PAGE OF RGB DATA TO C (CYAN) TO
OUTPUT IRANSFORMED IMAGE
S3606
SET Ex1=0, Ex2=1
TRANSFORM ONE PAGE OF RGB DATA TO Y (YELLOW)
TO OUTPUT TRANSFORMED IMAGE
S36O7
SET Ex1=1, Ex2=1
TRANSFORM ONE PAGE OF RGB DATA TO Bk (BLACK)
TO OUTPUT TRANSFORMED IMAGE
S3608

IN TABLE TO BE ACCESSED BY EX1=0, EX2s O,

STORE DATA OF MOMAGENTA) FOR COMMON PAPER
IN TABLE TO BE ACCESSED BY EXl=l, EX2=0,
STORE DATA OF C (CYAN) FOR COMMON PAPER
IN TABLE TO BE ACCESSED BY EX1=0, EX2el,
STORE DATA OF Y (YELLOW) FOR COMMON PAPER
IN TABLE TO BE ACCESSED BY EX1=1,EX2=1,
STORE DATA OF Bk (BLACK). FOR COMMON PAPER
END

FIG.72B
U.S. Patent Feb. 3, 1998 Sheet 85 of 91 5,715,376

FIG.74

FIG.74A
FIG.74A
C start D FIG.74B
COMMON PAPER S38O
DETECTION SENSOR
DETECTION 2

OHP DETECTION S38O2

IN TABLE TO BE ACCESSED BY EX1=0, EX2=0,

STORE DATA OF MOMAGENTA) FOR OHP SHEET
IN TABLE TO BE ACCESSED BY EX1=l, EX2=0,
STORE DATA OF C(CYAN) FOR OHP SHEET
* IN TABLE TO BE ACCESSED BY EXl=O, EX2-1,
STORE DATA OF Y (YELLOW) FOR OHP SHEET
IN TABLE TO BE ACCESSED BY EX1=1 EX2=1
STORE DATA OF Bk (BLACK). FoR OHP SHEET

IN TABLE TO BE ACCESSED BY EX1=O, EX2=0,

STORE DATA OF MOMAGENTA) FOR COMMON PAPER
IN TABLE TO BE ACCESSED BY EX1=l, EX2=0,
STORE DATA OF C(CYAN) FOR COMMON PAPER
IN TABLE TO BE ACCESSED BY EX1=O, EX2el,
STORE DATA OF Y (YELLOW) FOR COMMON PAPER
IN TABLE TO BE ACCESSED BY EX1=1 EX2=1,
STORE DATA OF Bk (BLACK). FOR COMMON PAPER

S3804
SET EX1=O, EX2=O
TRANSFORM ONE PAGE OF RGB DATA To M(MAGENTA)
TO OUTPUT TRANSFORMED IMAGE
U.S. Patent Feb. 3, 1998 Sheet 86 of 91 5,715,376

SET Ex1=1, Ex2=o

TRANSFORM ONE PAGE OF RGB DATA TO C (CYAN) TO
OUTPU, RANSFORMED IMAGE

* SET EX1=0, Ex2=1

TRANSFORM ONE PAGE OF RGB DATA TO Y (YELLOW)
TO OUTPUT TRANSFORMED IMAGE

SET EX1=1, EX2=l

TRANSFORM ONE PAGE OF RGB DATA TO Bk (BLACK)
O OUTPUT TRANSFORMED IMAGE

FIG.74B
U.S. Patent Feb. 3, 1998 Sheet 88 of 91 5,715,376

FIG. 76

FIG. 76A

FIG. 76A
FIG. 76B
S4OO

INTIAL SAE
IN TABLE TO BE ACCESSED BY EX1=O, EX2=0,
M(MAGENTA) DATA FOR TEXT FOR COMMON PAPER
ARE SORED
IN TABLE TO BE ACCESSED BY EX1=1,EX2=0,
M(MAGENTA) DATA FOR NATURAL IMAGE FOR
COMMON PAPER
IN TABLE TO BE ACCESSED BY EXl=0, Ex2=l,
M(MAGENTA) DATA FOR TEXT FOR OHP SHEET ARE
SORED
IN TABLE TO BE ACCESSED BY Ex1=1, Ex2=l,
M(MAGENTA) DATA FOR NATURAL IMAGE FOR
OHP SEEE ARE SORED
STAR

PANE PAPER S4002 op.

DELECTION SENSOR DE ECON
DELECTION
S4OO.3 S4OO4
SE EX2=O SE EX2s.

S4005
TRANSFORM ONE PAGE OF RGB DAA. INTO
M(MAGENTA) DEPENDING UPON ATTRIBUTE
B AND OUTPUT RANSFORMED IMAGE
S4O6

DURING INTERVAL OF DATA TRANSFORMATION,

STORE 4 KINDS OF C(CYAN) CONVERTING DATA
U.S. Patent Feb. 3, 1998 Sheet 89 of 91 5,715,376

TRANSFORM ONE PAGE OF RGB DATA NO

C (CYAN) DEPENDING UPON ATTRIBUTE
BIT AND OUTPUT TRANSFORMED IMAGE
S4008

DURING INTERVAL OF DATA TRANSFORMATION,

STORE 4 KINDS OF Y (YELLOW) DATA
S4009
TRANSFORM ONE PAGE OF RGB DATA INO
Y (YELLOW) DEPENDING UPON ATTRIBUTE
By AND OUPU, RANSFORMED IMAGE
S400

DURING INTERVAL OF DATA TRANSFORMATION

STORE 4 KINDS OF Bk (BLACK) DATA
S40
TRANSFORM ONE PAGE OF RGB DATA INTO
Bk (BLACK) DEPENDING UPON ATTRIBUTE
B AND OUTPU, RANSFORMED IMAGE
END

FIG. 76B
U.S. Patent Feb. 3, 1998 Sheet 90 of 91 5,715,376

:T=T"35)WNOVXIN?£Wr3mI)VMN

ZZ"?IH
 5,715,376
1.
DATA TRANSFORMATION APPARATUS
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to a data transfor
mation apparatus for transforming a plurality of (multi
dimensional) signals into other signals by employing an
interpolation process using a look-up table (hereinafter
referred to as a "LUT"). The invention relates to, for
example, a data transformation system for transforming a
multi-dimensional video signal of R(red), G(green), B(blue)
into each of printing color signals of Y(yellow),
M(magenta), C(cyan) and Bk(black).
2. Description of the Related Art
Non-linear transformation (e.g. gamma transformation or
logarithmic transformation) of a digitized video signal is
frequently performed employing a LUT. This is because,
when such a non-linear transformation is performed by an
arithmetic circuit, the arithmetic circuit becomes quite com
plicated and large in size. On the other hand, when a
non-linear transformation is performed for an 8 bit video
signal employing a LUT, the transformation can be realized
by a memory having 256 bits of capacity, to be used as the
LUT. The above-mentioned transformation is used to trans
form one type of video signal into another type of video
signal, the LUT being employed is called a one-dimensional
LUT.
On the other hand, due to the recent remarkable increase
of use of a desktop publishing system (hereinafter referred
to as a "DTP"), the opportunity of handling a color image is
increasing. In such case, a device for performing color
image input is mainly a scanner, video camera and so forth
and an output device is mainly a color printer, such as ink-jet
type, dye sublimation type, or electrophotographic type
printer.
These color input and output devices respectively operate
in a specific color space. Therefore, it is quite unlikely to
reproduce an original color image by directly transferring a
color image data obtained from a certain scanner to a color
printer without color transformation processing, for output
ting the image. In order to make the color of the image
scanned by the scanner and the image printed by the color
printer consistent, a process for transforming the color space
of the input device, e.g. scanner, video camera and so forth,
and the color space of the output device, i.e. various color
printers set forth above, becomes necessary.
This process is hereinafter referred to as a "color trans
formation process".
Such color transformation process is the process to trans
form a three color (typically R(red), B(blue) and G(green))
image signal obtained by the input device into each of a
three or four color image signal of the output device. The
LUT to be employed for such transformation is referred to
as a three-dimensional LUT.
However, when transformation of the above-mentioned
three color image signal into one of a plurality of colors of
the output device employing only a three-dimensional LUT,
in the case that the image signal of one color is consisted
with 8 bits, a LUT adapted for 24 bits of input and 8 bits of
output becomes necessary. In such case, the necessary
memory capacity for the LUT becomes 16M bytes.
Furthermore, the above-mentioned capacity of memory is
required for each individual color of the output device.
Therefore, the practically required memory capacity
becomes large, ranging 48 to 64M bytes.
2
In such case, employment of a sufficiently large capacity
of memory is impractical in view of the cost of memory.
Therefore, when the LUT is employed in the color trans
formation process, it is typical to reduce the required capac
ity of the memory to be used for the LUT by utilizing an
arithmetic interpolating process. There are several kinds of
interpolation methods for transforming a three color image
signal into a single color employing the LUT. As one
example, an eight point interpolation is well known and is
10
described below.
In the eight point interpolation method employing a LUT,
three color signals Xi, Yi and Zi (respective color signals
having n+m bits) before transformation is divided into
Xi-Xh-2m+Xf, Yi=Yh-2m+yf and Zi=Zh-2m+zf. Namely,
Xh, Yh and Zh respectively represent the upper n bits of the
15 color signals Xi, Yi and Zi, and Xf, Yf and Zf respectively
represent the lower m bits of the color signal Xi, Yi and zi.
In the LUT, with respect to combinations (2) of 2n in
number of values Xh=0, 1, 2 . . . 2n -1, Yh=O. 1, 2 . . . 2"
-1 and Zh=0, 1,2... 2n-1, color-data after transformation
20 (hereinafter also occasionally referred to as "grid point
data") are stored. More specifically, the content of the LUT
may be expressed as grid data associated with respective
grid points specified by a coordinate when the combination
is a coordinate of a three-dimensional space. In the practical
process, the grip point data are read out with taking 3-n bit
data, in which Xh, Yh and Zh are linked, as an address.
In the eight point interpolation process, the grid point data
read out from the LUT as set forth above, are grip point data
corresponding to eight coordinate positions located at
30 respective peaks (grid points) of a cube shown in FIG. 1.
Utilizing the eight grid point data, objective interpolation
points, namely points represented by three color signals Xi,
Yi and Zi, interpolating calculation is performed for deriving
transformed data. More specifically, in the cube (partial
35 interpolation space) shown in FIG. 1, an arithmetic opera
tion is performed for the objective points represented by
lower bit signals Xf, Yf, Zf.
When the grid point data at respective grid points in the
partial interpolation space in FIG. 1 is expressed by D(X-
coordinate, Y-coordinate and Z-coordinate) and the trans
formed data obtained by the eight point interpolation process
is expressed by H(Xi, Yi, Zi), the transformed data H is
derived from the following equation (1).
45
55 Eight grid point data necessary for performing the fore
going interpolating operation is read out from one LUT
sequentially and to perform the foregoing calculation to
derive the transformed data. In this case, a period required
for the arithmetic operation is long. Therefore, it is not
possible to obtain the transformed data at high speed.
Therefore, normally, eight LUTs having the identical con
tents respectively are provided to read out eight grid point
data D necessary for an interpolating operation in parallel,
multiplying respective grid point data by coefficients deter
65 mined by the lower bit data of the color signals and summing
the products to obtain the result of the interpolating opera
tion.
 5,715,376
3 4
Other than the foregoing eight point interpolation, there
are other various methods, depending upon how may grid
point data read out from the LUT, used based on what
relationship of grid data are to be used. While a greater
number of grid point data to be used results in a higher
precision in interpolation in general, an increasing of the
number of the grid point data to be used inherently causes
increasing of the size of the interpolation circuit.
Amongst various interpolation methods, as an interpola
tion method which can reduce the size of the interpolation
circuit without significantly sacrificing the precision in
interpolation, there is a four point interpolation method as
disclosed in Japanese Patent Application Publication No.
16180/1983.
The proposed interpolation method performs interpola
tion employing one of six tetrahedrons (see FIG. 2) obtained
by dividing the cube of FIG. 1 having eight peaks as eight
grid points specified by the upper bit signals of the foregoing
three color signals, by three planes.
On the other hand, an interpolating equation in the inter
polating operation is defined for each of the six tetrahedrons.
Therefore, mutually distinct six interpolating equations must
be provided. In this case, in each of the interpolating
equations, four grid point data to be used for the interpo
lating operation are differentiated and further multiplication
coefficients for respective grid point data are differentiated.
Therefore, a circuit for selecting the grid point data and
arithmetic operation of the multiplication of the coefficient
becomes relatively complicated.
The inventor of the present invention has proposed in
Japanese Patent Application No. 285.330/1993 to unify the
six interpolating equations into a single interpolating
equation, to simplify reading out grid point data to be used
for the interpolating operation and arithmetic operation of
the multiplication of the coefficient for the read out grid
point data. The unification of the interpolating equation
proposed in the prior application is performed on the basis
of mutually large and small relationships of the three
dimensional inputs,
As set forth above, while various interpolation methods
for a color transformation process employing the LUT is
known, in all of the foregoing methods, it is direct and
effective way to improve transformation speed to employ a
plurality of the LUTs having identical contents respectively.
In the case that eight LUTs are employed for an eight
point interpolation process in the foregoing related art, and
if the number of upper bit of the color signal to be trans
formed is n=4 and the output data width of the LUT is 8bits,
the capacity of one LUT becomes 4K bytes (12 bits-for
address and 8 bits for i output) and thus a total 4K bytesX
8=32K bytes of table memory is necessary. Therefore, the
conventional data transformation system encounters a prob
lem of relatively high cost.
Also, in the four or eight point interpolation method
employing four or eight LUTs as described above, when four
or eight LUTs having identical contents are accessed
simultaneously, the addresses to be accessed are mutually
different. Namely, the grip point data to be simultaneously
output are mutually different in the four or eight LUTs.
In view of this, it is a major task of the present invention
to differentiate the contents of each of the LUTs for effi
ciently use four or eight LUTs.
Employment of a plurality of LUTs having mutually
distinct contents has been disclosed in U.S. Pat. No. 4,837,
722, for example. The disclosed construction is as follows.
Instead of proving the same content of interpolation
function values (grid point data) in each of a plurality of
LUTs, the LUTs respectively store a part of the interpolation
function values divided from the values to be stored a single
LUT. More specifically, the interpolation function values
which are to be originally stored in a single LUT, are stored
in a plurality of sub-LUTs as fractions of the original single
LUT. Associated with this construction, the sub-LUT to be
accessed is differentiated depending upon the value of the
lower bit of the input signal. By this, data transformation
comparable with that employing a plurality of LUTs having
identical contents becomes possible with a memory capacity
of one original LUT.
However, in the construction employing a plurality of
Sub-LUTs as disclosed in the above-identified U.S. Patent
may permit only one kind of data transformation with one
15 unit. Therefore, upon data transformation for obtaining
output data of Y. M. C, Bk from input data of R, G, B, four
units of the above-mentioned construction becomes neces
sary. This is so because when output data is different, the
registered content of a plurality of sub-LUT has to be
O differentiated.
On the other hand, in most of the output devices, such as
a printer, copying machine and so forth., it is not necessary
to obtain the above-mentioned Y. M., C, Bk data simulta
25
neously. Namely, the data transformation for obtaining Y.M.
C. Bk data may be performed sequentially within a given
time interval. In view of this, the present invention intends
to efficiently use the LUT.
Another piece of prior art employing a plurality of LUTs
30 having different content is disclosed in Japanese Patent
Application Layed-open No. 63967/1993.
The construction disclosed in the above-identified publi
cation is also adapted to data transformation for one kind
similarly to the foregoing U.S. Patent. Also, the interpolation
35 method employing the tetrahedrons disclosed in the above
identified publication is to employ two LUT outputs (grid
point data) at most for shortening a read out period. In view
of this, the present invention intends to restrict lowering of
the interpolation precision by performing four point inter
polation employing four points.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide a data
transformation apparatus which efficiently uses a plurality of
45 LUTs.
Another object of the present invention is to provide a
data storage method effective for storing different data in
each of a plurality of LUTs.
50 A further object of the present invention is to provide a
data transformation apparatus which satisfactorily performs
data transformation depending upon operation of an image
output device.
A still further object of the present invention is to provide
55 an image forming system which efficiently utilizes a plural
ity of LUTs in data transformation.
A yet further object of the present invention is to provide
a data transformation apparatus which stores different kinds
of transformation data respectively stored in different
regions in a plurality of LUTs by constantly limiting
addresses to be accessed by each LUT in a given region
depending upon a sum of address data or a sum of values of
address data and switching signal and can only access a table
region having one transformation characteristic by the
65 address.
A still further object of the present invention is to provide
a data transformation apparatus which permits access of a
 5,715,376
5 6
table region having another kind of transformation charac apparatus for performing a data transformation through an
teristic by modifying the above-mentioned region in each of interpolating operation employing a plurality of look-up
the LUTs and by modifying the content of the switching tables, the circuit board comprising:
signal. an address generating circuit for generating a plurality of
In a first aspect of the present invention, there is provided address data on the basis of an input data to be trans
a data transformation apparatus for performing a data trans a logical formed;
formation by employing a plurality of look-up tables, the operation circuit for performing an exclusive logic
apparatus comprising: operation of a signal data of a part of the input data and
address exchanging means for performing an exchanging an aaddress switching control signal;
exchanging circuit for exchanging the plurality of
operation including non-exchanging for transfer paths of O
a plurality of address data on the basis of an input data to address data by varying a mode of exchanging depending
be transformed so as to provide each of a plurality of upon a result of operation of the logical operation circuit
address data to the look-up table corresponding to an before the plurality of address data generated by the
attribute of the address data to be provided. address generating means are applied to the plurality of
In a second aspect of the present invention, there is look-up tables so that the address data is provided to the
provided a data transformation apparatus for performing a 5 look-up tables corresponding to an attribute of the address
data transformation by employing a plurality of look-up a data data;
tables, the apparatus comprising: exchanging circuit for exchanging grid point data by
address assigning means for providing each of a plurality of varying a mode of exchanging depending upon a result of
address data based on an input data to be transformed to operation of the logical operation circuit with respect to
one of a plurality of regions in each of the plurality of respective grid point data output from the plurality of
look-up tables, the one of a plurality of regions corre look-up tables so that a correspondence is established
sponding to an attribute of the address data to be provided. between the grid point data and an interpolation coeffi
In a third aspect of the present invention, there is provided cient corresponding to the address data by which the grid
a data transformation apparatus for performing a data trans point data is output;
formation by employing a plurality of look-up tables, the 25 an interpolating operation circuit for performing an interpo
apparatus comprising: lating operation on the basis of the grid point data output
address assigning means for providing an address data, by the data exchanging circuit; and
which has a same number of bits as a data input to the data a terminal for inputting switching control data for sequen
transformation apparatus, to the look-up table correspond tially varying the switching control signal so as to sequen
ing to an attribute of the address data to be provided. 30 tially perform a plurality of kinds of data transformation.
In a fourth aspect of the present invention, there is In a sixth aspect of the present invention, there is provided
provided a data transformation apparatus for performing a a data transformation apparatus for performing a data trans
data transformation through an interpolating operation formation through an interpolating operation by employing
employing a plurality of look-up tables, the apparatus com a plurality of look-up tables, the apparatus comprising:
prising: 35 means for switching look-up table to be used for data
address generating means for generating a plurality of transformation by a switching control signal.
address data on the basis of an input data to be trans In a seventh aspect of the present invention, there is
formed; provided a data transformation apparatus for performing a
logical operation means for performing an exclusive logic data transformation through an interpolating operation by
operation of a signal indicative of an attribute of each of employing a plurality of look-up tables, the apparatus com
the plurality of address data based on the input data and prising:
a switching control signal; address generating means for generating address data cor
address exchanging means for performing an exchanging responding to each of the plurality of look-up tables, on
operation including non-exchanging for transfer paths of the basis of a part of an input data to be transformed;
a plurality of address data on the basis of an input data to 45 address exchanging means for determining the look-up
be transformed, so as to provide each of the plurality of tables respectively corresponding to a plurality of address
address data to the look-up table corresponding to the data generated by the address generating means on the
attribute of the address data to be provided, the address basis of a residue obtained when a division of a sum of the
exchanging means varying a mode of exchanging depend address data generated by the address generating means
ing upon a result of operation of the logical operation and a switching control signal by a number of kinds of
means; data transformation to be switched by the switching
data exchanging means for performing an exchanging opera control signal, is performed; and
tion including non-exchanging for transfer paths for trans interpolation means for performing an exchange between
ferring data output from the plurality of look-up tables data output from respective ones of a plurality of look-up
with respect to the address data provided by the address 55 tables on the basis of respective addresses determined by
exchanging means so as to establish correspondence of the address exchanging means, in symmetry to address
the data output to an interpolating coefficient correspond exchange by the address exchanging means, and perform
ing to the address data provided for outputting of the data ing an interpolation on the basis of a combination of the
output, the data exchanging means varying a mode of data and an interpolation coefficient.
exchanging depending upon the result of operation of the In an eighth aspect of the present invention, there is
logic operation means; and provided an image forming system for forming an image on
interpolation means for performing interpolation calculation the basis of data transformed by a data transformation
on the basis of the data output from the data exchanging apparatus, the system comprising:
means and the corresponding interpolation coefficient to the data transformation apparatus for performing a data
output a transformed data. 65 transformation through an interpolating operation
In a fifth aspect of the present invention, there is provided employing a plurality of look-up tables, the apparatus
a circuit board to be employed in a data transformation including:
 5,715,376
7 8
address generating means for generating a plurality of
address data on the basis of an input data to be trans
formed;
logical operation means for performing an exclusive logic
operation of a signal indicative of an attribute of each of
the plurality of address data based on the input data and
a switching control signal;
address exchanging means for performing an exchanging
operation including non-exchanging for transfer paths of
a plurality of address data on the basis of an input data to
be transformed, so as to provide each of a plurality of
address data to one of a plurality of regions of each of the
plurality of look-up tables, the one of regions correspond
ing to the attribute of the address data to be provided, the
address exchanging means varying a mode of exchanging
depending upon a result of operation of the logical
operation means;
data exchanging means for performing an exchanging opera
tion including non-exchanging for transfer paths for trans
ferring data output from the plurality of look-up tables
with respect to the address data provided by the address
exchanging means so as to establish correspondence of
the data output to an interpolating coefficient correspond
ing to the address data provided for outputting of the data
output, the data exchanging means varying a mode of
exchanging depending upon the result of operation of the
logic operation means;
interpolation means for performing an interpolation calcu
lation on the basis of the data output from the data
exchanging means and the corresponding interpolation
coefficient to output a transformed data;
switching control means for varying the Switching control
signal to vary the region to which an address exchanging
means provides address data; and
control means for sequentially performing a plurality of
kinds of data transformation by controlling the switching
control means depending upon the operation of the image
forming system to sequentially vary the switching control
signal.
In a ninth aspect of the present invention, there is pro
vided a data storage method for storing a table data in a
plurality of look-up tables, the method comprising the steps
of:
generating address data for data to be stored in the plurality
of look-up tables;
determining the look-up table corresponding to the address
data generated on the basis of the generated address data
and a number of kinds of data to be stored; and
storing the table data into the determined look-up table.
The above and other objects, effects, features and advan
tages of the present invention will become more apparent
from the following description of the embodiments thereof
taken in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
The present invention is understood more fully from the
detailed description given herebelow and from the accom
panying drawings of the preferred embodiment of the
invention, which, however, should not be taken to be limi
tative to the present invention, but are for explanation and
understanding only.
In the drawings:
FIG. 1 is a diagrammatic illustration showing a concept of
an interpolation space defined by the upper bits of three
input data;
FIG. 2 is a diagrammatic illustration showing a concept of
an interpolation space in a four point interpolation method;
FIG. 3 is a block diagram showing a construction of a first
embodiment of a data transformation apparatus according to
the present invention;
FIGS. 4A and 4B are diagrammatic illustrations showing
an operational concept of a changer for an address, data and
so forth to be employed in embodiments of the data trans
formation apparatus according to the present invention;
FIG. 5 is a block diagram showing a construction of a
second embodiment of a data transformation apparatus
O according to the present invention;
FIG. 6 is a block diagram showing a construction of a
third embodiment of a data transformation apparatus accord
ing to the present invention;
FIG. 7 is a block diagram showing a construction of a
15
fourth embodiment of a data transformation apparatus
according to the present invention;
FIG. 8 is a blockdiagram showing a construction of a fifth
embodiment of a data transformation apparatus according to
20 the present invention;
FIG. 9 is a block diagram showing a construction of a
sixth embodiment of a data transformation apparatus accord
ing to the present invention;
FIG. 10 is a block diagram showing a construction of a
25 seventh embodiment of a data transformation apparatus
according to the present invention;
FIG. 11 is a block diagram showing a construction of an
eighth embodiment of a data transformation apparatus
according to the present mnvention;
30
FIG. 12 is a block diagram showing a construction of a
ninth embodiment of a data transformation apparatus
according to the present invention;
FIG. 13 is a block diagram showing a construction of a
tenth embodiment of a data transformation apparatus
35
according to the present invention;
FIG. 14 is a block diagram showing a construction of an
eleventh embodiment of a data transformation apparatus
according to the present invention;
FIG. 15 is a block diagram showing a construction of a
twelfth embodiment of a data transformation apparatus
according to the present invention;
FIGS. 16A and 16B are flowcharts showing process of an
access region switching and an image output control asso
45 ciating therewith in a thirteenth embodiment of a data
transformation apparatus according to the present invention;
FIG. 17 is a timing chart of various signals in the control
process of FIG. 16;
FIG. 18 is a block diagram showing a construction for
50 executing the control process of FIG. 16;
FIGS. 19A and 19B are flowcharts showing a process of
an access region switching and an image output control
associated therewith in a fourteenth embodiment of a data
55
transformation apparatus according to the present invention;
FIG. 20 is a timing chart of various signals in the control
process of FIG. 19;
FIG. 21 is a block diagram showing a construction for
executing the control process of FIG. 19;
FIG. 22 is a flowchart showing a process of an access
region switching and an image output control associated
therewith in a fifteenth embodiment of a data transformation
apparatus according to the present invention;
FIG. 23 is a timing chart of various signals in the control
65 process of FIG.22;
FIG. 24 is a block diagram showing a construction for
executing the control process of FIG.22;
 5,715,376
9 10
FIG. 25 is a flowchart showing a process of an access
region switching and an image output control associated
therewith in a sixteenth embodiment of a data transforma
tion apparatus according to the present invention;
FIG. 26 is a timing chart of various signals in the control
process of FIG. 25;
FIG. 27 is a block diagram showing a construction for
executing the control process of FIG. 25;
FIGS. 28A and 28B are flowcharts showing a process of
an access region switching and an image output control
associated therewith in a seventeenth embodiment of a data
transformation apparatus according to the present invention;
FIG. 29 is a timing chart of various signals in the control
process of FIG. 28;
FIG. 30 is a block diagram showing a construction for
executing the control process of FIG. 28;
FIG. 31 is a flowchart showing a process of an access
region switching and an image output control associated
therewith in an eighteenth embodiment of a data transfor
mation apparatus according to the present invention;
FIG. 32 is a timing chart of various signals in the control
process of FIG. 31;
FIG. 33 is a block diagram showing a construction for
executing the control process of FIG. 31;
FIG. 34 is a diagrammatic illustration showing one
example of an image output in the embodiment of FIG. 31;
FIGS. 35A and 35B are flowcharts showing processes of
an access region switching and an image output control
associated therewith in a nineteenth embodiment of a data
transformation apparatus according to the present invention;
FIG. 36 is a timing chart of various signals in the control
process of FIG. 35;
FIG. 37 is a block diagram showing a construction for
executing the control process of FIG. 35;
FIG. 38 is a diagrammatic illustration showing one
example of an image output in the embodiment of FIG. 37;
FIG. 39 is a block diagram showing a construction for
switching a kind of an access LUT in the twentieth embodi
ment of a data transformation apparatus according to the
present invention;
FIG. 40 is a block diagram showing a basic construction
of an interpolation circuit in embodiments of the present
invention;
FIG. 41 is a block diagram showing a basic construction
of the interpolation circuit in the embodiments;
FIG. 42 is a block diagram showing a major construction
of a twenty-first embodiment of a data transformation appa
ratus according to the present invention;
FIGS. 43A, 43B, 43C and 43D are explanatory illustra
tions illustrating address change in the embodiment of FIG.
42;
FIG. 44 is an explanatory illustration showing a relation
ship between access regions of respective LUTs and switch
ing control signals in the embodiment of FIG. 42;
FIG. 45 is a block diagram showing a major construction
of a twenty-second embodiment of a data transformation
apparatus according to the present invention;
FIGS. 46A, 46B, 46C and 46D are explanatory illustra
tions illustrating address change in the embodiment of FIG.
45;
FIG. 47 is a block diagram showing a major construction
of a twenty-third embodiment of a data transformation
apparatus according to the present invention;
FIGS. 48A, 48B, 48C and 48D are explanatory illustra
tions illustrating address change in the embodiment of FIG.
47;
FIG. 49 is a block diagram showing a major construction
of a twenty-fourth embodiment of a data transformation
apparatus according to the present invention;
FIG.50 is a block diagram showing a major construction
of a twenty-fifth embodiment of a data transformation
10
apparatus according to the present invention;
FIG. 51 is an explanatory illustration showing a relation
ship between access regions of respective LUTs and switch
ing control signals in the embodiment of FIG.50;
FIG. 52 is a block diagram showing a major construction
15 of a twenty-sixth embodiment of a data transformation
apparatus according to the present invention;
FIG. 53 is a block diagram showing a major construction
of a twenty-seventh embodiment of a data transformation
apparatus according to the present invention;
FIG. 54 is an explanatory illustration showing a relation
ship between access regions of respective LUTs and switch
ing control signals in the embodiment of FIG. 53;
FIG.55 is a block diagram showing a major construction
25
of a twenty-eighth embodiment of a data transformation
apparatus according to the present invention;
FIG. 56 is a block diagram showing a major construction
of a twenty-ninth embodiment of a data transformation
apparatus according to the present invention;
30 FIG. 57 is a block diagram showing a major construction
of a thirtieth embodiment of a data transformation apparatus
according to the present invention;
FIG. 58 is a block diagram showing a major construction
of a thirty-first embodiment of a data transformation appa
35 ratus according to the present invention;
FIG. 59 is a block diagram showing a construction for
address generation in a thirty-second embodiment of the
present invention;
FIG. 60 is a block diagram showing a major construction
of a thirty-second embodiment of a data transformation
apparatus according to the present invention;
FIG. 61 is a block diagram showing a major construction
of a thirty-third embodiment of a data transformation appa
45 ratus according to the present invention;
FIG. 62 is a block diagram showing a major construction
of a thirty-fourth embodiment of a data transformation
apparatus according to the present invention;
FIG. 63 is a block diagram showing a major construction
50 of a thirty-fifth embodiment of a data transformation appa
ratus according to the present invention;
FIGS. 64A and 64B are block diagrams showing a major
construction of a thirty-sixth embodiment of a data trans
formation apparatus according to the present invention;
55
FIG. 65 is an explanatory illustration showing a relation
ship between access regions of respective LUTs and switch
ing control signals in the embodiment of FIG. 64;
FIG. 66 is a block diagram showing major construction of
a thirty-seventh embodiment of a data transformation appa
ratus according to the present invention;
FIGS. 67A and 67B are flowcharts showing a process of
an access region switching and an image output control
associated therewith in a thirty-eighth embodiment of a data
65 transformation apparatus according to the present invention;
FIG. 68 is a timing chart of various signals in the control
process shown in FIG. 67;
 5,715,376
11
FIG. 69 is a block diagram showing a construction for
executing the control process shown in FIG. 67;
FIGS. 70A and 70B are flowcharts showing a process of
an access region switching and an image output control
associated therewith in a thirty-ninth embodiment of a data
transformation apparatus according to the present invention;
FIG. 71 is a timing chart of various signals ini the control
process shown in FIG. 70;
FIGS. 72A and 72B are flowcharts showing a process of
an access region switching and an image output control
associated therewith in a fortieth embodiment of a data
transformation apparatus according to the present invention;
FIG. 73 is a timing chart of various signals in the control
process shown in FIG.72;
FIGS. 74A and 74B are flowcharts showing a process of
an access region switching and an image output control
associated therewith in a forty-first embodiment of a data
transformation apparatus according to the present invention;
FIG. 75 is a timing chart of various signals in the control
process shown in FIG. 74;
FIGS. 76A and 76B are flowcharts showing a process of
an access region switching and an image output control
associated therewithin a forty-second embodiment of a data
transformation apparatus according to the present invention;
FIG. 77 is a timing chart of various signals in the control
process shown in FIG. 76;
FIG. 78 is a block diagram showing a construction for
executing the control process shown in FIG. 76.
DESCRIPTION OF THE PREFERRED
EMBODIMENT
The present invention is discussed in detail hereinafter in
terms of preferred embodiments with reference to the
accompanying drawings. In the following description,
numerous specific details are set forth in order to provide a
thorough understanding of the present invention. It will be
obvious, however, to those skilled in the art that the present
invention may be practiced without these specific details. In
other instance, well-known structures are not shown in detail
in order to not unnecessarily obscure the present invention.
(FIRST EMBODIMENT)
FIG. 3 is a block diagram showing a construction of a first
embodiment of a data transformation apparatus according to
the present invention.
The shown embodiment is not adapted to transform R. G.
B of three-dimensional signal, but is for transforming a
one-dimensional 8 bit signal Xi(=Xh 2+Xf,Xh is the upper
four bits and Xf is the lower four bits) into another signal,
and thus shows one of the simplest construction. When a
grid point data designated by the upper four bit signal Xh is
assumed as D(Xh) and a transformed data after interpolation
is assumed as H(Xi), an interpolating calculation in the
shown embodiment is a one-dimensional two points inter
polation and thus can be expressed by:
In FIG. 3, a reference numeral 101 denotes a terminal for
inputting the upper bit signal Xh, a reference numeral 102
denotes a terminal for inputting the lower bit signal Xf, and
a reference numeral 103 denotes a terminal for inputting a
signal indicating a value of 24. Reference numeral 104
denotes a terminal for inputting a control signal Ex for
switching two kinds of tables discussed later. A reference
numeral 105 denote an adder for adding "1" to the upper bit
12
signal Xh, a reference numeral 106 denotes an exclusive OR
element (hereinafter referred to as EXOR element), and a
reference numeral 107 denotes a switching control signal as
output of the EXOR element 106.
A reference numeral 108 denotes an address exchanger of
the first embodiment of the present invention, reference
numerals 111 and 112 denote look-up tables (LUTs) for
outputting a grid point data corresponding to an address
from the address exchanger 108, a reference numeral 113
10 denotes a data exchanger for exchanging a transfer path of
grid point data output from LUTs 111 and 112.
The output from the data exchanger 113 is supplied for an
interpolating calculation in a following construction. Refer
ence numerals, 121 and 122 denote multipliers, a reference
15 numeral 125 denotes a subtracter, a reference numeral 126
denotes an adder, and a reference numeral 127 denotes a
terminal for outputting a transformed data Ha (Xi).
FIGS. 4A and 4B are diagrammatic illustrations showing
a concept of operation in the address exchanger 108 and the
20 data exchanger 113 shown in FIG. 3.
More specifically, when a control signal 107 indicates
“0”, as shown in FIG. 4A, a signal input to an upper stage
is output from the upper stage and a signal input to a lower
stage is output from the lower stage. Therefore, at this
25 condition, a signal is not exchanged. In contrast, when the
control signal 107 indicates "1", as shown in FIG. 4B, the
signal input to the upper stage is output from the lower stage
and the signal input to the lower stage is output from the
upper stage. Therefore, in response to this condition, the
30 signal is exchanged.
In further explanation, the operation of the address
exchanger 108 and the data exchanger 113 is determined by
an EXOR of a transformation table switching signal EX and
a least significant bit (hereinafter referred to as "LSB”) of
35 the upper bit signal Xh, that is, determined by the output
signal 107 from the EXOR 106. When the transformation
table switching signal EX is "0" and the LSB of the upper
bit signal Xh is also "0" (at this time, Xh indicates an even
number), the output signal 107 becomes "0". Therefore,
exchanging of the signals of the address exchanger 108 and
the data exchanger 113 is not performed. Accordingly, the
upper bit signal Xn indicating an even number and being
input through the terminal 101 is supplied for the LUT 111
as an address signal. On the other hand, a signal Xh-1
45 derived by adding "1" to the signal Xh by the adder 105 is
supplied to the LUT 112 as an odd number address signal.
By this, from the LUTs 111 and 112, data D(Xh) and
D(Xh-1) are read out, respectively and passed through the
data exchanger 113 as is. Then, the data DCXh) is input to the
50 multiplier 121 and the data DOXh--1) is input to the multi
plier 122. On the other hand, to a multiplier 121, a signal
indicating (2-Xf) calculated by a subtracter 125 is input as
a coefficient. On the other hand, the lower bit signal Xf of
the input signal is input to a multiplier 122 as a coefficient.
55 Through the above, (2-Xf)-D(Xh) is calculated in the
multiplier. 121 and Xf-DOXh--1) is calculated in the multi
plier 122. The results of calculations are added to each other
by an adder 126 to be output from the terminal 127 as
truncated or rounded values. This output becomes the result
of calculation of the foregoing equation (2).
Next, when the LSB of the upper bit signal Xh indicates
"1" and the transformation table switching signal EX indi
cates "0" (in this case, Xh indicates odd number), the control
signal or the output signal 107 becomes "1". Therefore, in
65 the address exchanger 108 and the data exchanger 113.
signal exchanging as illustrated in FIG. 4B is performed.
Accordingly, the signal Xn of an odd number input through
 5,715,376
13 14
the terminal 101 is exchanged by the address exchanger 108 The shown embodiments constructed to perform a data
to be supplied to the LUT 112. In contrast, an even number transformation process by a four point interpolation in a two
address derived by adding "1" to the upper bit signal Xh by dimensional interpolation space in a data transformation of
the adder 105 is supplied to the LUT 111. By this, the data two input data. More specifically, since four grid point data
DOXh) is read out from the LUT 112 and the data DOXh--1) 5 are employed for the interpolating operation, four LUTs are
is read out from the LUT 111. The data DOXh) read out from employed as discussed with respect to the related art. In the
the LUT 112 is exchanged by the data exchanger 113 to be conventional construction of the data transformation system,
input to the multiplier 121. On the other hand, the data only one kind of data transformation is possible with
D(Xh+1) as read out from the LUT 111 is input to the employing four LUTs. In contrast to this, according to the
multiplier 122. The subsequent process is the same as the 10 shown embodiment, with the construction discussed later,
foregoing case (in the case where the LSB of the upper bit four kinds of data transformation become possible.
signal Xh is "0"). When input data defining two-dimensional input space are
As is clear from the discussion for the above-mentioned assumed to be Xi-Xh2+Xf and Yi=Yh-24+Yf (here Xh and
two cases, only an even number address is given to the LUT Yh are upper 4 bits and Xf and Yfare lower 4 bits), and the
111 and only an odd number address is given to the LUT transformed data after interpolation process is assumed to be
112. Accordingly, in the case that the transformation table 15 H3 (Xi, Yi), the H (Xi, Yi) is derived from the following
switching signal EX is set to "0", the LUT 111 is used as the
table only for the even number addresses and the LUT 112 interpolating operation.
is used as the table only for the odd number addresses. (3)
The data transformation system shown in FIG. 3 is
adapted for two point interpolation, in this case, similarly to
the prior art, mutually identical contents of two LUT are
employed. In addition, each of the two LUTs is provided the
same memory capacity as that of the LUT to be employed In FIG. 6, reference numerals 201 and 202 denote termi
in the conventional construction. According to the nals for inputting upper bit signals Xh and Yh, respectively,
embodiment, respective LUTs are specifically used only for 25 reference numerals 203 and 204 denote terminals for input
the odd number addresses and only for the even number ting lower bit signals Xf and Yf respectively, and reference
addresses. Therefore, even when the memory capacity of numerals 206 and 207 denote terminals for inputting control
respective LUTs are the same as those in the conventional signals EX1 and EX2 for switching four transformation
construction, corresponding to the addresses of respective tables in respective LUTs.
LUTs which are not accessed, another characteristic of grid 30
point data is stored so that, by setting the transformation "1"Reference
for the
numerals 210 and 211 denote adders for adding
upper bit signals Xh and Yh respectively,
table switching signal EX to "1", another characteristic of reference numerals
data transformation is performed as described later with having input of LSBs213 of
and 214 denote EXOR elements
the upper bit signals Xh and Yh and
respect to FIG. 16 and subsequent drawings. of the control signals EX1 and EX2, respectively, and
When the transformation table switching signal EX is set
to "1", in the above-mentioned two cases, (i.e. the case 35 reference numerals 215 and 216 denote output signals of the
where the transformation table switching signal EX indi EXOR elements 213 and 214, respectively. Reference
cates "0" and the LSB of Xh indicates "0" or "1"), the numerals 221 to 224 denote address exchangers having
control signal 107 for the address exchanger 108 and the functions shown in FIGS. 4A and 4.B. reference numerals
data exchanger 113 are inverted. Therefore, for the LUT 111, 241 to 244 are data exchangers having similar functions, and
only odd number addresses are given, and for the LUT 112, reference numerals 231 to 234 denote LUTs each of which
only even number addresses are given to perform the outputs the grid point data. Reference numerals 251 to 256
foregoing data transformation process. denote multipliers performing multiplication of the signals
(SECOND EMBODIMENT) output from the foregoing data exchangers, and output from
FIG. 5 is a block diagram showing a construction of a subtracters discussed later or the signals Xf and Yf, refer
second embodiment of a data transformation apparatus 45 ence numerals 261 and 262 denote a subtracter for subtract
according to the present invention. ing Xf, Yf from 24, reference numerals 271 to 273 denote
The difference of the shown embodiment with respect to adders, and a reference numeral 274 denotes a terminal for
the foregoing first embodiment is that a multiplying coeffi outputting the transformed data H3 (Xi, Yi).
cient exchanger 131 is employed in place of the data The address exchangers 221 to 224 and the data exchang
exchanger 113. ers 241 to 244 perform the operation shown in the foregoing
The multiplying coefficient exchanger 131 performs the FIGS. 4A and 4.B. The operation of the address exchangers
similar function to those of the address exchanger or the data 221 to 224 and the data exchangers are controlled by an
exchanger in the foregoing first embodiment. Therefore, the EXOR of the transformation table switching signals EX1,
multiplying coefficient exchanger 131 provides a coefficient EX2 and LSBs of the upper bit signals Xh and Yh,
Xf and (24-Xf) ito the multiplier 121 or the multiplier 122 55 respectively, namely the control signals 215 and 216.
in accordance with "0" or "1" indicated by the control signal At first, a discussion is given for the case where both of
107. By this, if the data exchanger 113 is removed in the the transformation table switching signals EX1 and EX2
foregoing first embodiment, it is possible to cause an offset indicate "0" and LSBs of both of the upper bit signals Xh
of correspondence between the multiplied value and the and Yh indicate "O" (At this time, signals Xh indicate even
multiplying value (multiplying coefficient). However, by numbers, respectively).
providing the multiplying coefficient exchanger 131, such In this case, since both of the control signals 215 and 216
offset is avoided to permit an identical data transformation as the outputs of the EXOR elements become "0", exchang
to the first embodiment. ing of signals (operation shown in FIG. 4B) in the address
(THIRD EMBODIMENT) exchangers 221 to 224 and the data exchangers 241 to 244
FIG. 6 is a block diagram showing a construction of a 65 is not performed. Accordingly the even number signals Xh
third embodiment of a data transformation apparatus accord and Yh input through the terminals 201 and 202 are coupled
ing to the present invention. into 8 bits and then applied to the LUT 231 as is. It should
 5,715,376
15
be noted that upon mutually coupling the upper bit signals
Xh and Yh, Xh may be either the upper or lower bits. In the
shown embodiment, it is assumed that Xh forms the upper
four bits and Yh forms the lower four bits.
On the other hand, an 8 bit signal derived by coupling
Xh-1 which is obtained by adding “1” to the upper bit signal
Xh by the adder 210, and Yh, is supplied to the LUT 232 as
is. On the other hand, an 8 bit signal derived by coupling
Yh-1 which is obtained by adding "1" to the upper bit signal
Yh by the adder 211, and Xh, is supplied to the LUT233 as
is. Furthermore, an 8 bit signal derived by coupling Xh-1
and Yh-1, is supplied to the LUT 234 as is. By this,
respective grid point data DCXh, Yh), D(Xh-1, Yh), D(Xh,
Yh-1) and DOXh--1, Yh--1) are read out from the LUTs 231
to 234 and fed to the multipliers 251 to 254, respectively.
The multipliers 251 and 253 receive an input of (2-Xf)
calculated by the subtracter 261 as a coefficient, to the
multipliers 252 and 254, Xf is input as a coefficient. Also, to
the multiplier 255, the signal of (2-Yf) calculated by the
subtracter 262 is input as a coefficient, and to the multiplier
256, the signal Yf is input as a coefficient. Accordingly, in
the multiplier 251. a calculation is performed for (2-Xf)
-D(Xh, Yh), in the multiplier 252, calculation is performed
for Xf-DOXh-1, Yh), in the multiplier 253, a calculation is
performed for (24-Xf)-D(Xh. Yh-1), in the multiplier 254,
a calculation is performed for Xf-DOXh+1, Yh-1). The
outputs of the multipliers 251 and 252 are added by an adder
271 and the outputs of the multipliers 253 and 254 are added
by an adder 272. The resultant sums of the adders 271 and
272 are respectively supplied to next multipliers 255 and
256. In the multiplier 255, a calculation of (24-Yf){(24
Xf)-DOXh, Yh)+Xf-DOXh+1, Yh)} is performed and in the
multiplier 256, a calculation of Yf{(24-Xf)-D(Xh, Yh-1)+
Xf-D(Xh-1, Yh-1)) are performed. The results are fed to an
adder 273 and added therein to be output from the terminal
274 with truncating or rounding the lower 8 bits. From the
above, the calculation according to the foregoing equation
(3) is performed.
It should be noted the 8 bit address after coupling to be
applied to each LUT consists of an upper 4 bits (Xh or Yh--1)
and a lower 4 bits (Yh or Yh-1). In the following discussion.
the state of the 8 bit address may be expressed in the manner
that when the upper 4 bits are an even number and the lower
4 bits are an odd number, the state is Even, Odd). Thus,
those states of input addresses of the LUTs 231 to 234 are
respectively Even, Even). Odd Even), Even, Odd and
Odd, Odd).
Next, discussion is given for the case, where only the LSB
of the upper bit signal Xh becomes "1" from the state set
forth above (at this time, the signal Xh indicates an odd
number and the signal Yh indicates an even number).
In this case, since the signal 215 becomes "1", the signal
exchanging (the operation shown in FIG. 4B) is performed
in the address exchangers 223 and 234 and the data
exchanger 241 and 242. In such case that exchanging of the
address signal is performed only in the address exchangers
223 and 224, among the coupled 8 bit signal, the 8 bit signal
having the even number lower 4 bit signal Yh is input to the
LUTs 231 or 232, and the 8 bit signal having the odd number
lower 4 bit signal Yh-1 derived by adding "1" to Yh is
supplied to the LUTs 233 or 234. On the other hand, in the
coupled 8 bit signal, the 8bit signal having the odd number
upper 4 bit signal Xh is exchanged by the address exchanger
223 of 224 and applied to the LUTs 232 or 234. The 8 bit
signal having the even number upper bit signal (Xh-1)
derived by adding "1" to the signal Xh by the adder 210 is
applied to the LUTs 231 or 233.
16
Depending upon the inputs of the foregoing address
signals, respective grid point data D(Xh-1, Yh), D(Xh, Yh),
DOXh--1, Yh--1) and DOXh, Yh--1) are read out from the
LUTs 231 to 234. These grid point data are exchanged by the
data exchanger 241 or 242 so that the data D(Xh-1, Yh) is
applied to the multiplier 252, the data D(Xh, Yh) is applied
to the multiplier 251, the data D(Xh-1, Yh-1) is applied to
the multiplier 254, and the data D(Xh, Yh-1) is applied to
the multiplier 253. The positional relationship between the
O grid point data input to respective multipliers is the same as
that where the LSB of the signal Xh is "0", therefore. The
subsequent process is the same as the foregoing case where
the LSB is from the signal Xh.
As is clear from the above, in the foregoing two cases (the
15 LSBs of the upper bit signal Xh is “0” or "1"), the address
state in respective ones of the LUTs 231 to 234 becomes
Even, Even, Odd Even, Even, Odd and Odd, Odd,
respectively. This address state is the same in the case where
the LSB of the signal Yh is "1" Therefore, the address state
is unchanged while the combination of the indications of the
switching control signals EX1 and EX2 is held unchanged.
Accordingly, in the foregoing transformation where the
control signals EX1 and EX2 are set at "0", respectively 4
regions of the respective LUTs are used. The remaining %
25 region is accessed by varying the combination of the control
signals EX1 and EX2. The following are the address states
given for the LUTs 231 to 234 depending upon combinations
of the control signals EX1 and EX2.
EX1=0, EX2=0 Even, Even), Odd, Even). Even, Odd,
30 Odd, Odd
EX1=1, EX2=0 Odd, Even). Even, Even), Odd, Odd,
Even, Odd
EX1=0, EX2=1 Even, Odd). Odd, Odd). Even, Even,
Odd, Even
35 EX1=1, EX2=1 Odd, Odd. Even, Odd), Odd. Even,
Even, Even
Thus, by storing independent transformation table data for
the regions to be accessed for respective combinations of the
values of signals EX1 and EX2 in respective ones of the
LUTs 231 to 234, four kinds of different data transformation
are realized. These different kinds of data transformation are
discussed in detail with respect to FIG. 16 and subsequent
drawings.
(FOURTHEMBODIMENT)
45 FIG. 7 is a block diagram showing a construction of the
fourth embodiment of a data transforming apparatus accord
ing to the present invention.
The difference between the shown embodiment of the
foregoing third embodiment is that a plurality of bit widths
SO of 4 inputs and one output selectors 301 to 308 are provided
in place of the address exchangers 221 to 224 and the data
exchangers 241 to 244.
Respective selectors are controlled by control signals 216
and 215. When the control signals 215 and 216 are "00".
55 inputais selected. When the control signals 215 and 216 are
"01", input b is selected. When the control signals 215 and
216 are "10", input c is selected. When the control signals
215 and 216 are "11", input d is selected. The input through
one of the inputs a to d is output through e output. For
example, when EX=1 and EX2=0, and upper bit signals Xh
and Yh both indicate even number (LSB is 0), input a is
selected. By this, for example, in the LUT 231, address of
Even. Even is accessed. Similarly, in the LUT 232, Odd,
Even); and in the LUT 234, Odd, Oddare accessed respec
65 tively.
As set forth above, the function of the four selectors 301
to 304 is substantially the same as that of the address