Features UART SPI I2C Full Form Universal Asynchronous Receiver/Transmitter Serial Peripheral Interface Inter-Integrated Circuit Interface Diagram Pin Designations TxD: Transmit Data RxD: Receive Data SCLK: Serial Clock MOSI: Master Output, Slave Input MISO: Master Input, Slave Output SS: Slave Select SDA: Serial Data SCL: Serial Clock Data rate As this is is asynchronous communication, data rate between two devices wanting to communicate should be set to equal value. Maximum data rate supported is about 230 Kbps to 460kbps. Maximum data rate limit is not specified in SPI interface. Usually supports about 10 Mbps to 20 Mbps I2C supports 100 kbps, 400 kbps, 3.4 Mbps. Some variants also supports 10 Kbps and 1 Mbps. Distance Lower about 50 feet highest Higher Type of communication Asynchronous Synchronous Synchronous Number of masters Not Application One One or more than One Clock No Common Clock signal is used. Both the devices will use there independent clocks. There is ...
This is a band pass filter In band stop filter C2 is connected in between R1 and C1 (Requires inverting input) Low pass filter High Pass filter (LPF and HPF requires differential input) differentiation and integrator ADDER Subtractor (for integrator, differentiator,adder,subtractor requires inverting input) Diode logic Resistor transistor logic: dissipates more power 1}DCTL(direct coupled transistor logic):it is used for to save space 2}Resistor capacitor transistor logic:input resistor are parallel with capacitors Emitter coupled Logic: it uses NPN transistor in differential amplifier range of input voltages are used so BJT will not goes into saturation region it is due to very high switching speed also called common mode logic or current switch emmiter follower CMOS: it utilize power during transition in logic so it uses very less power Power Scale::P=@cv^2.....@ is activity factor CMOS have speed limitation due to in...
Data structures through C lang. Data structure is a way to store and organize the data in computer so that it can used efficientaly data structure have two type 1) abstract data type(ADT)(mathematical and logical data type) 2) implementation data type list abstract data type is not memory efficient in terms of inserting and removing the data from an array here time require is (T dirc.n) where n is the number element in an array that is if we are using just array for storing the data then at the time of inserting the new data into an array then array will shift a whole bytes from array in Linked list node are available node=int value + add. of next node Θ ---------------------------------------------------------------------------- # Algorithms & Data Structures: Q. What is data structure? - it is a way to store data into the memory(main memory) in an oraganized manner so that we can perform operations on it efficiently. ...
Comments
Post a Comment