default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYongmei Dai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j7]Xuebin Wu, Yongmei Dai, Ying Wang, Zhiyuan Yan:
Efficient Ordering Schemes for High-Throughput MIMO Detectors. J. Signal Process. Syst. 64(1): 61-74 (2011)- 2010
- [c13]Xuebin Wu, Yongmei Dai, Zhiyuan Yan:
List based soft-decision MIMO detection by the MCTS algorithm. ISCAS 2010: 3537-3540
2000 – 2009
- 2009
- [j6]Yongmei Dai, Zhiyuan Yan:
Memory-Constrained Tree Search Detection and New Ordering Schemes. IEEE J. Sel. Top. Signal Process. 3(6): 1026-1037 (2009) - [j5]Yongmei Dai, Zhiyuan Yan, Ning Chen:
Memory-efficient and high-throughput decoding of quasi-cyclic LDPC codes. IEEE Trans. Commun. 57(4): 879-883 (2009) - 2008
- [j4]Yongmei Dai, Ning Chen, Zhiyuan Yan:
Memory Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes. IEEE Trans. Circuits Syst. I Regul. Pap. 55-I(9): 2898-2911 (2008) - [j3]Yongmei Dai, Zhiyuan Yan, Ning Chen:
Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes. IEEE Trans. Very Large Scale Integr. Syst. 16(5): 565-578 (2008) - [c12]Yongmei Dai, Zhiyuan Yan:
Memory-constrained ML-optimal tree search detection. CISS 2008: 1037-1041 - [c11]Yongmei Dai, Zhiyuan Yan:
A modified MMSE-SD soft detector for coded MIMO-OFDM systems. ISCAS 2008: 312-315 - [c10]Yongmei Dai, Zhiyuan Yan:
Efficient ordering schemes for sphere decoder. SiPS 2008: 146-151 - 2006
- [c9]Yongmei Dai, Zhiyuan Yan, Ning Chen:
High-Throughput Turbo-Sum-Product Decoding of QC LDPC Codes. CISS 2006: 839-844 - [c8]Yongmei Dai, Zhiyuan Yan, Ning Chen:
Parallel turbo-sum-product decoder architecture for quasi-cyclic LDPC codes. ACM Great Lakes Symposium on VLSI 2006: 312-315 - [c7]Ning Chen, Yongmei Dai, Zhiyuan Yan:
Partly Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes. SiPS 2006: 220-225 - [c6]Sumei Sun
, Yongmei Dai, Zhongding Lei, Kenichi Higuchi, Hiroyuki Kawai:
Pseudo-Inverse MMSE Based QRD-M Algorithm for MIMO OFDM. VTC Spring 2006: 1545-1549 - 2005
- [c5]Yongmei Dai, Zhiyuan Yan:
Optimal overlapped message passing decoding for quasi-cyclic low-density parity-check codes. GLOBECOM 2005: 5 - [c4]Yongmei Dai, Sumei Sun, Zhongding Lei:
A Comparative Study of QRD-M Detection and Sphere Decoding for MIMO-OFDM Systems. PIMRC 2005: 186-190 - [c3]Zhongding Lei, Yongmei Dai, Sumei Sun:
Near optimal list MIMO detection. PIMRC 2005: 2441-2446 - 2004
- [j2]Yongmei Dai, Zhongding Lei, Sumei Sun:
Ordered array processing for space-time coded systems. IEEE Commun. Lett. 8(8): 526-528 (2004) - [c2]Yongmei Dai, Sumei Sun, Zhongding Lei:
Performance comparison between coded V-BLAST and GSTTC MIMO-OFDM systems. PIMRC 2004: 2581-2585 - [c1]Yongmei Dai, Zhongding Lei, Sumei Sun:
Iterative interference cancellation and ordered array processing for groupwise space time trellis coded (GSTTC) systems. WCNC 2004: 2323-2328 - 2002
- [j1]Tjeng Thiang Tjhung, Xiaoming Xue, Yongmei Dai, Kar Ngai Wong, Ping He:
An adaptive asynchronous CDMA multiuser detector for frequency-selective Rayleigh fading channels. IEEE Trans. Veh. Technol. 51(4): 788-793 (2002)
Coauthor Index
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-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
