Multiterminal light-emitting logic device electricallyreprogrammable between OR and NAND functions

A monolithic multiterminal logic device that functions both optically and electrically as an ORNAND gate, is demonstrated for the first time. The device, based on the real-space transfer of hot electrons into a complementary collector layer, has been implemented in an InGaAs/InAlAs/InGaAs heterostructure grown by molecular beam epitaxy. Excellent performance is obtained at room temperature. The collector current and the optical output power both exhibit the OR and the NAND functions of any two of the three input terminals, these functions being interchangeable by the voltage on the third terminal     

Enhanced electron emission from phosphorus-doped diamond-cladsilicon field emitter arrays

Undoped and phosphorus (P)-doped diamond-clad Si field emitter arrays have been successfully fabricated using microwave plasma chemical vapor deposition (MPCVD) technology. The electron emission from the blunt diamond-clad microtips are much higher than those for the pure Si tips with sharp curvature due to a lower work function. Furthermore, the characteristics of emission current against applied voltage for the P-doped diamond-clad tips show superior emission at lower field to the undoped ones. After the examination of Auger electron spectroscopy (AES) and electrical characteristics of as-grown diamond, such a significant enhancement of the electron emission from the P-doped diamond-clad tips is attributed to a higher electron conductivity and defect densities     

Wideband HEMT MMIC low-noise amplifier with temperaturecompensation

A wideband low-noise pseudomorphic HEMT MMIC variable-gain amplifier has been designed and fabricated. The amplifier has a nominal gain of 13 dB across the band 2-20 GHz, with gain flatness better than ±0.4 dB. The noise figure is less than 3 dB across the band 6-16 GHz. An on-chip temperature-sensing diode is used to provide a linear temperature correction which has been used to reduce the gain variation of the amplifier by a factor of 2 across the temperature range -50°C to +95°C     

A prototype 3D optically interconnected neural network

We report the implementation of a prototype three-dimensional (3D) optoelectronic neural network that combines free-space optical interconnects with silicon-VLSI-based optoelectronic circuits. The prototype system consists of a 16-node input, 4-neuron hidden, and a single-neuron output layer, where the denser input-to-hidden-layer connections are optical. The input layer uses PLZT light modulators to generate optical outputs which are distributed over an optoelectronic neural network chip through space-invariant holographic optical interconnects. Optical interconnections provide negligible fan-out delay and allow compact, purely on-chip electronic H-tree type fan-in structure. The small prototype system achieves a measured 8-bit electronic fan-in precision and a calculated maximum speed of 640 million interconnections per second. The system was tested using synaptic weights learned off system and was shown to distinguish any vertical line from any horizontal one in an image of 4×4 pixels. New, more efficient light detector and small-area analog synapse circuits and denser optoelectronic neuron layouts are proposed to scale up the system. A high-speed, feed-forward optoelectronic synapse implementation density of up to 10⁴/cm² seems feasible using new synapse design. A scaling analysis of the system shows that the optically interconnected neural network implementation can provide higher fan-in speed and lower power consumption characteristics than a purely electronic, crossbar-based neural network implementation     

The information-theoretic capacity of discrete-time queues

The information-theoretic capacity of continuous-time queues was analyzed recently by Anantharam and Verdu (see ibid. vol.42, p.4-18, 1996). Along similar lines, we analyze the information-theoretic capacity of two models of discrete-time queues. The first model has single packet arrivals and departures in a time slot and independent packet service times, and is the discrete-time analog of the continuous-time model analyzed by Anantharam and Verdu. We show that in this model, the geometric service time distribution plays a role analogous to that of the exponential distribution in continuous-time queues, in that, among all queues in this model with a given mean service time, the queue with geometric service time distribution has the least capacity. The second model allows multiple arrivals in each slot, and the queue is modeled as serving an independent random number of packets in each slot. We obtain upper and lower bounds on the capacity of queues with an arbitrary service distribution within this model, and show that the bounds coincide in the case of the queue that serves a geometrically distributed number of packets in each slot. We also discuss the extremal nature of the geometric service distribution within this model     

Multi-emitter Si/GexSi1-x heterojunctionbipolar transistor with no base contact and enhanced logic functionality

We demonstrate multi-emitter Si/Ge_xSi_1-x n-p-n heterojunction bipolar transistors (HBT's) which require no base contact for transistor operation. The base current is supplied by the additional emitter contact under reverse bias due to the heavy doping of the emitter-base junction. Large-area HBT test structures exhibit good transistor characteristics, with current gain β≈400 regardless of whether the base current is supplied by a test base electrode or one of the emitter contacts. These devices have enhanced logic functionality because of emitter contact symmetry. Since device fabrication does not require base electrode formation, the number of processing steps can be reduced without significant penalty to HBT performance     

On the automorphism group of various Goppa codes

We determine the automorphism group of various Goppa codes 𝒞 _L(D,G) associated with certain function fields F/F _q of genus g>0. It is well known that, for deg D=n>2g+2, the automorphism group {Aut_D,G(F/F_q) can be embedded into Aut(𝒞_L(D,G)) as a subgroup. We show that, under certain conditions on the divisors D and G Aut_D,G(F/F_q ) is actually isomorphic to Aut(𝒞_L(D,G))     

Modulation characteristic of waveguide-type optical frequency combgenerator

We report the modulation characteristics of a waveguide-type optical frequency comb generator (WG-OFCG) with the advantages of compactness, high modulation index and low driving power. The characteristics of the optical frequency comb (OFC) generated when the modulation index exceeds 2π are discussed. The power of the modulation sidebands was measured by the optical heterodyne method with an external-cavity laser as a local oscillator. The dependence of the modulation index of the WG-OFCG on the modulation frequency up to 40 GHz was measured. The generation span of the OFC at the modulation frequency detuned from an integer multiple of the free spectral range (FSR) is discussed     

Simplified modeling of transients in gain-clamped erbium-dopedfiber amplifiers

A simple technique for modeling transients in erbium-doped fiber amplifiers (EDFAs) has been applied to a gain-clamped amplifier. Integration of the variables along the length of the amplifier allows the formulation of the problem as a single simple, ordinary, time-dependent differential equation. We demonstrate examples for a typical conventional EDFA and one in which internal out-of-band oscillation is used to clamp the gain     

Evaluation of multicast routing algorithms for real-timecommunication on high-speed networks

Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. Simulations also reveal that one of the unconstrained algorithms, reverse path multicasting (RPM), is quite inefficient when applied to asymmetric networks. We study how combining routing with resource reservation and admission control improves the RPM's efficiency in managing the network resources. The performance of one semiconstrained heuristic, MSC, three constrained Steiner tree (CST) heuristics, Kompella, Pasquale, and Polyzos (1992), constrained adaptive ordering (CAO), and bounded shortest multicast algorithm (BSMA), and one constrained shortest path tree (CSPT) heuristic, the constrained Dijkstra heuristic (CDKS) are also studied. Simulations show that the semiconstrained and constrained heuristics are capable of successfully constructing MC trees which satisfy the QoS requirements of real-time traffic. However, the cost performance of the heuristics varies. The BSMA's MC trees are lower in cost than all other constrained heuristics. Finally, we compare the execution times of all algorithms, unconstrained, semiconstrained, and constrained