Scribd
Upload
24 views4 pages

The Lecture Contains:: Lecture 14: Inverse SSFT, Generalised Nyquist Sampling Theorem, Sampling Efficiency

This lecture discusses video sampling by introducing the concepts of reciprocal lattices and generalized Nyquist sampling theorem. It defines reciprocal lattices and how they characterize the periodicity of functions over lattices. The lecture presents theorems about the sums and intersections of lattices. It describes how sampling can be done over lattices as a generalization of uniform sampling on grids. The key concepts covered are inverse SSFT, generalized Nyquist sampling theorem, sampling efficiency, periodicity lattices, and sampling over lattices.

Uploaded by

Adeoti Oladapo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views4 pages

The Lecture Contains:: Lecture 14: Inverse SSFT, Generalised Nyquist Sampling Theorem, Sampling Efficiency

This lecture discusses video sampling by introducing the concepts of reciprocal lattices and generalized Nyquist sampling theorem. It defines reciprocal lattices and how they characterize the periodicity of functions over lattices. The lecture presents theorems about the sums and intersections of lattices. It describes how sampling can be done over lattices as a generalization of uniform sampling on grids. The key concepts covered are inverse SSFT, generalized Nyquist sampling theorem, sampling efficiency, periodicity lattices, and sampling over lattices.

Uploaded by

Adeoti Oladapo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Objectives_template

  Module 3: Video Sampling


  Lecture 14: Inverse SSFT, Generalised Nyquist sampling theorem, Sampling efficiency
 
 
 The Lecture Contains:
 
  Definition of Reciprocal Lattice:
 
  Characterization of Periodicity using the lattice concept:
 
Sampling over lattices:
 
 
 
 
 
 
 

file:///D|/...%20(Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture14/14_1.htm[12/31/2015 12:47:04 PM]


Objectives_template

  Module 3: Video Sampling


  Lecture 14: Inverse SSFT, Generalised Nyquist sampling theorem, Sampling efficiency
  
  Definition of Reciprocal Lattice:
 
Given a lattice , with generating matrix , its reciprocal lattice is defined as a lattice with
 
  generating matrix or . The basis for is the set of vector
  determined by .
  where if
 
   if
  The basic vectors in and are orthonormal.
  If and then . i.e. inner product of any
  two points one from each lattice is an integer.
 
Because of det , it implies that the sampling densities are inversely related.

i.e. , that is the denser is, sparser is and vice versa.

 
Example:
For given
 

We see that is denser than , but is sparser than . This is so as,

 
 

file:///D|/...%20(Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture14/14_2.htm[12/31/2015 12:47:04 PM]


Objectives_template

  Module 3: Video Sampling


  Lecture 14: Inverse SSFT, Generalised Nyquist sampling theorem, Sampling efficiency
  
  Characterization of Periodicity using the lattice concept:
 
 
 
  A function is periodic with a non-singular periodicity matrix if
  (or )
  
  We know that the set of all repetition centers (or ) forms a lattice with a
 
generating matrix . For this reason, when a lattice is used to describe the periodicity of a function,
 
  it is also referred to as a “Periodicity lattice”.
  
  Now since the entire space can be partitioned into infinitely many shifted versions of a unit cell of
the lattice, one can consider a periodic function as one that repeats a basic pattern over a unit cell at
all other translated unit cells.

  We refer to “Vornoi cell” of lattice as the fundamental Period of this function. A periodic function
essentially consists of its fundamental period & the shifted versions of this period overall lattice
points.
 
 

file:///D|/...%20(Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture14/14_3.htm[12/31/2015 12:47:04 PM]


Objectives_template

  Module 3: Video Sampling


  Lecture 14: Inverse SSFT, Generalised Nyquist sampling theorem, Sampling efficiency
  
  Theorem: Let and rep. two lattices with generating matrices and . If is a matrix
  of rational numbers then is also a lattice. It is the largest
 
lattice that contains both and .
 
  
  Under the same condition, the sum is also a lattice. It is the
  smallest lattice that contains both and .
 
  
  Theorem: If then . Also if . The above results can be
  proven by using rela and as nonsingular.
  However one needs to specify a periodic function only over its fundamental period.
 
Sampling over lattices:
It is a generalization of uniform sampling over a rectangular grid in 2D or a hypercubic grid in K-D.
  With this sampling structure, all the theoms known for 1D and 2D unif sampling still apply, and in
particular a generalized Nyquist sampling theory exists which governs the necessary sampling
density and structure of the sampling lattice for a given signal spectrum.
 
 

file:///D|/...%20(Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture14/14_4.htm[12/31/2015 12:47:05 PM]

You might also like