SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Honary Bahram) "

Search: WFRF:(Honary Bahram)

  • Result 1-3 of 3
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Höst, Stefan, et al. (author)
  • Cascaded convolutional codes
  • 1998
  • In: Communication and Coding. - 0863802389 ; , s. 10-29
  • Book chapter (other academic/artistic)
  •  
2.
  • Ma, Zheng, et al. (author)
  • Quasi-Maximum-Likelihood Multiple-Symbol Differential Detection for Time-Varying Rayleigh Fading Channel
  • 2009
  • In: Electronics Letters. - : Institution of Engineering and Technology (IET). - 0013-5194 .- 1350-911X. ; 45:22, s. 1127-1128
  • Journal article (peer-reviewed)abstract
    • The maximum-likelihood multiple-symbol differential detector (ML-MSDD) has better bit-error-rate performance than many other detectors for differential modulation. Unfortunately, the computational complexity of ML-MSDD quickly becomes prohibitive as the observation window size grows. While low-complexity MSDD algorithms for the time-invariant Rayleigh fading channel have been considered before, there is a need for low-complexity MSDD algorithms for general time-varying Rayleigh fading channels. A polynomial-time complexity approach called semi-definite relaxation (SDR) is employed to achieve differential detection with near maximum-likelihood (ML) performance. The proposed SDR quasi-maximum-likelihood (QML) multiple-symbol differential detection (SDR-QML-MSDD) is efficient in that its complexity is polynomial in the observation window size, even in the worst case, while it exhibits almost the same performance as ML-MSDD does.
  •  
3.
  • Ma, Zheng, et al. (author)
  • Stopping Criterion for Complexity Reduction of Sphere Decoding
  • 2009
  • In: IEEE Communications Letters. - 1089-7798 .- 1558-2558. ; 13:6, s. 402-404
  • Journal article (peer-reviewed)abstract
    • Maximum-likelihood detection in MIMO communications amounts to solving a least-squares problem with a constellation (alphabet) constraint. One popular method that can be used to solve this problem is sphere decoding. We show in this letter that by employing a simple stopping criterion, it is possible to significantly reduce the complexity of sphere decoding over a wide range of SNRs, without a noticeable performance degradation. Specifically, simulation results demonstrate that a 10%-90% reduction of the average complexity could be achieved.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-3 of 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view