Monolithic optoelectronic integration of a GaAlAs laser, a field-effect transistor, and a photodiode

A low threshold buried heterostructure laser, a metal-semiconductor field-effect transistor, and a p-i-n photodiode have been integrated on a semi-insulating GaAs substrate. The circuit was operated as a rudimentary optical repeater. The gain bandwidth product of the repeater was measured to be 178 MHz

High-speed GaAlAs/GaAs p-i-n photodiode on a semi-insulating GaAs substrate

A high-speed, high-responsivity GaAlAs/GaAs p-i-n photodiode has been fabricated on a GaAs semi-insulating substrate. The 75-µm-diam photodiode has a 3-dB bandwidth of 2.5 GHz and responsivity of 0.45 A/W at 8400 Å (external quantum efficiency of 65%). The diode is suitable for monolithic integration with other optoelectronic devices

Gallium Aluminum Arsenide/Gallium Arsenide Integrated Optical Repeater

A low threshold buried heterostructure laser, a metal-semiconductor field effect transistor (MESFET), and a photodiode, have for the first time, been monolithically integrated on a semi-insulating GaAs substrate. This integrated optoelectronic circuit (IOEC) was operated as a rudimentary optical repeater. The incident optical signal is detected by the photodiode, amplified by the MESFET, and converted back to light by the laser. The gain bandwidth product of the repeater was measured to be 178 MHz

Sensing electric and magnetic fields with Bose-Einstein Condensates

We discuss the application of Bose-Einstein condensates (BECs) as sensors for magnetic and electric fields. In an experimental demonstration we have brought one-dimensional BECs close to micro-fabricated wires on an atom chip and thereby reached a sensitivity to potential variations of ~10e-14eV at 3 micron spatial resolution. We demonstrate the versatility of this sensor by measuring a two-dimensional magnetic field map 10 micron above a 100-micron-wide wire. We show how the transverse current-density component inside the wire can be reconstructed from such maps. The field sensitivity in dependence on the spatial resolution is discussed and further improvements utilizing Feshbach resonances are outlined.Comment: 4 pages, 3 figure

Quaternion normalization in additive EKF for spacecraft attitude determination

This work introduces, examines, and compares several quaternion normalization algorithms, which are shown to be an effective stage in the application of the additive extended Kalman filter (EKF) to spacecraft attitude determination, which is based on vector measurements. Two new normalization schemes are introduced. They are compared with one another and with the known brute force normalization scheme, and their efficiency is examined. Simulated satellite data are used to demonstrate the performance of all three schemes. A fourth scheme is suggested for future research. Although the schemes were tested for spacecraft attitude determination, the conclusions are general and hold for attitude determination of any three dimensional body when based on vector measurements, and use an additive EKF for estimation, and the quaternion for specifying the attitude

Fast Structuring of Radio Networks for Multi-Message Communications

We introduce collision free layerings as a powerful way to structure radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized distributed construction. We demonstrate their versatility by using them to provide near optimal distributed algorithms for several multi-message communication primitives. Designing efficient communication primitives for radio networks has a rich history that began 25 years ago when Bar-Yehuda et al. introduced fast randomized algorithms for broadcasting and for constructing BFS-trees. Their BFS-tree construction time was $O(D \log^2 n)$ rounds, where $D$ is the network diameter and $n$ is the number of nodes. Since then, the complexity of a broadcast has been resolved to be $T_{BC} = \Theta(D \log \frac{n}{D} + \log^2 n)$ rounds. On the other hand, BFS-trees have been used as a crucial building block for many communication primitives and their construction time remained a bottleneck for these primitives. We introduce collision free layerings that can be used in place of BFS-trees and we give a randomized construction of these layerings that runs in nearly broadcast time, that is, w.h.p. in $T_{Lay} = O(D \log \frac{n}{D} + \log^{2+\epsilon} n)$ rounds for any constant $\epsilon>0$. We then use these layerings to obtain: (1) A randomized algorithm for gathering $k$ messages running w.h.p. in $O(T_{Lay} + k)$ rounds. (2) A randomized $k$-message broadcast algorithm running w.h.p. in $O(T_{Lay} + k \log n)$ rounds. These algorithms are optimal up to the small difference in the additive poly-logarithmic term between $T_{BC}$ and $T_{Lay}$. Moreover, they imply the first optimal $O(n \log n)$ round randomized gossip algorithm