Skip to main content

Design of CMOS XOR/XNOR Gates


Design of CMOS XOR/XNOR Gates

The semiconductor industry has experienced rapid integration of multimedia applications into mobile electronics, leading to very high integration density in CMOS VLSI. As operating frequencies increase, power consumption, speed, silicon area, and reliability become critical considerations.

The XOR-XNOR circuits are fundamental building blocks in arithmetic circuits (Full Adders, Multipliers), compressors, comparators, parity checkers, code converters, error-detecting/correcting codes, and phase detectors. Their performance directly impacts the complex circuits they are used in. Design goals include full output voltage swing, low power consumption, reduced transistor count, minimal delay, and simultaneous non-skewed outputs.

Static Logic (Static CMOS)

Static CMOS gates always provide a mechanism to drive outputs high or low.

  • Pull-Up Network (PUN): Connects output to VDD when output = 1.
  • Pull-Down Network (PDN): Connects output to VSS when output = 0.

The PUN and PDN are mutually exclusive; only one conducts at a time.

Complementary logic gate showing pull-up and pull-down networks
Fig.1: Complementary logic gate using PUN & PDN

Dynamic Logic

Dynamic logic uses a clock signal for combinational logic. It requires a minimum clock rate to ensure outputs are used before leakage. The PDN is similar to static CMOS. Operation occurs in two phases:

  • Pre-charge (CLK=0): The output is charged to VDD via the PMOS transistor; the PDN is off.
  • Evaluation (CLK=1): The PMOS pre-charge transistor turns off, the NMOS evaluation transistor turns on. The output discharges conditionally based on inputs.
Dynamic logic gate operation showing pre-charge and evaluation phases
Fig.2: Dynamic gate operation (Pre-charge/Evaluation)

CMOS XOR & XNOR Gates

Static CMOS XOR/XNOR circuits use complementary PUN and PDN networks. They provide full output swing but require more transistors.

Logic expressions:

Z = A ⊕ B = (A + B)(A′ + B′)
Z′ = (A ⊕ B)′ = AB + A′B′
Z = (AB + A′B′)′ = A ⊕ B

Alternative realization of XOR/XNOR using CMOS is shown below:

Basic CMOS implementation of XOR and XNOR gates
Fig.3: XOR (a) & XNOR (b) gates using CMOS
Combined CMOS circuit implementing XOR and XNOR
Fig.4: Implementation of XOR & XNOR in one circuit
XNOR circuit diagram along with truth table
Fig.5: XNOR Circuit & Truth Table
XOR circuit diagram along with truth table
Fig.6: XOR Circuit & Truth Table

Circuit Simulation / Block Diagram

Transient response simulation of XOR XNOR circuit in S-Edit
Fig.7: XOR/XNOR Circuit using S-Edit (Transient Response)
Master cell design of XOR XNOR circuit using S-Edit
Fig.8: Master Cell XOR/XNOR using S-Edit

Programming (SPICE Command)

SPICE code is extracted using T-Edit.

Graphs (W-Edit)

Simulate the schematic and generate waveforms corresponding to inputs using W-Edit.

Conclusions

In this experiment, the transient response of CMOS XOR/XNOR gates was studied. Waveforms were obtained using W-Edit, and SPICE code was extracted using T-Edit. The experiment demonstrates the design and analysis of XOR/XNOR gates in CMOS technology.



Contact Us

Name

Email *

Message *

Popular Posts

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform Main Page →

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2πf & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac):