-
Nobukazu Teranishi, Kazuya Yonemoto, Shoji Kawahito, Hiromasa Funakosh ...
2000 Volume 54 Issue 7 Pages
912-919
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Hiroshi Murakami, Haruhiko Okumura, Shinichi Komura, Hisao Nakanishi, ...
2000 Volume 54 Issue 7 Pages
920-928
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Junji Numazawa, Hiroaki Muraoka, Yoshihiro Okamoto, Haruo Okuda, Yoich ...
2000 Volume 54 Issue 7 Pages
929-937
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Susumu Ikeda, Kenji Tsunashima, Hideyuki Naka, Susumu Tsuchida, Katsuy ...
2000 Volume 54 Issue 7 Pages
938-947
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Broadcasting Systems
Yoshimichi Ohtsuka
2000 Volume 54 Issue 7 Pages
948-957
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
Mitsuhiro Sakakibara, Takenori Inoue, Toshi Muramatsu, Tsuneo Sasaki, ...
2000 Volume 54 Issue 7 Pages
958-966
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Koichi Ito, Takao Kato, Toru Sato, Yasunori Murakami, Mikio Maeda
2000 Volume 54 Issue 7 Pages
967-973
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Yuzo Hirai, Tsutomu Horikoshi, Yuichiro Kume, Nobuyuki Hiruma, Kazuho ...
2000 Volume 54 Issue 7 Pages
974-983
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Multimedia Information Processing
Masao Kasuga, Yuko Yamanouchi, Akio Okazaki, Kazuya Takeda, Shinji Hay ...
2000 Volume 54 Issue 7 Pages
984-994
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
Koki Sato
2000 Volume 54 Issue 7 Pages
995-997
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
Yoshinobu Tonomura, Yasuhiro Takishima, Satoshi Hayama, Yohichi Takash ...
2000 Volume 54 Issue 7 Pages
998-1004
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Sakuichi Ohtsuka, Tomoharu Nagao, Keiji Nemoto, Shinichi Miyamoto, Sat ...
2000 Volume 54 Issue 7 Pages
1005-1011
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Kazumi Komiya, Nobukazu Teranishi, Mitsuhiro Kurashige, Kazutake Uehir ...
2000 Volume 54 Issue 7 Pages
1012-1015
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Kotaro Wakui, Hiroshi Takao, Haruo Okuda, Hisashige Fujiwara
2000 Volume 54 Issue 7 Pages
1016-1019
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
Toshihiro Tashima
2000 Volume 54 Issue 7 Pages
1020-1024
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
International Standardization for Image Evaluation
Junji Kumada, Yukihiro Nishida, Kaoru Watanabe, Hiroaki Ikegami, Makot ...
2000 Volume 54 Issue 7 Pages
1025-1032
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Kazuhiro Nakajima
2000 Volume 54 Issue 7 Pages
1033-1034
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
Akio Yasuda
2000 Volume 54 Issue 7 Pages
1035-1036
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
-
Kohe Tokoi, Tadahiro Kitahashi
2000 Volume 54 Issue 7 Pages
1061-1068
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
In the hidden-surface removal procedure, a one-dimensional Boolean operation in the depth direction is used to find a visible surface of the shape defined by the constructive solid geometry (CSG) instead of a depth comparison. The Boolean operation, however, refers to the definition many times while generating the image, so it takes much time to complete.
We have used the spanning scanline algorithm to display the shape of the Boolean combined primitives of the polyhedra. It describes the Boolean combination by using the pattern matrix and speeds up the one-dimensional Boolean operation by using incremental calculation. The number of Boolean operation executions is drastically reduced by using the connection information at the adjoining facets. This results in a robust and high-speed CSG display algorithm that can be used for interactive applications.
View full abstract
-
Nobuyuki Miki, Makoto Kitazawa
2000 Volume 54 Issue 7 Pages
1069-1078
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
When an orthogonal frequency division multiplexing (OFDM) signal passes through a non-linear power amplifier, inter-modulation (IM) occurs. Third distortion components of the IM exist in the OFDM band, degrading the bit error rate (BER). Because the in-band IM cannot be measured directly, this phenomenon has not been analyzed thoroughly. The TM is introduced into the OFDM by the non-linearity of the transmission equipment. It changes the C/N of each carrier, leading to variations in their BERs. The overall BER of the OFDM signal is calculated by adding and averaging the carrier BERs. Using mathematical representations of the above, we have theoretically and experimentally shown that the equivalent C/N degradation due to IM from the reference C/N (22 dB), where the BER of error correction-free 64 QAM-OFDM is 9.7 × 10
-3, can be obtained directly by measuring the IM near the OFDM band, without measuring the carrier BERs.
View full abstract
-
Akiomi Kunisa
2000 Volume 54 Issue 7 Pages
1079-1088
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
The guided scrambling (GS) coding technique is used to control the runlength within code blocks, such as d or k, as well as to suppress the DC component. It achieves a code rate very close to the channel capacity. In a GS encoder, a selection set of channel bit streams is constructed by subjecting a source bit stream to several kinds of scramblings and to runlength limited (RLL) coding if necessary. Then one that satisfies the imposed channel constraints best is selected. Typically, the GS technique uses a convolutional operation or an addition operation in the Galois field (GF); these two schemes can generate channel bit streams that meet the channel constraints better than conventional coding techniques. The latter scheme is better in terms of symbol-error probability when both schemes are concatenated with Reed-Solomon (RS) codes. However, nothing is known about the hardware complexity of either scheme. We describe their hardware configurations using ROM tables and compare the table sizes. From this comparison, we conclude that the hardware complexity of the latter scheme is smaller under certain conditions.
View full abstract
-
Takanori Arano, Takayuki Kimura, Noboru Takatsuka, Hiromitsu Shiraki
2000 Volume 54 Issue 7 Pages
1089-1096
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS
The saturation signal fluctuation that appears on the reproduced images of interline CCD image sensors with a vertical overflow drain is caused by fluctuations in the substrate impurity concentration. Besides such fluctuation, nonuniformity in the saturation level, i.e., bright and dark spots, is generated on CCD chips and wafers. These spots severely degrade image quality. We clarified the origin of the non-uniformity mainly by comparing images obtained at the saturation signal level with those obtained by electron injection from the substrate. We calculated the readout currents for both types of images for photo-diodes having various impurity concentration profiles. From these experimental and calculated results, we concluded that the bright and dark spots are caused by potential profile differences among photo-diodes, brought about by a slight variation in the impurity concentration in the diodes. We also suggest that the origin of the impurity variation is introduced by the dislocations formed during device fabrication.
View full abstract
-
Mamoru Douke, Masaki Hayashi, Eiji Makino
2000 Volume 54 Issue 7 Pages
1097-1103
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
Research into “content handling techniques”, that is, automatic computer-based methods of generating and processing content is becoming increasingly important.We have developed the TV program Making Language (TVML) to enable such content handling techniques, and mainly for use in the television program production field.
In this paper, we explain a method for the automatic production of programs by using TVML.We have developed a method for using XML to describe the details of programs.We have also designed a model for the automatic production of programs which is based on current production processes used for TV programs.We then combined method and model in a prototype software application, in which a user is simply required to input program data to automatically generate news programs.
View full abstract
-
Ken-ichi Tanaka
2000 Volume 54 Issue 7 Pages
1104-1106
Published: July 20, 2000
Released on J-STAGE: August 17, 2011
JOURNAL
FREE ACCESS
-
Hiroyuki Hase, Masaaki Yoneda, Mitsuru Sakai, Hiroshi Maruyama, Jien K ...
2000 Volume 54 Issue 7 Pages
1107-1110
Published: July 20, 2000
Released on J-STAGE: March 14, 2011
JOURNAL
FREE ACCESS