default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChunhui Liu 0003
Person information
- affiliation: RWTH Aachen University, Institute for Theoretical Information Technology, Germany
Other persons with the same name
- Chunhui Liu — disambiguation page
- Chunhui Liu 0001 — Caritas Institute of Higher Education, Hong Kong (and 3 more)
- Chunhui Liu 0002
![[0000-0001-6707-5187]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-6707-5187")
— ByteDance, Beijing, China (and 2 more) - Chunhui Liu 0004 — Beihang University, Unmanned Systems Research Institute, Beijing, China
- Chunhui Liu 0005 — Chongqing University, College of Computer Science, Key Laboratory of Dependable Service Computing in Cyber Physical Society, Chongqing, China
- Chunhui Liu 0006 — Zhengzhou University, School of Management, Zhengzhou, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j1]Chunhui Liu, Anke Schmeink, Rudolf Mathar:
Equal rate resource allocation for multiuser OFDM. EURASIP J. Wirel. Commun. Netw. 2012: 344 (2012)- 2011
- [c11]Peng Wang, Chunhui Liu, Rudolf Mathar:
Dynamic fractional frequency reused proportional fair in time and frequency scheduling in OFDMA networks. ISWCS 2011: 745-749 - [c10]Chunhui Liu, Peng Wang, Anke Schmeink, Rudolf Mathar:
Joint BS selection and subcarrier assignment for multicell heterogeneous OFDM unicasting. PIMRC 2011: 1356-1360 - 2010
- [c9]Chunhui Liu, Anke Schmeink, Rudolf Mathar:
Constant-Rate Power Allocation under Constraint on Average BER in Adaptive OFDM Systems. ICC 2010: 1-5
2000 – 2009
- 2009
- [c8]Chunhui Liu, Anke Schmeink, Rudolf Mathar:
Dual Optimal Resource Allocation for Heterogeneous Transmission in OFDMA Systems. GLOBECOM 2009: 1-6 - [c7]Chunhui Liu, Anke Schmeink, Rudolf Mathar:
Power Allocation for Broadcasting in Multiuser OFDM Systems with Sublinear Complexity. ICC 2009: 1-6 - [c6]Chunhui Liu, Anke Schmeink, Rudolf Mathar:
A linear-complexity resource allocation method for heterogeneous multiuser OFDM downlink. PIMRC 2009: 2591-2596 - [c5]Chunhui Liu, Georg Böcherer, Rudolf Mathar:
Accelerating Resource Allocation for OFDMA Downlink with CNR Variation Over Users. VTC Spring 2009 - 2008
- [c4]Tianbin Wo, Chunhui Liu, Peter Adam Hoeher:
Graph-Based Soft Channel and Data Estimation for MIMO Systems with Asymmetric LDPC Codes. ICC 2008: 620-624 - [c3]Chunhui Liu, Rudolf Mathar:
Optimal and efficient bit loading for OFDM in the presence of channel uncertainty. ISWCS 2008: 11-15 - [c2]Chunhui Liu, Daniel Bielefeld, Rudolf Mathar:
Optimal rate and power allocation for OFDM in the presence of channel uncertainty. PIMRC 2008: 1-5 - [c1]Chunhui Liu, Rudolf Mathar:
Fast and efficient power and rate allocation for multiuser OFDM downlink. PIMRC 2008: 1-5
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 2025-12-28 00:20 CET 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:
