Low-Complexity Decoding Schemes for MIMO ¢â‚¬› ...PatentFactory-MIMO-01_06_20¢  LTE and LTE-advanced :

  • View
    1

  • Download
    0

Embed Size (px)

Text of Low-Complexity Decoding Schemes for MIMO ¢â‚¬›...

  • Low-Complexity Decoding Schemes for MIMO systems

    Ghaya Rekaya-Ben Othman rekaya@telecom-paristech.fr 


    June 2017

  • Patenting : my vision as an inventor

    Patent Factory : Feedback

    Sequential decoding

    2

    2

    2

    1

    2

    3

    Outline

    June 2017 1/41G. Rekaya-Ben Othman

    2

    4 Recursive Block decoding

  • Patenting : My Vision as an inventor

  • Patents ?

    It’s too complicated.

    It’s for compagnies not for academics.

    It’s a waste of time as it is never valorized.

    The patenting process is too long.

    It blocks research work.

    We are not used to do patents.

    June 2017 2/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Who talks about innovation and patents?

    June 2017 G. Rekaya-Ben Othman 3/41

    G. Rekaya-Ben Othman

    Lawyer

    Financial

    Ingenier

    Manger

    Economist

    Politicien

    But, what about Inventor ??

    Vision PF MIMO Sequential decoder Block decoder

  • Inventor Vision

    Everybody can make patents.

    It’s not limited to compagnies, and especially big companies.

    Patents are not just for GREAT IDEAS.

    Making a patent must be a reflex to protect its know-how.

    A patent is not an end in itself, but must be part of a personal or collective approach to innovation and creativity.

    June 2017 4/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • An inventor needs to be accompanied :

    Employer : help defining an approach to innovation and creativity.

    Lawyer : why and how to proceed.

    Patent engineer: report (ID), write the patent, inventor meetings, process follow-up.

    Inventor Vision !

    June 2017 5/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Why patenting ?

    By obligation (Standardization or Product Issues)

    For the patent premium

    Professional progress

    Future Valorization project

    For Academics

    Combining theoretical and applied research : A First step for Innovation.

    June 2017 6/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • • •

    Life stages of an inventor

    Stage 1 First Patents

    How to detect the idea!

    How to make a patent?

    Steps to make patents

    Stage 2 5 to 10 Patents

    Become an Inventor

    Identify missing results

    Enriching Patent Groups

    Methodology for creating a patent family

    Stage 3 >10 Patents

    Become an Expert

    Structure patents by classes or groups

    Identify technologies

    Identify compagnies

    On the way to Valorization

    June 2017 7/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Patent Factory : MIMO Decoders

  • Optical fiber communications

    Sink node

    Remote Control Center

    Sensor nodes

    Wireless sensor network

    Multiple antennas systems

    MIMO channel

    Multi-user communications

    Vision PF MIMO Sequential decoder Block decoder

    Examples of applications of MIMO technologies

    June 2017 8/41G. Rekaya-Ben Othman

  • Proposed solutions are implementable in wireless standards products such as:

    WiFi (IEEE 802.11n) :

    • MIMO spatial streams up to 8x8 MIMO configurations.

    • Commonly used MIMO configurations are 2 x 2,  2 x3 and 3 x 2, with high

    density modulations (up to 256-QAM).

    LTE and LTE-advanced : • Used MIMO configurations are : in the Downlink 4x4 and 8x8, in the Uplink

    2x4 and 4x4.

    • MU-MIMO configurations are also considered.

    5G

    • Deployable systems must support MIMO and MU-MIMO communications.

    • Massive MIMO

    MIMO Decoding

    Potential Standars

    June 2017 9/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • CHALLENGE: meet the target QoS specifications (fixed complexity/ performance) for any application implementable in any MIMO configuration.

    MIMO Decoding

    MIMO transmission chain

    June 2017 10/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Inputs

    5 Patents

    Outputs

    14 patents, 1 in progress

    8 Publications, 2 journals in preparation

    Start discussions with some companies for valorisation

    Patent Factory results

    June 2017 11/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Family 1: Preprocessing

    Family 2: Sequential decoding

    Family 3: Fixed

    Complexity

    Family 4: Block

    Decoding

    Family 5: General Tools

    New decoding schemes: 5 Families

    June 2017 12/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Problem

    Proposed Solutions New techniques to improve the quality of the channel matrix before decoding:

    • Algebraic reduction • Augmented LLL reduction • Reordering of channel matrix to control zero localization

    Patents Outcomes

    3 filed patents

    Worst channel realization can induce very high decoding complexity.

    MIMO Decoding

    Family 1: Preprocessing

    June 2017 13/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Patents Outcomes 6 filed patents

    Problem

    The complexity of the tree search phase increases function of the number of transmit and receive antennas and the constellation size.

    Proposed Solutions New decoding methods allowing the generation of limited tree search. • SB-Stack (Hard output and Soft output) • Zig-zag Stack • Enhanced initial radius selection methods • Parameterized sequential decoding (level, block-dependent bais parameter)

    1 idea in progress

    Family 2: Sequential decoding

    June 2017 G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

    14/41

  • Patents Outcomes 2 filed patents

    Problem For real time applications, a fixed decoding complexity is required.

    Proposed Solutions New methods allowing to have fixed decoding time with guaranteed performance.

    • Stack reordering for early termination • Anticipated termination

    Family 3: Fixed Complexity

    June 2017 15/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Patents Outcomes

    5 filed patents

    Problem For very large decoding systems dimension, a parallelization of some decoding process could be a very good hardware solution.

    Proposed Solutions A judicious division of the decoding system is proposed based on variant parameters and criterions.

    • Block division to ensure an order of diversity • Block division to reduce error propagation • Block division to reduce decoding complexity for each block • Semi-exhaustive recursive decoding

    Family 4: Block Decoding

    June 2017 16/41G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

  • Patents Outcomes

    3 Filed patents

    Problem

    Reduce the overall decoding complexity, by considering all the decoding chain.

    Proposed Solutions

    • Adaptive decoding • MAP decoding using augmented lattice • Design criterion for low-complexity decodable Space-Time Codes.

    We propose new tools/methods to enhance the decoding chain and offer the best complexity/performance tradeoff. These methods are available for all the presented ideas in the four patent groups.

    Family 5: General ideas

    June 2017 G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

    17/41

  • Example 1 of a decoding chain:

    Example 2 of a decoding chain:

    Algebraic Reduction

    SB-Stack

    or

    Zig-Zag Stack

    Anticipated Termination

    or

    Early Termination

    Block Division Parametrized SB-Stack

    for each Block

    Decoding Chain: Families association

    June 2017 G. Rekaya-Ben Othman

    Vision PF MIMO Sequential decoder Block decoder

    18/41

  • Theoretical Validation

    Numerical validation

    Some results are validated by a theoretical study, through the derivation of the error probability.

    Formulas of some parameters and criterion are derived.

    Most of the ideas are validated by simulation, through a program C simulator. Some others are under validation.

    Complexity is counted as the number of multiplications.

    Numerical simulations give a very reliable compl