| 1. |
- Höst, Stefan, et al.
(författare)
-
Cascaded convolutional codes
- 1998
-
Ingår i: Communication and Coding. - 0863802389 ; , s. 10-29
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)
|
|
| 2. |
- Ma, Zheng, et al.
(författare)
-
Quasi-Maximum-Likelihood Multiple-Symbol Differential Detection for Time-Varying Rayleigh Fading Channel
- 2009
-
Ingår i: Electronics Letters. - : Institution of Engineering and Technology (IET). - 0013-5194 .- 1350-911X. ; 45:22, s. 1127-1128
-
Tidskriftsartikel (refereegranskat)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.
(författare)
-
Stopping Criterion for Complexity Reduction of Sphere Decoding
- 2009
-
Ingår i: IEEE Communications Letters. - 1089-7798 .- 1558-2558. ; 13:6, s. 402-404
-
Tidskriftsartikel (refereegranskat)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.
|
|
