会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明专利
    • DE1549508C3
    • 1973-09-20
    • DE1549508
    • 1967-06-07
    • NORTH AMERICAN AVIATION INC., EL SEGUNDO, CALIF. (V.ST.A.)
    • BOOHER, ROBERT KENNETH, DOWNEY, CALIF. (V.ST.A.)
    • G06F7/50G06F7/506
    • 1,164,010. Arithmetic carry and borrow means. NORTH AMERICAN AVIATION Inc. 1 March, 1967 [7 June, 1966], No. 9740/67. Heading G4A. Carry or borrow information in an arithmetic operation is produced by logic groups each comprising at least two logic orders representing consecutive operand bit positions, alternate groups producing the information in true form and the other groups producing it in inverse form, the information being produced from the last logic order in each group without incurring bit time delays in propagating through preceding orders in the group. Fig. 1 shows carry generation for a parallel adder, the addend and augend being A, M. The gates shown are NAND gates, and junctions between gate outputs perform an ANDing function. The carries from two successive orders are generated simultaneously, both being in true form in even-numbered pairs of orders and both being in inverse form in odd-numbered pairs of orders. The Figure is self-explanatory, it being noted that the carry C o into the carry generating means 20 for orders 1 and 2, for example, is applied directly to gating means 20a, 20b relating to each of the orders, and the gating means for order 2 receives directly the addend and augend bits for order 1 as well as those for order 2. The adder with carry means may be converted into a subtractor with borrow means by reversing the connections from the augend (now minuend) register. NAND gates may be provided to allow the connections to be made in either way selectively. NOR gates may replace the NAND gates. Use in multiplication and division is mentioned.
    • 9. 发明专利
    • DE1462855B2
    • 1974-01-10
    • DEN0029285
    • 1966-10-05
    • NORTH AMERICAN AVIATION, INC., EL SEGUNDO, CALIF. (V.ST.A.)
    • BOOHER, ROBERT KENNETH, DOWNEY, CALIF. (V.ST.A.)
    • G11C19/28H01L21/822H01L27/04H03K19/096H03K19/08
    • 1,130,055. Shift registers. NORTH AMERICAN AVIATION Inc. 25 July, 1966 [28 Jan., 1966], No. 33383/66. Heading G4C. [Also in Divisions H1 and H3] A switching circuit suitable for use in a logic circuit or shift register comprises a capacitor, means for charging it during first recurrent intervals of time and means for discharging it or not depending upon the state of an information input during second recurrent intervals whereby the state of the capacitor represents the information input. In Fig. 2 a clock pulse of phase # 1 is applied to the gate of charging and isolating transistors 21-28 to charge to a voltage -V the output capacitance and the capacitance of the transistors in logic circuit 30. A subsequent clock pulse of phase # 2 renders transistor 28 again conductive so that capacitor 20 is discharged or left charged depending on the state of the logic circuit 30. The - V supply may be a - 20 V. pulse of phase # 1 and the connection to earth may be replaced by a pulse source having a zero value in phase period # 2 . In Fig. 1, 28 and 29 are replaced by a series parallel field effect transistor logic circuit (10) connected to earth through an isolating transistor (14) receiving # 2 pulses at its gate, and the upper transistor (8) of the logic circuit may be a further isolating transistor receiving 91 and # 2 pulses at its gate. In Figs. 3 and 4 (not shown) the isolating transistor 28 is replaced by one or by two in parallel controlled by # 1 and # 2 pulses and connected in series with the output lead (transistors 35 or 44 and 45). In Fig. 5 (not shown) transistor 28 is replaced by parallel transistors receiving respectively the two phases of clock pulse. A shift register may be formed from cascaded stages, adjacent-stages receiving pulses of # 1 , # 2 and # 3 , # 4 respectively in the order # 1 , # 2 , # 3 , # 4 and an integrated form of such a register using stages similar to .Fig. 2 is described (Fig. 5, not shown).