Остановите войну!
for scientists:
default search action
Ming Liu 0010
- > Home > Persons > Ming Liu 0010
Publications
- 2016
- [j5]Rida El Chall, Fabienne Nouvel, Maryline Hélard, Ming Liu:
Performance and Complexity Evaluation of Iterative Receiver for Coded MIMO-OFDM Systems. Mob. Inf. Syst. 2016: 7642590:1-7642590:22 (2016) - [c11]Rida El Chall, Fabienne Nouvel, Maryline Hélard, Yvan Kokar, Ming Liu:
Towards efficient design of fixed-point iterative receiver for coded MIMO-OFDM systems. ICT 2016: 1-5 - 2015
- [j4]Rida El Chall, Fabienne Nouvel, Maryline Hélard, Ming Liu:
Iterative receivers combining MIMO detection with turbo decoding: performance-complexity trade-offs. EURASIP J. Wirel. Commun. Netw. 2015: 69 (2015) - [j3]Ming Liu, Jean-François Hélard, Maryline Hélard, Matthieu Crussière:
Towards the Next Generation Video Broadcasting: Improved Performance Using Distributed MIMO. Wirel. Pers. Commun. 84(4): 2635-2649 (2015) - [c8]Mohamad Maaz, Maryline Hélard, Philippe Mary, Ming Liu:
Performance Analysis of Time-Reversal Based Precoding Schemes in MISO-OFDM Systems. VTC Spring 2015: 1-6 - 2014
- [j2]Ming Liu, Matthieu Crussière, Maryline Hélard, Jean-François Hélard:
Achieving low-complexity maximum-likelihood detection for the 3D MIMO code. EURASIP J. Wirel. Commun. Netw. 2014: 20 (2014) - [c7]Rida El Chall, Fabienne Nouvel, Maryline Hélard, Ming Liu:
Low complexity k-best based iterative receiver for MIMO systems. ICUMT 2014: 451-455 - [i8]Ming Liu, Maryline Hélard, Jean-François Hélard, Matthieu Crussière:
A Fast Decodable Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems. CoRR abs/1401.1206 (2014) - [i7]Ming Liu, Jean-François Hélard, Matthieu Crussière, Maryline Hélard:
Reduced-complexity maximum-likelihood decoding for 3D MIMO code. CoRR abs/1401.1381 (2014) - [i6]Ming Liu, Matthieu Crussière, Maryline Hélard, Jean-François Hélard:
Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code. CoRR abs/1401.3112 (2014) - 2013
- [c6]Ming Liu, Matthieu Crussière, Maryline Hélard, Jean-François Hélard:
Distributed MIMO schemes for the future digital video broadcasting. ICT 2013: 1-5 - [c5]Ming Liu, Maryline Hélard, Jean-François Hélard, Matthieu Crussière:
A fast decodable full-rate STBC with high coding gain for 4 × 2 MIMO systems. PIMRC 2013: 677-681 - [c4]Ming Liu, Jean-François Hélard, Matthieu Crussière, Maryline Hélard:
Reduced-complexity maximum-likelihood decoding for 3D MIMO code. WCNC 2013: 4015-4020 - 2012
- [c3]Ming Liu, Matthieu Crussière, Maryline Hélard, Jean-François Hélard, Youssef Nasser:
Enhanced mobile digital video broadcasting with distributed space-time coding. ICC 2012: 6971-6976 - [i4]Ming Liu, Maryline Hélard, Matthieu Crussière, Jean-François Hélard:
Distributed MIMO coding scheme with low decoding complexity for future mobile TV broadcasting. CoRR abs/1212.2342 (2012) - [i2]Ming Liu, Matthieu Crussière, Maryline Hélard, Jean-François Hélard, Youssef Nasser:
Enhanced Mobile Digital Video Broadcasting with Distributed Space-Time Coding. CoRR abs/1212.2345 (2012)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-19 21:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint