The nonlinear optical properties of organics with unsaturated bonds were compared with those of inorganics including semiconductors and dielectrics. Because of the mesomeric effect, namely quantum mechanical resonance effect among configurations, aromatic molecules and polymers have larger optical nonlinear parameters defined as δ(n)X(n)/(X(1))n both for the second (n2) and third-order (n3) nonlinearities. Experimental results of ultrafast nonlinear response of conjugated polymers, especially polydiacetylenes, were described and a model is proposed to explain the relaxation processes of photoexcitations in the conjugated polymers. Applying the model constructed on the basis of the extensive experimental study, we propose model polymers to obtain ultrafast resonant optical nonlinearity.
We study the depth of planar Boolean circuits. We show that planar Boolean circuits of depth D(n) are simulated by on-line Turing machines in space O(D(n)). From this relationship, it is shown that any planar circuit for computing integer multiplication requires linear depth. It is also shown that a planar analogue to the NC-hierarchy is properly separated.
Guoli YIN Xianglin YANG Mingde ZHANG
Based on the semiclassical theory, we deduce the expressions of stimulated absorption, stimulated amplification and threshold by using density matrix equation in the Er3+-doped fibers. Meaningful results have been given and some phenomena occuring in experiments are explained theoretically.
Kenichi KASAHARA Takahiro NUMAI Hideo KOSAKA Ichiro OGURA Kaori KURIHARA Mitsunori SUGIMOTO
The VSTEP concept and its practical application in the form of an LED-type pnpn-VSTEP demonstrating low power consumption through electro-photonic operational modes are both shown. Further, with focus primarily on the new laser-mode VSTEP with high-intensity light output and narrow optical beam divergence, the design features such as threshold gain and optical absorptivity, device fabrication, and characteristics are explained. The possibility of ultimate performance based mainly on electrical to optical power conversion efficiency, important from the application viewpoint of optical interconnection, are also discussed. Also, as two examples of functional optical interconnection achieved by VSTEP, serial-to-parallel data conversion and optical self-routing switches are shown. Finally, future opto-electronic technologies to be developed for two-dimensionally integrable surface-type optical semiconductor devices, including the VSTEP, are discussed.
Takashi EGAWA Takashi JIMBO Masayoshi UMENO
The heterointerfaces of Al0.3Ga0.7As/GaAs single quantum wells (SQWs) and the characteristics of SQW lasers grown on Si substrates with Al0.5Ga0.5As/Al0.55Ga0.45P intermediate layers (AlGaAs/AlGaP ILs) entirely by metalorganic chemical vapor deposition (MOCVD) are reported. The effects of thermal cycle annealing on the crystallinity and the lasing characteristics of GaAs/Si are also reported. By using the AlGaAs/AlGaP ILs, SQWs with a specular surface morphology and a smoother heterointerface can be grown on a Si substrate. Thermal cycle annealing is found to improve the crystallinity of GaAs/Si and to contribute to room-temperature continuous-wave operation of lasers on Si substrates. The combinations of the techniques of AlGaAs/AlGaP ILs and thermal cycle annealing improve the lasing characteristics: an average threshold current density of 1.83 kA/cm2, an average differential quantum efficiency of 52%, an internal quantum efficiency of 83%, an intrinsic mode loss coefficient of 23cm-1, a differential gain coefficient of 1.9cm/A, and a transparency current density of 266 A/cm2, which are superior to those of the two-step-grown laser on a Si substrate. The improvements of the lasing characteristics result from the smooth heterointerfaces of the AlGaAs/AlGaP ILs.
Noriya KOBAYASHI Masahiro ABE Toshinobu KASHIWABARA Sumio MASUDA
Suppose that there are terminals on two concentric circles Cin and Cout, with Cin inside of Cout. A set of two-terminal nets is given and the routing area is the annular region between the two circles. In this paper, we present an O(n2) time algorithm for testing whether the given net set is two-layer routable, where n is the number of nets. Applying this algorithm repeatedly, we can find, in O(n3) time, a maximal subset of nets which is two-layer routable.
Ichiro SETO Tomoaki OHTSUKI Hiroyuki YASHIMA Iwao SASASE Shinsaku MORI
We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoretically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.
This article briefly looks at the future of telecommunication education in the universities as it evolves from present concerns and trends. Five year bachelor's programs and top-down curricular design will be common. Textbooks supplemented by advance organizers, instruction and testing according to individual learning styles and global integration of education using multi-media services and broadband technology will be some of the other features. Finally, the importance of industry-university partnership in all aspects of engineering education is emphasized.
Kenichi KASAHARA Takahiro NUMAI Hideo KOSAKA Ichiro OGURA Kaori KURIHARA Mitsunori SUGIMOTO
The VSTEP concept and its practical application in the form of an LED-type pnpn-VSTEP demonstrating low power consumption through electro-photonic operational modes are both shown. Further, with focus primarily on the new laser-mode VSTEP with high-intensity light output and narrow optical beam divergence, the design features such as threshold gain and optical absorptivity, device fabrication, and characteristics are explained. The possibility of ultimate performance based mainly on electrical to optical power conversion efficiency, important from the application viewpoint of optical interconnection, are also discussed. Also, as two examples of functional optical interconnection achieved by VSTEP, serial-to-parallel data conversion and optical self-routing switches are shown. Finally, future opto-electronic technologies to be developed for two-dimensionally integrable surface-type optical semiconductor devices, including the VSTEP, are discussed.
There have been several studies related to a reduction of the amount of computational resources used by Turing machines. As consequences, Linear speed-up theorem", tape compression theorem" and reversal reduction theorem" have been obtained. In this paper, we discuss a leaf reduction theorem on alternating Turing machines. Recently, the result that one can reduce the number of leaves by a constant factor without increasing the space complexity was shown for space- and leaf-bounded alternating Turing machines. We show that for time- and leaf-bounded alternating Turing machines, the number of leaves can be reduced by a constant factor without increasing time used by the machine. Therefore, our result says that a constant factor on the leaf complexity does not affect the power of time- and leaf-bounded alternating Turing machines.
Yasuhiko TAKENAGA Shuzo YAJIMA
By adding some functions to memories, highly parallel computation may be realized. We have proposed memory-based parallel computation models, which uses a new functional memory as a SIMD type parallel computation engine. In this paper, we consider models with communication between the words of the functional memory. The memory-based parallel computation model consists of a random access machine and a functional memory. On the functional memory, it is possible to access multiple words in parallel according to the partial match with their memory addresses. The cube-FRAM model, which we propose in this paper, has a hypercube network on the functional memory. We prove that PSPACE is accelerated to polynomial time on the model. We think that the operations on each word of the functional memory are, in a sense, the essential ones for SIMD type parallel computation to realize the computational power.
Circuit complexity of a Boolean function is defined to be the minimum number of gates in circuits computing the function. In general, the circuit complexity is established by deriving two types of bounds on the complexity. On one hand, an upper bound is derived by showing a circuit, of the size given by the bound, to compute a function. On the other hand, a lower bound is established by proving that a function can not be computed by any circuit of the size. There has been much success in obtaining good upper bounds, while in spite of much efforts few progress has been made toward establishing strong lower bounds. In this paper, after surveying general results concerning circuit complexity for Boolean functions, we explain recent results about lower bounds, focusing on the method of approximation.
Yoshihide IGARASHI Kumiko KANAI Kinya MIURA Shingo OSAWA
We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t1 and t2 any of these schemes can broadcast information within any consecutive logt+1N2 rounds, and for an arbitrary t they can broadcast information within any consecutive logt+1N3 rounds.
The semantics of a language for communicating processes is investigated, and three full abstractness results for are established. The language contains atomic actions, termination, inaction, sequential composition, alternative composition, parallel composition, action restriction, and a form of guarded recursion. (The guardedness restriction on recursion is needed to establish one of the full abstractness results.) Three Plotkin-style operational semantics
Yuichi KAJI Ryuichi NAKANISI Hiroyuki SEKI Tadao KASAMI
Multiple context-free grammars (mcfg's) are a subclass of generalized context-free grammars introduced by Pollard in order to describe the syntax of natural languages. First, this paper shows that the universal recognition problem for mcfg's is EXP-POLY time-complete, where the universal recognition problem is the one to decide whether G generates w for a given grammar G and string w. Next, it is shown that the problem for linear context-free rewriting systems introduced by Vijay-Shanker et al., which is a proper subclass of mcfg's, is PSPACE-complete.
A maximal l-diameter tree cover of a graph G(V,E) is a spanning subgraph C(V,EC) of G such that each connected component of C is a tree, C contains no path with more than l edges, and adding any edge in EEC to C yields either a path of length l1 or a cycle. For every function f from positive integers to positive integers, the maximal f-diameter tree cover prolem (MDTC(f) problem for short) is to find a maximal f(n)-diameter tree cover of G, given an n-node graph G. In this paper, we give two parallel algorithms for the MDTC(f) problem. The first algorithm can be implemented in time O(TMSP(n,f(n))log2n) using polynomial number of processors on an EREW PRAM, where TMSP(n,f(n) is the time needed to find a maximal set of vertex disjoint paths of length f(n) in a given n-node graph using polynomial number of processors on an EREW PRAM. We then show that if suitable restrictions are imposed on the input graph and/or on the magnitude of f, then TMSP(n,f(n))O(logkn) for some constant k and thus, for such cases, we obtain an NC algorithm for the MDTC(f) problem. The second algorithm runs in time O(n log2n/{f(n)1}) using polynomial number of processors on an EREW PRAM. Thus if f(n)Ω(n/logkn) for some kO, we obtain an NC algorithm for the MDTC(f) problem.
Tomoaki OHTSUKI Hiroyuki YASHIMA Iwao SASASE Shinsaku MORI
We propose parallel rate-variable punctured convolutional coded PPM in photon communication to achieve high energy information efficiency Ie for desired bit error rate (BER) and transmission bandwidth. We theoretically show the BER performance, bandwidth expansion factor β and necessary Ie to achieve BER=10-6 of the proposed systems for some combinations of code rates. It is found that the proposed system can achieve high Ie for desired BER and β by selecting a suitable combination of code rates depending on the channel conditions. Moreover, it is shown that the proposed system has better BER performance than RS-coded PPM in the range of small β.
The nonlinear optical properties of organics with unsaturated bonds were compared with those of inorganics including semiconductors and dielectrics. Because of the mesomeric effect, namely quantum mechanical resonance effect among configurations, aromatic molecules and polymers have larger optical nonlinear parameters defined as δ(n)=X(n)/(X(l))n both for the second (n=2) and third-order (n=3) nonlinearities. Experimental results of ultrafast nonlinear response of conjugated polymers, especially polydiacetylenes, were described and a model is proposed to explain the relaxation processes of photoexcitations in the conjugated polymers. Applying the model constructed on the basis of the extensive experimental study, we propose model polymers to obtain ultrafast resonant optical nonlinearity.
Tomoaki OHTSUKI Hiroyuki YASHIMA Iwao SASASE Shinsaku MORI
We propose parallel rate-variable punctured convolutional coded PPM in photon communication to achieve high energy information efficiency Ie for desired bit error rate (BER) and transmission bandwidth. We theoretically show the BER performance, bandwidth expansion factor β and necessary Ie to achieve BER10-6 of the proposed systems for some combinations of code rates. It is found that the proposed system can achieve high Ie for desired BER and β by selecting a suitable combination of code rates depending on the channel conditions. Moreover, it is showm that the proposed system has better BER performance than RS-coded PPM in the range of small β.
Ichiro SETO Tomoaki OHTSUKI Hiroyuki YASHIMA Iwao SASASE Shinsaku MORI
We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoreically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.