Schnorr-euchner expansions and their fast implementations
US10020852B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 3, 2014 |
| Grant date | Jul 10, 2018 |
| Priority date | — |
| Expiry date | Sep 3, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/51
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
Methods and apparatus reducing or eliminating the number of multipliers in Schnorr-Euchner expansion algorithms are disclosed. Methods and apparatus for implementing Schnorr-Euchner expansion algorithms with a reduced number of multipliers or without any multipliers are also disclosed. Also disclosed is a Schnorr-Euchner expansion method for a multiple-input multiple-output communication system. The method includes receiving, by a plurality of input terminals, a plurality of input signals. The method also includes detecting a symbol transmitted by each input signal. The detection includes identifying a list of possible symbols that may be transmitted by each input signal. A cost value for each possible symbol is determined based on a cost function. The cost function is implemented without requiring a multiplier. The possible symbol with a lowest cost value is identified as the transmitted symbol.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.