<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Simon Rozman &#187; Digital Signal Processing</title>
	<atom:link href="http://simon.rozman.si/category/computers/dsp/feed" rel="self" type="application/rss+xml" />
	<link>http://simon.rozman.si</link>
	<description>My Personal Website</description>
	<lastBuildDate>Thu, 10 Nov 2011 07:18:45 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Computing Block-wise Cross Correlation</title>
		<link>http://simon.rozman.si/computers/dsp/block-wise-cross-correlation</link>
		<comments>http://simon.rozman.si/computers/dsp/block-wise-cross-correlation#comments</comments>
		<pubDate>Tue, 12 Apr 2011 14:42:07 +0000</pubDate>
		<dc:creator>Simon Rozman</dc:creator>
				<category><![CDATA[Digital Signal Processing]]></category>

		<guid isPermaLink="false">http://simon.rozman.si/?p=260</guid>
		<description><![CDATA[The cross correlation of two vectors using discrete Fourier transform (DFT) is a popular method of searching the occurrences of one pattern inside another. It provides simple mean to detect echoes, specific patterns inside digital signals, signal comparison etc. In some applications, one of the input vectors (signals) is much longer than another, or even [...]]]></description>
		<wfw:commentRss>http://simon.rozman.si/computers/dsp/block-wise-cross-correlation/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Computing DFT of real signals in MATLAB</title>
		<link>http://simon.rozman.si/computers/dsp/dftreal</link>
		<comments>http://simon.rozman.si/computers/dsp/dftreal#comments</comments>
		<pubDate>Fri, 08 Apr 2011 13:43:31 +0000</pubDate>
		<dc:creator>Simon Rozman</dc:creator>
				<category><![CDATA[Digital Signal Processing]]></category>

		<guid isPermaLink="false">http://simon.rozman.si/?p=199</guid>
		<description><![CDATA[The discrete Fourier transform (DFT) calculates spectrum of a complex vector. Typically, input vector represent sampled real signal. For real vectors (imaginary part of all vector components is zero) the upper half of the DFT spectrum is a conjugate mirror of the lower half. Therefore, the computation of the DFT of the real vectors can [...]]]></description>
		<wfw:commentRss>http://simon.rozman.si/computers/dsp/dftreal/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

