Semi-exhaustive recursive block decoding method and device

A decoding algorithm and decoder technology, which is applied in the field of decoding received data signals, can solve problems such as disallowing and controlling diversity order, and achieve the effect of reducing complexity

Active Publication Date: 2017-08-25
INST MINES TELECOM
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0020] While existing sub-detection methods provide better performance than suboptimal linear and nonlinear joint decoding schemes, they do not allow control of the diversity order while achieving reduced complexity

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Semi-exhaustive recursive block decoding method and device
  • Semi-exhaustive recursive block decoding method and device
  • Semi-exhaustive recursive block decoding method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0078] Embodiments of the present invention provide sub-block decoding methods for decoding received signals according to semi-exhaustive and recursive methods. The sub-block decoding method and apparatus according to an embodiment of the present invention divides the information symbols contained in the received signal y according to the matrix partition with respect to the channel matrix H, which provides the information symbols s (K) N groups of (hereinafter also referred to as "blocks of information symbols"), k ranges from N to 1. This signal carries information symbols selected from a given set of values. The set of values ​​may be a finite and discrete set of values, such as the alphabet, or an alternative infinite set of values, such as an infinite lattice Z of dimension n n .

[0079] In one embodiment, the division of the information symbols contained in the received signal y corresponds to performing QR decomposition on the channel matrix H to obtain The divisio...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Embodiments of the invention provides a decoder for decoding a signal received through a transmission channel in a communication system, said signal carrying information symbols selected from a given alphabet and being associated with a signal vector, said transmission channel being represented by a channel matrix, wherein said decoder comprises : - a sub-block division unit (301) configured to divide the received signal vector into a set of sub-vectors in correspondence with a division of a matrix related to said channel matrix ; -a candidate set estimation unit (305) for recursively determining candidate estimates of sub-blocks of the transmitted signal corresponding to said sub-vectors, each estimate of a given sub-block being determined from at least one candidate estimate of the previously processed sub-blocks, wherein said candidate set estimation unit is configured to determine a set of candidate estimates for at least one sub-block of the transmitted signal by applying at least one iteration of a decoding algorithm using the estimates determined for the previously processed sub-blocks, the number of candidate estimates determined for said sub-block being strictly inferior to the cardinal of the alphabet and superior or equal to two, the decoder further comprising a signal estimation unit (306) for calculating an estimate of the transmitted signal from said candidate estimates determined for said sub-blocks.

Description

Background technique [0001] The present invention relates generally to digital communications, and in particular, the present invention relates to methods, systems and computer program products for decoding received data signals. [0002] Wireless communication systems have been experiencing accelerated growth in recent years, becoming a central component of modern modes of communication. [0003] Different wireless communication systems are now available, such as cellular and wireless ad-hoc networks adapting to single or multiple transmitter / receivers using single or multiple antennas, such as MIMO (Multiple Input Multiple Output) systems. A wireless MIMO communication system refers to a wireless link with multiple antennas on the transmitter side and receiver side. [0004] The significant development of MIMO systems over richly dispersed wireless channels is due to their ability to meet increasing demands in terms of communication reliability and data rates over wireless ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L1/00
CPCH04L1/0056H04L1/0091H04L25/0204H04L25/0246H04L25/03242H04L2025/03426H04L1/0021H04L1/0047H04L25/03197H03M7/3082H03M13/616H04W88/02
Inventor M-A·柯斯巴G·雷卡亚本-奥斯曼A·梅杰里
Owner INST MINES TELECOM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap