Skip to content

Bilinear Transform

A fractional-linear substitution mapping the continuous-time complex frequency plane to the discrete-time z-plane, carrying the stable left half-plane inside the unit circle while warping frequencies.

Version
v2 · 2026-09-06 · History
Domain-specific #
1379
Origin domain
signal processing
Subdomain
analog-to-digital system transformation
Aliases
Tustin transform, Tustin's method

Core Idea

Bilinear Transform is a fractional-linear substitution mapping the continuous-time complex frequency plane to the discrete-time z-plane, carrying the stable left half-plane inside the unit circle while warping frequencies. [1]

Substitute s=(2/T)(1-z-1)/(1+z-1), equivalently z=(1+sT/2)/(1-sT/2), into a continuous-time transfer function. This Möbius map sends the open left half of the s-plane to the interior of the z-plane unit circle, so stable analog poles map to stable digital poles. The imaginary axis maps one-to-one to the unit circle except at the endpoint, but analog frequency Omega and digital frequency omega satisfy the nonlinear warping Omega=(2/T)tan(omega/2).

The operative boundary is exact: The stable analog-to-digital transfer-function substitution with explicit frequency warping remains uncovered. The abstraction is therefore not the topic named by its field, but the reusable role structure specified below.

Structural Signature

Sig role-phrases:

  • the analog transfer function H_a(s) — the continuous-time system to be transformed
  • the sampling interval T — the scale connecting analog and digital frequency
  • the fractional-linear substitution — the s–z Möbius map
  • the left-half-plane mapping — continuous-time stability region
  • the unit-disk mapping — discrete-time stability region
  • the frequency warping — nonlinear map between imaginary-axis and unit-circle frequencies
  • the prewarping step — choice of analog critical frequencies to hit desired digital frequencies
  • the transformed rational function H_d(z) — the implementable discrete-time filter
  • the no-aliasing property — one-to-one frequency mapping that compresses the infinite analog axis

Recognition test. A case qualifies only when its roles can be mapped to the declared the analog transfer function H_a(s), the sampling interval T, the fractional-linear substitution, the left-half-plane mapping, and when the characteristic boundary conditions are preserved. Surface vocabulary or a loose analogy is insufficient.

What It Is Not

  • Not a bilinear form. The signal-processing name denotes a fractional-linear transform.
  • Not an ordinary linear map. The substitution is rational in s and z.
  • Not impulse invariance. It maps transfer functions differently and does not replicate sampled impulse responses.
  • Not frequency preserving. Frequency warping is unavoidable except at chosen prewarped points.
  • Not a discretization with no design choices. Sampling interval and prewarping determine the result.
  • Not a guarantee of good numerical implementation. Coefficient scaling and filter structure still affect finite-precision behavior.

Scope of Application

The abstraction has a bounded but recurring habitat. These are literal applications of the same domain machinery, not cross-domain metaphors. [1]

  • IIR digital-filter design. analog prototypes are mapped into stable digital filters.
  • Digital control. continuous compensators are discretized with the Tustin substitution.
  • Frequency prewarping. critical edges are adjusted before analog prototype design.
  • Low-pass and transformed prototypes. Butterworth, Chebyshev, and elliptic designs commonly use the map.
  • Numerical integration interpretation. the trapezoidal rule yields the same operator substitution.
  • System conversion tools. software maps poles, zeros, and gains while documenting sampling scale.

Clarity

The map preserves stability regions, not numerical frequencies. If a desired digital cutoff is omega_c, design the analog prototype cutoff at Omega_c=(2/T)tan(omega_c/2) before substitution. Omitting T or mixing radians per second with normalized radians per sample invalidates the mapping.

A useful audit proceeds in order: identify the candidate roles, verify their types and quantifiers, apply the recognition test, and then test every stated exclusion. If a case supplies only the broad parent pattern while dropping the domain accent, it is not Bilinear Transform.

Manages Complexity

The transform reuses mature analog prototype theory while providing an exact algebraic stability map. It turns differential transfer functions into rational difference equations and isolates the main distortion—frequency warping—so it can be compensated at selected design points.

The compression remains accountable because every simplification has a named validity condition. A user can ask which role is missing, which assumption fails, and which neighboring abstraction should replace the candidate instead of treating the label as an unanalyzed bundle.

Abstract Reasoning

R1. Declare T and frequency units before substitution.

R2. Check properness and pole locations of the analog prototype.

R3. Prewarp every critical frequency that must be exact, recognizing multiple points cannot all be globally unwarped by one scalar choice.

R4. Simplify H_d(z) and verify poles lie inside the unit circle.

R5. Evaluate the realized digital response rather than assuming the analog specification carried over unchanged.

The reasoning pattern is deliberately typed: definitions establish identity, calculations or constructions establish consequences, and empirical or institutional evidence establishes whether a real case instantiates the roles. One kind of support cannot silently substitute for another.

Knowledge Transfer

The transform transfers literally across rational continuous-time filters and controllers. Möbius mapping is the mathematical parent; the Tustin name and its stability, sampling, and warping semantics remain specific to signal processing and control.

The transfer boundary follows from the classification test: The transform recurs in digital-filter design and control, but s-to-z substitution, sampling scale, conformal mapping, stability preservation, frequency warping, and prewarping remain constitutive signal-processing semantics. The safe portable move is to name the broader parent when the home-domain machinery is absent and to retain the domain name only when literal recognition succeeds.

Examples

Canonical: first-order low-pass

For H_a(s)=1/(s+a), substitute s=(2/T)(1-z-1)/(1+z-1). Multiplying numerator and denominator by 1+z^-1 yields a first-order rational H_d(z). The analog pole at -a maps to z=(1-aT/2)/(1+aT/2), whose magnitude is below one for a>0 and T>0, directly showing stability preservation. [1]

Mapped back: the analog transfer function; the sampling interval T; the fractional-linear substitution; the left-half-plane mapping; the unit-disk mapping; the transformed rational function.

Applied / In Practice: prewarped cutoff

A designer needs a digital low-pass cutoff at omega_c. They compute the corresponding analog Omega_c using the tangent relation, design the analog prototype at that prewarped edge, and apply the bilinear transform. The digital response hits the chosen cutoff, while other frequencies remain nonlinearly compressed as omega approaches pi. [1]

Mapped back: the frequency warping; the prewarping step; the no-aliasing property; the transformed rational function.

Structural Tensions

T1: Stability preservation versus frequency warping. The global conformal map preserves the stable region while distorting the frequency scale. Diagnostic: Which specification matters more, and which frequencies were prewarped?

T2: No aliasing versus high-frequency compression. The whole analog axis maps uniquely to a finite digital interval, crowding high frequencies near pi. Diagnostic: Does the compressed stopband still meet requirements?

T3: Analog prototype reuse versus digital optimality. Prototype methods are convenient but may not yield the best filter under purely digital criteria. Diagnostic: Would direct digital optimization improve the relevant objective?

T4: Algebraic equivalence versus finite precision. A correct transfer function can be unstable numerically in a poor direct-form implementation. Diagnostic: Has the filter been factored and scaled for arithmetic precision?

T5: Single-point exactness versus multi-edge design. One prewarp can make one edge exact, while several edges require adjusted prototype transformations. Diagnostic: Which critical frequencies are guaranteed after warping?

T6: Domain autonomy vs prime reduction. Mapping and isomorphism provide broad structure, but the s-plane, z-plane, stability regions, T, and warping define the bilinear transform. Diagnostic: Would the formula retain meaning without continuous/discrete system semantics? If not, retain the domain node.

Structural–Framed Character

The five-criterion aggregate is 0.15 (structural). The classification is reasoned rather than cosmetic:

  • Vocabulary travels — structural (0.25). The operative vocabulary retains the home-domain types named in the Structural Signature even when a thinner parent pattern travels.
  • Evaluative weight — structural (0.00). The score records whether applying the abstraction requires a normative or interpretive judgment in addition to structural recognition.
  • Institutional origin — structural (0.25). The score records whether the abstraction is constituted by a scholarly, legal, technical, or administrative convention rather than merely discovered in nature.
  • Human-practice bound — structural (0.00). The score records how far the named roles depend on a human practice, measurement regime, language, or institution.
  • Import versus recognize — structural (0.25). Beyond its home habitat, use of the name increasingly becomes import by analogy rather than recognition of the same mechanism.

The portable skeleton is: use a reversible fractional-linear coordinate map to carry one validity region into another while exposing a systematic distortion. That skeleton belongs to the related parent abstractions; it does not make the fully accented node a prime. Its character: structural, with a real structural core whose recognition remains bounded by domain-specific types and validity conditions.

Structural Core vs. Domain Accent

This section decides why Bilinear Transform is a domain-specific abstraction rather than a prime.

Structural core: Use a reversible fractional-linear coordinate map to carry one validity region into another while exposing a systematic distortion. This relational skeleton can recur outside the home domain and is the part legitimately carried by broader primes.

Domain accent: Laplace and z variables, sampling interval, analog poles, digital unit circle, iir filters, frequency warping, and prewarping. Remove those types and constraints and the result may still resemble the skeleton, but it is no longer recognized as this named abstraction.

Why it does not clear the prime bar: Möbius transformation is portable; the bilinear transform is the Tustin s-to-z substitution with signal-processing stability and frequency meaning. Cross-domain transfer is therefore routed through the parents, while the named entry remains available for precise in-domain diagnosis.

  • Isomorphism. captures reversible structural correspondence but not the warped metric.
  • Direct Linear Transformation. is a projective-estimation neighbor, not this fractional substitution.
  • Mapping. is the broad functional parent.

These are prose relations only. They do not create structured DAG edges, and placement must still pass the live endpoint, redundancy, and cycle checks recorded in the bundle's placement memo.

Relationships to Other Abstractions

Local relationship map for Bilinear TransformParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Bilinear TransformDOMAINPrime abstraction: Transformation — is a kind ofTransformationPRIME

Current abstraction Bilinear Transform Domain-specific

Parents (1) — more general patterns this builds on

  • Bilinear Transform is a kind of Transformation Prime

    Direct Linear Transformation. is a projective-estimation neighbor, not this fractional substitution.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Bilinear Transform sits in a sparse region of the domain-specific corpus (89th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

  • Bilinear form. a function linear in each of two arguments. Tell: Are there two vector arguments or an s-to-z substitution?
  • Impulse invariance. samples an analog impulse response. Tell: Is frequency aliasing or Möbius warping the characteristic effect?
  • Matched-z transform. maps individual poles and zeros exponentially. Tell: Which pole mapping formula is used?
  • Forward Euler discretization. uses a first-order derivative approximation with different stability mapping. Tell: Does the left half-plane map wholly inside the unit disk?
  • Möbius transform. the broader fractional-linear map. Tell: Are s-plane and z-plane system semantics specified?

References

[1] Alan V. Oppenheim, “Lecture 15: Design of IIR Digital Filters, Part 2”, MIT OpenCourseWare. registry ↩a ↩b ↩c ↩d