![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Guangzeng Feng
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c7]Yaolian Song, Guangzeng Feng, Jingmin Tang:
Power efficiency maximization based on cognitive relay transmission. CHINACOM 2012: 446-450 - 2010
- [j6]Xuelan Zou, Weiyan Liu, Guangzeng Feng:
Performance of iteratively decoded bit-interleaved coded modulation with chaos based interleaving strategies. Sci. China Inf. Sci. 53(4): 833-841 (2010)
2000 – 2009
- 2009
- [j5]Xin Wang, Guangzeng Feng:
Performance analysis of RLS linearly constrained constant modulus algorithm for multiuser detection. Signal Process. 89(2): 181-186 (2009) - 2008
- [j4]Guangwen Li, Guangzeng Feng:
Information Theory Generalised reliability-based syndrome decoding of LDPC codes. Eur. Trans. Telecommun. 19(8): 873-877 (2008) - [c6]Xin Wang, Guangzeng Feng:
Adapting Constant Modulus Algorithm for Phase Modulation Signals. ICN 2008: 584-587 - [i3]Guangwen Li, Guangzeng Feng:
Modified Multi-bit Flipping Decoding Algorithm for Low-density Parity-check Codes. CoRR abs/0801.1208 (2008) - 2007
- [j3]Lianggui Liu, Guangzeng Feng:
Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks. Wirel. Pers. Commun. 41(3): 393-405 (2007) - [c5]Xuelan Zou, Guangzeng Feng:
Performance Comparison of Iterative Decoding Algorithm Using the Extrinsic Information Transfer Chart. ICN 2007: 63 - [c4]Guangwen Li, Guangzeng Feng:
Weighted IS Method of Estimating FER of LDPC Codes in High SNR Region. ICN 2007: 91 - [i2]Guangwen Li, Guangzeng Feng:
Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for LDPC Codes. CoRR abs/0710.1589 (2007) - [i1]Guangwen Li, Guangzeng Feng:
Reliability-based syndrome decoding of LDPC codes. CoRR abs/0710.5230 (2007) - 2005
- [c3]Lianggui Liu, Guangzeng Feng:
A Novel Ant Colony Based QoS-Aware Routing Algorithm for MANETs. ICNC (3) 2005: 457-466 - [c2]Lianggui Liu, Guangzeng Feng:
A Novel Heuristic Routing Algorithm Using Simulated Annealing in Ad Hoc Networks. Panhellenic Conference on Informatics 2005: 849-857 - [c1]Lianggui Liu, Guangzeng Feng:
Research on Multi-constrained QoS Routing Scheme Using Mean Field Annealing. PDCAT 2005: 181-185 - 2001
- [j2]Changjiang Xu, Guangzeng Feng, Kyung Sup Kwak:
A modified constrained constant modulus approach to blind adaptive multiuser detection. IEEE Trans. Commun. 49(9): 1642-1648 (2001) - 2000
- [j1]Changjiang Xu, Guangzeng Feng:
Comments on "A linearly constrained constant modulus approach to blind adaptive multiuser interference suppression". IEEE Commun. Lett. 4(9): 280-282 (2000)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint