EC > GATE 2013 SET-4 > Matched Filter

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Let g(t) = e^-πt2, and h(t) is a filter matched to g(t). If g(t) is applied as input to h(t), then the Fourier transform of the output is

A

e^-πf2

B

e^-πf2/2

C

e^-π|f|

D

e^-2πf2

Check Answer

Explanation

Correct : d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science