By Topic

Communications Letters, IEEE

Issue 12 • Date Dec. 1999

Filter Results

Displaying Results 1 - 6 of 6
  • Non-reinitialized fully distributed power control algorithm

    Page(s): 329 - 331
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (68 KB)  

    A fully distributed power control (FDPC) algorithm has been recently proposed for cellular mobile systems. In the algorithm, the connection which has the smallest initial carrier-to-interference (CIR) ratio is removed if CIR requirements are not satisfied after L iterations of power control. The transmitter power levels of surviving connections are then reset to the maximal allowed values and the algorithm is executed again. We prove in this paper that, if the transmitter power levels are not reset after a connection is removed, then a feasible power set can be found faster and the power levels employed are smaller. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of time selective multipath fading on OFDM systems for broadband mobile applications

    Page(s): 332 - 334
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (72 KB)  

    The effects of time selective multipath fading are investigated for orthogonal frequency-division multiplexing (OFDM) systems in broadband mobile applications. Although in a multipath environment an OFDM system is very robust against frequency selective fading, it is very sensitive to time selective fading characteristics of the mobile channel, causing inter-carrier-interference and degrading system performance. To achieve a signal-to-interference ratio of 20 dB, the OFDM symbol duration must be less than 8% of the channel coherence time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On SOVA for nonbinary codes

    Page(s): 335 - 337
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (56 KB)  

    For binary codes, Fossorier et al. (see ibid., vol.2, p.137-9, 1998) have shown that the soft-output Viterbi algorithm (SOVA) becomes equivalent to the max-log-maximum a posteriori (MAP) algorithm after a modification. In this letter, we generalize such modified SOVA to nonbinary cases, motivated by the fact that the performance gap between the original SOVA and the max-log-MAP algorithm broadens in these cases, The equivalence between the two algorithms is proved in a more compact form. The modified SOVA requires only add-compare-select operations and is well suited for high-speed parallel implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List of reviewers

    Page(s): 338 - 340
    Save to Project icon | Request Permissions | PDF file iconPDF (14 KB)  
    Freely Available from IEEE
  • Author Index

    Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (191 KB)  
    Freely Available from IEEE
  • Subject Index

    Page(s): 3 - 11
    Save to Project icon | Request Permissions | PDF file iconPDF (210 KB)  
    Freely Available from IEEE

Aims & Scope

IEEE Communications Letters  is aimed at satisfying the need for rapid dissemination of information, offering a vehicle for authors to expose their results to be used in future developments. This ensures early recognition of work. 

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
George K. Karagiannidis
Aristotle University of Thessaloniki
Greece