<?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>Fri, 25 Jul 2008 04:26:39 BST</pubDate>


	<title>CiteULike: dcastros ber</title>
	<description>CiteULike: dcastros ber</description>


	<link>http://www.citeulike.org/user/dcastro/tag/ber</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/3039325"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2983966"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2983965"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2983962"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2983960"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2859269"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2834506"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2834535"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2813939"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2806810"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/1064993"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/1377748"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/dcastro/article/2421639"/>

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


<item rdf:about="http://www.citeulike.org/user/dcastro/article/3039325">
    <title>Error probabilities for radio transmissions of MC-CDMA based W-LANs</title>
    <link>http://www.citeulike.org/user/dcastro/article/3039325</link>
    <description>&lt;i&gt;Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st, Vol. 3 (2005), pp. 1706-1710 Vol. 3.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;IEEE 802.11a/e has become a worldwide wireless local area network (W-LAN) standard, with a rapid development. Many proposals have been made for its further expansion, and some of them focus on multicarrier code division multiple access (MC-CDMA), a novel, high capacity, multicarrier modulation scheme. In this paper we present an analysis of the error models for radio transmissions in such systems. An accurate model of the channel is necessary for the performance evaluation of the protocol by means of computer simulations. Focusing on the estimation of the signal to interference and noise ratio (SINR) at the detector and on the calculation of a packet error ratio (PER), in this contribution we discuss a modeling approach which allows an efficient calculation of frame transmissions over a MC-CDMA shared radio channel.</description>
    <dc:title>Error probabilities for radio transmissions of MC-CDMA based W-LANs</dc:title>

    <dc:creator>G Orfanos</dc:creator>
    <dc:creator>J Habetha</dc:creator>
    <dc:creator>W Butsch</dc:creator>
    <dc:identifier>doi:10.1109/VETECS.2005.1543612</dc:identifier>
    <dc:source>Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st, Vol. 3 (2005), pp. 1706-1710 Vol. 3.</dc:source>
    <dc:date>2008-07-24T11:59:46-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st</prism:publicationName>
    <prism:volume>3</prism:volume>
    <prism:startingPage>1706</prism:startingPage>
    <prism:endingPage>1710 Vol. 3</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>cdma</prism:category>
    <prism:category>error</prism:category>
    <prism:category>probability</prism:category>
    <prism:category>wlan</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2983966">
    <title>Performance enhancement using forward error correction on power line communication channels</title>
    <link>http://www.citeulike.org/user/dcastro/article/2983966</link>
    <description>&lt;i&gt;Power Delivery, IEEE Transactions on, Vol. 9, No. 2. (1994), pp. 645-653.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The use of forward error correction (FEC) coding is investigated, to enhance communication throughput and reliability on noisy power line networks. Rate one-half self-orthogonal convolutional codes are considered. These codes are known to be effective in other environments, and can be decoded inexpensively in real-time using majority logic decoders. Extensive bit and packet error rate tests were conducted on actual, noisy in-building power line links. Coding gains of 15 dB were observed at 10&#60;sup&#62;-3&#60;/sup&#62; decoded bit error rates. A self-orthogonal (2, 1, 6) convolutional code with interleaving to degree 7 was particularly effective, and was implemented as a VLSI microelectronic chip. Its use improved data throughput and packet error rates substantially, at data transmission rates of 9,600 bits/s</description>
    <dc:title>Performance enhancement using forward error correction on power line communication channels</dc:title>

    <dc:creator>MHL Chan</dc:creator>
    <dc:creator>D Friedman</dc:creator>
    <dc:creator>RW Donaldson</dc:creator>
    <dc:identifier>doi:10.1109/61.296240</dc:identifier>
    <dc:source>Power Delivery, IEEE Transactions on, Vol. 9, No. 2. (1994), pp. 645-653.</dc:source>
    <dc:date>2008-07-10T07:12:51-00:00</dc:date>
    <prism:publicationYear>1994</prism:publicationYear>
    <prism:publicationName>Power Delivery, IEEE Transactions on</prism:publicationName>
    <prism:volume>9</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>645</prism:startingPage>
    <prism:endingPage>653</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>fec</prism:category>
    <prism:category>plc</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2983965">
    <title>On the probability of symbol error in Viterbi decoders</title>
    <link>http://www.citeulike.org/user/dcastro/article/2983965</link>
    <description>&lt;i&gt;Communications, IEEE Transactions on, Vol. 45, No. 2. (1997), pp. 152-155.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;An upper bound is derived on the probability that at least one of a sequence of B consecutive bits at the output of a Viterbi (1979) decoder is in error. Such a bound is useful for the analysis of concatenated coding schemes employing an outer block code over GF(2&#60;sup&#62;B&#60;/sup&#62;) (typically a Reed-Solomon (RS) code), an inner convolutional code, and a symbol (GF(2&#60;sup&#62;B&#60;/sup&#62;)) interleaver separating the two codes. The bound demonstrates that in such coding schemes a symbol interleaver is preferable to a bit interleaver. It also suggests a new criterion for good inner convolutional codes</description>
    <dc:title>On the probability of symbol error in Viterbi decoders</dc:title>

    <dc:creator>A Lapidoth</dc:creator>
    <dc:identifier>doi:10.1109/26.554361</dc:identifier>
    <dc:source>Communications, IEEE Transactions on, Vol. 45, No. 2. (1997), pp. 152-155.</dc:source>
    <dc:date>2008-07-10T07:12:49-00:00</dc:date>
    <prism:publicationYear>1997</prism:publicationYear>
    <prism:publicationName>Communications, IEEE Transactions on</prism:publicationName>
    <prism:volume>45</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>152</prism:startingPage>
    <prism:endingPage>155</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>viterbi</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2983962">
    <title>Performance analysis of uncoded and coded OFDM broadband transmission over low voltage power-line channels with impulsive noise</title>
    <link>http://www.citeulike.org/user/dcastro/article/2983962</link>
    <description>&lt;i&gt;Power Delivery, IEEE Transactions on, Vol. 21, No. 4. (2006), pp. 1927-1934.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Broadband communications for indoor power-line networks with impulsive noise using orthogonal frequency division multiplexing (OFDM) is considered. From earlier investigations, it is known that this channel suffers from multipath fading and frequency selectivity along with man-made impulsive bursty noise. Nevertheless, the calculated channel capacity limit promises very high data rates over this channel. Enhancement techniques, such as coding can help an OFDM system to tackle impulsive noise burst. In this paper, the bit error rate (BER) performance of the OFDM system under impulsive noise and frequency fading is theoretically analyzed and closed form expression for the performance is derived. Two different impulsive noise environment models are studied and it is confirmed that both models represent the same environment. Furthermore, a theoretical upper bound on the performance of coded OFDM system is obtained, given perfect interleaving. The effect of the interleaver length on coding performance is also studied. Simulations show that the upper bound is quite tight for the case of employing a longer interleaver. The effect of interleaver size on the system performance is studied, as well.</description>
    <dc:title>Performance analysis of uncoded and coded OFDM broadband transmission over low voltage power-line channels with impulsive noise</dc:title>

    <dc:creator>P Amirshahi</dc:creator>
    <dc:creator>SM Navidpour</dc:creator>
    <dc:creator>M Kavehrad</dc:creator>
    <dc:identifier>doi:10.1109/TPWRD.2006.877073</dc:identifier>
    <dc:source>Power Delivery, IEEE Transactions on, Vol. 21, No. 4. (2006), pp. 1927-1934.</dc:source>
    <dc:date>2008-07-10T07:12:37-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Power Delivery, IEEE Transactions on</prism:publicationName>
    <prism:volume>21</prism:volume>
    <prism:number>4</prism:number>
    <prism:startingPage>1927</prism:startingPage>
    <prism:endingPage>1934</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>code</prism:category>
    <prism:category>ofdm</prism:category>
    <prism:category>plc</prism:category>
    <prism:category>receiver</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2983960">
    <title>Theoretical bit error rate for uncoded and coded data transmission in digital audio broadcasting</title>
    <link>http://www.citeulike.org/user/dcastro/article/2983960</link>
    <description>&lt;i&gt;Communications, 1996. ICC 96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on, Vol. 1 (1996), pp. 297-301 vol.1.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In this paper we analyze the bit error rate of an OFDM multicarrier transmission system with DQPSK modulation and differential phase detection both for uncoded and convolutionally coded data. Formulas are derived which take into account the influence of the fast Rician fading channel, but they are valid for multipath Rayleigh fading and the additive Gaussian noise channel as well. Theoretical bit error rates are given for system parameters and channel models proposed for digital audio broadcasting (DAB) in Europe. A comparison with results obtained by a DAB software simulation tool (developed by the same authors) shows good agreement and demonstrates the applicability of the derived set of formulas as a powerful tool for DAB network planning</description>
    <dc:title>Theoretical bit error rate for uncoded and coded data transmission in digital audio broadcasting</dc:title>

    <dc:creator>G Zimmermann</dc:creator>
    <dc:creator>M Rosenberger</dc:creator>
    <dc:creator>S Dostert</dc:creator>
    <dc:identifier>doi:10.1109/ICC.1996.542201</dc:identifier>
    <dc:source>Communications, 1996. ICC 96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on, Vol. 1 (1996), pp. 297-301 vol.1.</dc:source>
    <dc:date>2008-07-10T07:12:34-00:00</dc:date>
    <prism:publicationYear>1996</prism:publicationYear>
    <prism:publicationName>Communications, 1996. ICC 96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on</prism:publicationName>
    <prism:volume>1</prism:volume>
    <prism:startingPage>297</prism:startingPage>
    <prism:endingPage>301 vol.1</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>digital</prism:category>
    <prism:category>ofdm</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2859269">
    <title>BER sensitivity of OFDM systems to time synchronization error</title>
    <link>http://www.citeulike.org/user/dcastro/article/2859269</link>
    <description>&lt;i&gt;Communication Systems, 2002. ICCS 2002. The 8th International Conference on, Vol. 1 (2002), pp. 42-46 vol.1.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper presents the details of a simulation based study performed to investigate the BER performance degradation (sensitivity) of OFDM systems due to time synchronization error at the demodulator. It is shown that an OFDM system incorporating a cyclic prefix (CP) has an asymmetric effect on the received constellation with synchronization error away from CP introducing intersymbol interference (ISI), while that towards the CP introducing only a phase error. We approximate the time synchronization error by a Gaussian distributed random variable, in order to evaluate the BER sensitivity of OFDM systems to timing error. The BER performance was evaluated for an AWGN channel and a multipath fading channel in terms of the synchronization error variance. The results of this investigation will be useful in developing time synchronization algorithms in OFDM systems to achieve a particular BER performance target for a given channel condition.</description>
    <dc:title>BER sensitivity of OFDM systems to time synchronization error</dc:title>

    <dc:creator>CRN Athaudage</dc:creator>
    <dc:source>Communication Systems, 2002. ICCS 2002. The 8th International Conference on, Vol. 1 (2002), pp. 42-46 vol.1.</dc:source>
    <dc:date>2008-06-03T14:47:10-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>Communication Systems, 2002. ICCS 2002. The 8th International Conference on</prism:publicationName>
    <prism:volume>1</prism:volume>
    <prism:startingPage>42</prism:startingPage>
    <prism:endingPage>46 vol.1</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>error</prism:category>
    <prism:category>ofdm</prism:category>
    <prism:category>synchronization</prism:category>
    <prism:category>time</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2834506">
    <title>Coded Error Probability Evaluation for Antijam Communication Systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/2834506</link>
    <description>&lt;i&gt;Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 30, No. 5. (1982), pp. 896-903.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We present a general union-Chernoff bound on the bit error probability for coded communication systems and apply it to examples of antijam systems. The key feature of this bound is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge.</description>
    <dc:title>Coded Error Probability Evaluation for Antijam Communication Systems</dc:title>

    <dc:creator>J Omura</dc:creator>
    <dc:creator>B Levitt</dc:creator>
    <dc:source>Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 30, No. 5. (1982), pp. 896-903.</dc:source>
    <dc:date>2008-05-26T13:55:46-00:00</dc:date>
    <prism:publicationYear>1982</prism:publicationYear>
    <prism:publicationName>Communications, IEEE Transactions on [legacy, pre - 1988]</prism:publicationName>
    <prism:volume>30</prism:volume>
    <prism:number>5</prism:number>
    <prism:startingPage>896</prism:startingPage>
    <prism:endingPage>903</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>coded</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2834535">
    <title>Bandwidth efficient parallel concatenated coding schemes</title>
    <link>http://www.citeulike.org/user/dcastro/article/2834535</link>
    <description>&lt;i&gt;Electronics Letters, Vol. 31, No. 24. (1995), pp. 2067-2069.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The authors propose a solution to the parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2bit/s/Hz with 8PSK and 16QAM signal constellations. For parallel concatenated trellis codes in the examples, rate 2/3 and 4/5, 16-state binary convolutional codes with Gray code mapping are used. The performances of these codes are within 1 dB of the Shannon limit at a bit error probability of 10&#60;sup&#62;-6&#60;/sup&#62; for a given throughput. This outperforms all codes reported in the past for the same throughput</description>
    <dc:title>Bandwidth efficient parallel concatenated coding schemes</dc:title>

    <dc:creator>S Benedetto</dc:creator>
    <dc:creator>D Divsalar</dc:creator>
    <dc:creator>G Montorsi</dc:creator>
    <dc:creator>F Pollara</dc:creator>
    <dc:source>Electronics Letters, Vol. 31, No. 24. (1995), pp. 2067-2069.</dc:source>
    <dc:date>2008-05-26T13:56:44-00:00</dc:date>
    <prism:publicationYear>1995</prism:publicationYear>
    <prism:publicationName>Electronics Letters</prism:publicationName>
    <prism:volume>31</prism:volume>
    <prism:number>24</prism:number>
    <prism:startingPage>2067</prism:startingPage>
    <prism:endingPage>2069</prism:endingPage>
    <prism:category>bandwidth</prism:category>
    <prism:category>ber</prism:category>
    <prism:category>coding</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2813939">
    <title>Estimacion Eficiente de la Probabilidad de Error para el Diseño de Redes WLAN</title>
    <link>http://www.citeulike.org/user/dcastro/article/2813939</link>
    <description>&lt;i&gt;&lt;/i&gt;</description>
    <dc:title>Estimacion Eficiente de la Probabilidad de Error para el Diseño de Redes WLAN</dc:title>

    <dc:creator>Beatriz Rodríguez</dc:creator>
    <dc:creator>Matilde</dc:creator>
    <dc:creator>Ana Armada</dc:creator>
    <dc:date>2008-05-19T19:07:42-00:00</dc:date>
    <prism:category>ber</prism:category>
    <prism:category>simulation</prism:category>
    <prism:category>wlan</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2806810">
    <title>A Modified Monte-Carlo Simulation Technique for the Evaluation of Error Rate in Digital Communication Systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/2806810</link>
    <description>&lt;i&gt;Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 28, No. 11. (1980), pp. 1916-1924.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Digital communication systems are frequently operated over nonlinear channels with memory. The analysis of the performance of these systems is difficult and no complete analytical treatment of the problem has been obtained before. Several recent efforts have been directed toward the computation of error probabilities via Monte-Carlo simulation using a complete system model. These simulations require excessively large sample sizes and are not practical for estimating very low values of error probabilities. This paper presents a modified Monte-Carlo simulation technique for estimating error probabilities in digital communication systems operating over nonlinear channels. An importance-sampling technique is used to modify the probability density function of the noise process in a way to make simulation possible. Theoretical results as well as realistic examples are presented, showing that the number of samples needed for simulation is reduced considerably.</description>
    <dc:title>A Modified Monte-Carlo Simulation Technique for the Evaluation of Error Rate in Digital Communication Systems</dc:title>

    <dc:creator>K Shanmugam</dc:creator>
    <dc:creator>P Balaban</dc:creator>
    <dc:source>Communications, IEEE Transactions on [legacy, pre - 1988], Vol. 28, No. 11. (1980), pp. 1916-1924.</dc:source>
    <dc:date>2008-05-17T10:55:58-00:00</dc:date>
    <prism:publicationYear>1980</prism:publicationYear>
    <prism:publicationName>Communications, IEEE Transactions on [legacy, pre - 1988]</prism:publicationName>
    <prism:volume>28</prism:volume>
    <prism:number>11</prism:number>
    <prism:startingPage>1916</prism:startingPage>
    <prism:endingPage>1924</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>digital</prism:category>
    <prism:category>monte-carlo</prism:category>
    <prism:category>simulation</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/1064993">
    <title>Techniques for Estimating the Bit Error Rate in the Simulation of Digital Communication Systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/1064993</link>
    <description>&lt;i&gt;Selected Areas in Communications, IEEE Journal on, Vol. 2, No. 1. (1984), pp. 153-170.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Computer simulation is often used to estimate the bit error rate (BER) performance of digital communication systems. There are a number of distinct techniques in the simulation context that can be used to construct this estimate. A tutorial exposition of such techniques is provided, with particular reference to five specific methods which can be implemented in a simulation. These methods range from the traditional Monte Carlo trials to assumption of definite forms for the noise statistics. An attempt is made to show how these methods are related, and the specific assumptions that are invoked in order to apply them.</description>
    <dc:title>Techniques for Estimating the Bit Error Rate in the Simulation of Digital Communication Systems</dc:title>

    <dc:creator>M Jeruchim</dc:creator>
    <dc:source>Selected Areas in Communications, IEEE Journal on, Vol. 2, No. 1. (1984), pp. 153-170.</dc:source>
    <dc:date>2007-01-24T11:15:24-00:00</dc:date>
    <prism:publicationYear>1984</prism:publicationYear>
    <prism:publicationName>Selected Areas in Communications, IEEE Journal on</prism:publicationName>
    <prism:volume>2</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>153</prism:startingPage>
    <prism:endingPage>170</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>digital</prism:category>
    <prism:category>simulation</prism:category>
    <prism:category>technique</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/1377748">
    <title>Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)</title>
    <link>http://www.citeulike.org/user/dcastro/article/1377748</link>
    <description>&lt;i&gt;Information Theory, IEEE Transactions on, Vol. 20, No. 2. (1974), pp. 284-287.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered. The decoding of linear block and convolutional codes to minimize symbol error probability is shown to be a special case of this problem. An optimal decoding algorithm is derived.</description>
    <dc:title>Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)</dc:title>

    <dc:creator>L Bahl</dc:creator>
    <dc:creator>J Cocke</dc:creator>
    <dc:creator>F Jelinek</dc:creator>
    <dc:creator>J Raviv</dc:creator>
    <dc:source>Information Theory, IEEE Transactions on, Vol. 20, No. 2. (1974), pp. 284-287.</dc:source>
    <dc:date>2007-06-10T21:52:55-00:00</dc:date>
    <prism:publicationYear>1974</prism:publicationYear>
    <prism:publicationName>Information Theory, IEEE Transactions on</prism:publicationName>
    <prism:volume>20</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>284</prism:startingPage>
    <prism:endingPage>287</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>code</prism:category>
    <prism:category>decoder</prism:category>
    <prism:category>linear</prism:category>
    <prism:category>optimum</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/dcastro/article/2421639">
    <title>Upper bounds on the bit-error rate of optimum combining in wireless systems</title>
    <link>http://www.citeulike.org/user/dcastro/article/2421639</link>
    <description>&lt;i&gt;Communications, IEEE Transactions on, Vol. 46, No. 12. (1998), pp. 1619-1624.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper presents upper bounds on the bit-error rate (BER) of optimum combining in wireless systems with multiple cochannel interferers in a Rayleigh fading environment. We present closed-form expressions for the upper bound on the bit-error rate with optimum combining, for any number of antennas and interferers, with coherent detection of BPSK and QAM signals, and differential detection of DPSK. We also present bounds on the performance gain of optimum combining over maximal ratio combining. These bounds are asymptotically tight with decreasing BER, and results show that the asymptotic gain is within 2 dB of the gain as determined by computer simulation for a variety of cases at a 10&#60;sup&#62;-3&#60;/sup&#62; BER. The closed-form expressions for the bound permit rapid calculation of the improvement with optimum combining for any number of interferers and antennas, as compared with the CPU hours previously required by Monte Carlo simulation. Thus these bounds allow calculation of the performance of optimum combining under a variety of conditions where it was not possible previously, including analysis of the outage probability with shadow fading and the combined effect of adaptive arrays and dynamic channel assignment in mobile radio systems</description>
    <dc:title>Upper bounds on the bit-error rate of optimum combining in wireless systems</dc:title>

    <dc:creator>JH Winters</dc:creator>
    <dc:creator>J Salz</dc:creator>
    <dc:identifier>doi:10.1109/26.737400</dc:identifier>
    <dc:source>Communications, IEEE Transactions on, Vol. 46, No. 12. (1998), pp. 1619-1624.</dc:source>
    <dc:date>2008-02-24T13:50:29-00:00</dc:date>
    <prism:publicationYear>1998</prism:publicationYear>
    <prism:publicationName>Communications, IEEE Transactions on</prism:publicationName>
    <prism:volume>46</prism:volume>
    <prism:number>12</prism:number>
    <prism:startingPage>1619</prism:startingPage>
    <prism:endingPage>1624</prism:endingPage>
    <prism:category>ber</prism:category>
    <prism:category>combining</prism:category>
    <prism:category>optimum</prism:category>
    <prism:category>systems</prism:category>
    <prism:category>wireless</prism:category>
</item>



</rdf:RDF>

