<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: Convolutional code</title>
	<atom:link href="http://www.dsplog.com/2009/01/04/convolutional-code/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.dsplog.com/2009/01/04/convolutional-code/</link>
	<description>Signal Processing for Communication</description>
	<lastBuildDate>Fri, 10 Feb 2012 01:03:15 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: sundar kharvi</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-100954</link>
		<dc:creator>sundar kharvi</dc:creator>
		<pubDate>Wed, 08 Feb 2012 05:15:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-100954</guid>
		<description>hi,
I m doing project on implementation of turbo encoder using VHDL . Can i get information about turbo encoder?</description>
		<content:encoded><![CDATA[<p>hi,<br />
I m doing project on implementation of turbo encoder using VHDL . Can i get information about turbo encoder?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Krishna Sankar</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-93917</link>
		<dc:creator>Krishna Sankar</dc:creator>
		<pubDate>Mon, 09 Jan 2012 01:09:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-93917</guid>
		<description>@Gheorge: I think that might be a typo. From &lt;a href=&quot;http://www.amazon.com/gp/redirect.html?ie=UTF8&amp;location=http%3A%2F%2Fwww.amazon.com%2FDigital-Signal-Processing-John-Proakis%2Fdp%2F0131873741&amp;tag=dl04-20&amp;linkCode=ur2&amp;camp=1789&amp;creative=9325&quot; title=&quot;Digital Communication by Proakis&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;Digital Communications by John Proakis&lt;/a&gt;, Table 8.2.1 , the generator polynomial in octal for constraint length 7, rate1/2 codes are:
a) 133_octal = 10000101_binary
b) 171_octal = 10101011_binary</description>
		<content:encoded><![CDATA[<p>@Gheorge: I think that might be a typo. From <a href="http://www.amazon.com/gp/redirect.html?ie=UTF8&#038;location=http%3A%2F%2Fwww.amazon.com%2FDigital-Signal-Processing-John-Proakis%2Fdp%2F0131873741&#038;tag=dl04-20&#038;linkCode=ur2&#038;camp=1789&#038;creative=9325" title="Digital Communication by Proakis" target="_blank" rel="nofollow">Digital Communications by John Proakis</a>, Table 8.2.1 , the generator polynomial in octal for constraint length 7, rate1/2 codes are:<br />
a) 133_octal = 10000101_binary<br />
b) 171_octal = 10101011_binary</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gheorghe M.Panaitescu</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-93832</link>
		<dc:creator>Gheorghe M.Panaitescu</dc:creator>
		<pubDate>Sun, 08 Jan 2012 18:04:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-93832</guid>
		<description>I found in various places a table containing generator polynomials for convolutional encoding, specifically Table 1-&quot;Generator Polynomials found by Busgang for good rate ½ codes&quot; posted at http://www.complextoreal.com/convo.htm.
That table contains on the line Constraint length = 7 two identical polynomials, G1 = 110101 and G2 = 110101.
I guess this is not possible. The two polynomials must be different.
Does anybody knows the correct polynomials?</description>
		<content:encoded><![CDATA[<p>I found in various places a table containing generator polynomials for convolutional encoding, specifically Table 1-&#8221;Generator Polynomials found by Busgang for good rate ½ codes&#8221; posted at <a href="http://www.complextoreal.com/convo.htm" rel="nofollow">http://www.complextoreal.com/convo.htm</a>.<br />
That table contains on the line Constraint length = 7 two identical polynomials, G1 = 110101 and G2 = 110101.<br />
I guess this is not possible. The two polynomials must be different.<br />
Does anybody knows the correct polynomials?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Krishna Sankar</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-56214</link>
		<dc:creator>Krishna Sankar</dc:creator>
		<pubDate>Tue, 24 May 2011 00:22:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-56214</guid>
		<description>@Citra: How are you converting to 2/3 code - by puncturing?</description>
		<content:encoded><![CDATA[<p>@Citra: How are you converting to 2/3 code &#8211; by puncturing?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Citra</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-54772</link>
		<dc:creator>Citra</dc:creator>
		<pubDate>Sun, 08 May 2011 09:29:31 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-54772</guid>
		<description>Hi Krishna
I&#039;ve seen the program about the convolutional code. What if the rate is replaced 2 / 3 with constraint length 3, kira2x parameters which must be changed? listings that you make there is the theory of maximum likelihood or not? If there is where do? Why should use the AWGN in the form of the complex?
Thank you for your attention.
I look forward to your assistance.</description>
		<content:encoded><![CDATA[<p>Hi Krishna<br />
I&#8217;ve seen the program about the convolutional code. What if the rate is replaced 2 / 3 with constraint length 3, kira2x parameters which must be changed? listings that you make there is the theory of maximum likelihood or not? If there is where do? Why should use the AWGN in the form of the complex?<br />
Thank you for your attention.<br />
I look forward to your assistance.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Krishna Sankar</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-24718</link>
		<dc:creator>Krishna Sankar</dc:creator>
		<pubDate>Sat, 03 Apr 2010 23:48:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-24718</guid>
		<description>@hina: Plz refer Digital Communications by Proakis</description>
		<content:encoded><![CDATA[<p>@hina: Plz refer Digital Communications by Proakis</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Krishna Sankar</title>
		<link>http://www.dsplog.com/2009/01/04/convolutional-code/#comment-24349</link>
		<dc:creator>Krishna Sankar</dc:creator>
		<pubDate>Mon, 29 Mar 2010 23:26:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.dsplog.com/?p=376#comment-24349</guid>
		<description>@manisha: Some relevant links which I picked up from a quick Googling.
(a) Tone reservation : where some of the unused subcarriers in an OFDM system is modulated to reduce the PAPR.
(b) MERL has a paper on PAPR reduction by oversampling, soft clipping and filtering.
PAPR Reduction for WiMAX OFDM Systems
http://www.merl.com/projects/papr/
(c) Nice comp.dsp thread on this topic
Has The peak-to-average ratio problem of OFDM been solved?
http://tinyurl.com/6jn9ql</description>
		<content:encoded><![CDATA[<p>@manisha: Some relevant links which I picked up from a quick Googling.<br />
(a) Tone reservation : where some of the unused subcarriers in an OFDM system is modulated to reduce the PAPR.<br />
(b) MERL has a paper on PAPR reduction by oversampling, soft clipping and filtering.<br />
PAPR Reduction for WiMAX OFDM Systems<br />
<a href="http://www.merl.com/projects/papr/" rel="nofollow">http://www.merl.com/projects/papr/</a><br />
(c) Nice comp.dsp thread on this topic<br />
Has The peak-to-average ratio problem of OFDM been solved?<br />
<a href="http://tinyurl.com/6jn9ql" rel="nofollow">http://tinyurl.com/6jn9ql</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Served from: www.dsplog.com @ 2012-02-11 00:08:02 -->
