<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Sat, 26 Jul 2008 06:03:17 BST</pubDate>


	<title>CiteULike: dcastro's Krishnamurthy</title>
	<description>CiteULike: dcastro's Krishnamurthy</description>


	<link>http://www.citeulike.org/user/dcastro/author/Krishnamurthy</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2426836"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/816118"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/1236499"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/1898955"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/dcastro/article/2426836">
    <title>Adaptive OFDM synchronization algorithms based on discrete stochastic approximation</title>
    <link>http://www.citeulike.org/user/dcastro/article/2426836</link>
    <description>&lt;i&gt;Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on], Vol. 53, No. 4. (2005), pp. 1561-1574.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper presents discrete stochastic approximation algorithms (DSA) for time synchronization in orthogonal frequency division multiplexing (OFDM) systems. It is shown that the discrete stochastic approximation algorithms can be effectively used to achieve a significant reduction in computational complexity compared to brute force maximum-likelihood (ML) methods for OFDM synchronization. The most important property of the proposed algorithms is their recursive self-learning capability-most of the computational effort is spent at the global or a local optimizer of the objective function. The convergence of the algorithms is analyzed. An adaptive version of the discrete stochastic approximation algorithm is also presented for tracking time-varying time delays and frequency offsets in time-selective fading channels. Detailed numerical examples illustrate the performance gains of these DSA-based synchronization algorithms.</description>
    <dc:title>Adaptive OFDM synchronization algorithms based on discrete stochastic approximation</dc:title>

    <dc:creator>V Krishnamurthy</dc:creator>
    <dc:creator>CRN Athaudage</dc:creator>
    <dc:creator>Dawei Huang</dc:creator>
    <dc:identifier>doi:10.1109/TSP.2005.843710</dc:identifier>
    <dc:source>Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on], Vol. 53, No. 4. (2005), pp. 1561-1574.</dc:source>
    <dc:date>2008-02-25T19:19:01-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on]</prism:publicationName>
    <prism:volume>53</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>1561</prism:startingPage>
    <prism:endingPage>1574</prism:endingPage>
    <prism:category>adaptive</prism:category>
    <prism:category>algorithm</prism:category>
    <prism:category>ofdm</prism:category>
    <prism:category>synchronization</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/816118">
    <title>Power Management for Throughput Enhancement in Wireless Ad-Hoc Networks</title>
    <link>http://www.citeulike.org/user/dcastro/article/816118</link>
    <description>&lt;i&gt;(2000), pp. 1506-1513.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different transmit powers on the average power consumption and end-to-end network throughput in a wireless ad-hoc environment. This power management approach would help in reducing the system power consumption and hence prolonging the battery life of mobile nodes. Furthermore, it improves the end-to-end network throughput as compared to ...</description>
    <dc:title>Power Management for Throughput Enhancement in Wireless Ad-Hoc Networks</dc:title>

    <dc:creator>Tamer Elbatt</dc:creator>
    <dc:creator>Srikanth Krishnamurthy</dc:creator>
    <dc:creator>Dennis Connors</dc:creator>
    <dc:creator>Son Dao</dc:creator>
    <dc:source>(2000), pp. 1506-1513.</dc:source>
    <dc:date>2006-08-24T23:47:15-00:00</dc:date>
    <prism:publicationYear>2000</prism:publicationYear>
    <prism:startingPage>1506</prism:startingPage>
    <prism:endingPage>1513</prism:endingPage>
    <prism:category>ad-hoc</prism:category>
    <prism:category>networks</prism:category>
    <prism:category>power</prism:category>
    <prism:category>wireless</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/1236499">
    <title>On indoor position location with wireless LANs</title>
    <link>http://www.citeulike.org/user/dcastro/article/1236499</link>
    <description>&lt;i&gt;Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on, Vol. 2 (2002), pp. 720-724 vol.2.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Location aware services are becoming attractive with the deployment of next generation wireless networks and broadband multimedia wireless networks especially in indoor and campus areas. To provide location aware services, obtaining the position of a user accurately is important. While it is possible to deploy additional infrastructure for this purpose, using existing communications infrastructure is preferred for cost reasons. Because of technical restrictions, location fingerprinting schemes are the most promising. In this paper we present a systematic study of the performance tradeoff and deployment issues. In this paper we present some experimental results towards such a systematic study and discuss some issues related to the indoor positioning problem.</description>
    <dc:title>On indoor position location with wireless LANs</dc:title>

    <dc:creator>P Prasithsangaree</dc:creator>
    <dc:creator>P Krishnamurthy</dc:creator>
    <dc:creator>P Chrysanthis</dc:creator>
    <dc:source>Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on, Vol. 2 (2002), pp. 720-724 vol.2.</dc:source>
    <dc:date>2007-04-19T08:42:56-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on</prism:publicationName>
    <prism:volume>2</prism:volume>
    <prism:startingPage>720</prism:startingPage>
    <prism:endingPage>724 vol.2</prism:endingPage>
    <prism:category>indoor</prism:category>
    <prism:category>location</prism:category>
    <prism:category>position</prism:category>
    <prism:category>wireless</prism:category>
    <prism:category>wlan</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/1898955">
    <title>A low complexity timing and frequency synchronization algorithm for OFDM systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/1898955</link>
    <description>&lt;i&gt;Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, Vol. 1 (2002), pp. 244-248 vol.1.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The paper presents a low complexity discrete stochastic approximation algorithm for time and frequency synchronization in OFDM systems. The proposed technique can track the conditions of a slowly time varying channel where synchronization parameters, namely the symbol timing and frequency offset, vary slowly with time. The most important property of the proposed algorithm is its self-learning capability - it spends most of the computational effort at the global minimizer of the objective function. In particular, we show that the algorithm achieves an /spl epsiv/=(1-/spl rho/)/(1+/spl rho/) reduction in computational cost (in terms of complex multiplications to be performed), where /spl rho/=N/sub cp//N is the ratio between cyclic prefix length (N/sub cp/) and number of subcarriers (N) of the OFDM system (e.g. N=512 and N/sub cp/=64 gives /spl epsiv/=78%). Numerical examples illustrate the synchronization accuracy of the proposed technique in terms of symbol timing and frequency offset estimation errors.</description>
    <dc:title>A low complexity timing and frequency synchronization algorithm for OFDM systems</dc:title>

    <dc:creator>CRN Athaudage</dc:creator>
    <dc:creator>V Krishnamurthy</dc:creator>
    <dc:source>Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, Vol. 1 (2002), pp. 244-248 vol.1.</dc:source>
    <dc:date>2007-11-11T15:35:11-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE</prism:publicationName>
    <prism:volume>1</prism:volume>
    <prism:startingPage>244</prism:startingPage>
    <prism:endingPage>248 vol.1</prism:endingPage>
    <prism:category>algorithm</prism:category>
    <prism:category>frequency</prism:category>
    <prism:category>low</prism:category>
    <prism:category>ofdm</prism:category>
    <prism:category>synchronization</prism:category>
    <prism:category>system</prism:category>
    <prism:category>time</prism:category>
</item>



</rdf:RDF>

