686 research outputs found

    Non-recursive max* operator with reduced implementation complexity for turbo decoding

    Get PDF
    In this study, the authors deal with the problem of how to effectively approximate the max?? operator when having n > 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders. They show that, contrary to previous approaches, it is not necessary to apply the max?? operator recursively over pairs of values. Instead, a simple, yet effective, solution for the max?? operator is revealed having the advantage of being in non-recursive form and thus, requiring less computational effort. Hardware synthesis results for practical turbo decoders have shown implementation savings for the proposed method against the most recent published efficient turbo decoding algorithms by providing near optimal bit error rate (BER) performance

    Soft MIMO detection through sphere decoding and box optimization

    Full text link
    [EN] Achieving optimal detection performance with low complexity is one of the major challenges, mainly in multiple-input multiple-output (MIMO) detection. This paper presents three low-complexity Soft-Output MIMO detection algorithms that are based mainly on Box Optimization (BO) techniques. The proposed methods provide good performance with low computational cost using continuous constrained optimization techniques. The rst proposed algorithm is a non-optimal Soft-Output detector of reduced complexity. This algorithm has been compared with the Soft-Output Fixed Complexity (SFSD) algorithm, obtaining lower complexity and similar performance. The two remaining algorithms are employed in a turbo receiver, achieving the max-log Maximum a Posteriori (MAP) performance. The two Soft-Input Soft-Output (SISO) algorithms were proposed in a previous work for soft-output MIMO detection. This work presents its extension for iterative decoding. The SISO algorithms presented are developed and compared with the SISO Single Tree Search algorithm (STS), in terms of efficiency and computational cost. The results show that the proposed algorithms are more efficient for high order constellation than the STS algorithm.Simarro, MA.; García Mollá, VM.; Vidal Maciá, AM.; Martínez Zaldívar, FJ.; Gonzalez, A. (2018). Soft MIMO detection through sphere decoding and box optimization. Signal Processing. 145:48-58. https://doi.org/10.1016/j.sigpro.2017.11.010S485814

    MIMO-aided near-capacity turbo transceivers: taxonomy and performance versus complexity

    No full text
    In this treatise, we firstly review the associated Multiple-Input Multiple-Output (MIMO) system theory and review the family of hard-decision and soft-decision based detection algorithms in the context of Spatial Division Multiplexing (SDM) systems. Our discussions culminate in the introduction of a range of powerful novel MIMO detectors, such as for example Markov Chain assisted Minimum Bit-Error Rate (MC-MBER) detectors, which are capable of reliably operating in the challenging high-importance rank-deficient scenarios, where there are more transmitters than receivers and hence the resultant channel-matrix becomes non-invertible. As a result, conventional detectors would exhibit a high residual error floor. We then invoke the Soft-Input Soft-Output (SISO) MIMO detectors for creating turbo-detected two- or three-stage concatenated SDM schemes and investigate their attainable performance in the light of their computational complexity. Finally, we introduce the powerful design tools of EXtrinsic Information Transfer (EXIT)-charts and characterize the achievable performance of the diverse near- capacity SISO detectors with the aid of EXIT charts

    Approximate MIMO Iterative Processing with Adjustable Complexity Requirements

    Full text link
    Targeting always the best achievable bit error rate (BER) performance in iterative receivers operating over multiple-input multiple-output (MIMO) channels may result in significant waste of resources, especially when the achievable BER is orders of magnitude better than the target performance (e.g., under good channel conditions and at high signal-to-noise ratio (SNR)). In contrast to the typical iterative schemes, a practical iterative decoding framework that approximates the soft-information exchange is proposed which allows reduced complexity sphere and channel decoding, adjustable to the transmission conditions and the required bit error rate. With the proposed approximate soft information exchange the performance of the exact soft information can still be reached with significant complexity gains.Comment: The final version of this paper appears in IEEE Transactions on Vehicular Technolog
    corecore