default search action
Yan Xin 0002
Person information
- affiliation: Huawei Technologies Canada, Ottawa Research and Development Centre
- affiliation (former): University of Alberta
Other persons with the same name
- Yan Xin — disambiguation page
- Yan Xin 0001 — NEC Laboratories (and 2 more)
- Yan Xin 0003 — Jiangsu University, Department of Computer Science and Communication Engineering, Zhenjiang, China
- Yan Xin 0004 — Wuhan University of Technology, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Biwei Li, Xianbin Wang, Yan Xin, Edward Au:
Value of Service Maximization in Integrated Localization and Communication System Through Joint Resource Allocation. IEEE Trans. Commun. 71(8): 4957-4971 (2023) - [j10]Jiyang Bai, Xianbin Wang, Jie Mei, Yan Xin, Osama Aboul-Magd, Edward Au:
Hybrid Services QoS Enhancement by Joint Traffic and Access Management in Unsaturated IEEE 802.11ax Network. IEEE Trans. Netw. Sci. Eng. 10(6): 3281-3294 (2023) - 2020
- [j9]Ahmed Wagdy Shaban, Oussama Damen, Yan Xin, Edward Au:
Statistically-Aided Codebook-Based Hybrid Precoding for Millimeter Wave Channels. IEEE Access 8: 101500-101513 (2020) - [c7]Ahmed Wagdy Shaban, Oussama Damen, Yan Xin, Edward Au:
Statistically-Aided Codebook-Based Hybrid Precoding for mmWave Single-User MIMO Systems. ICC Workshops 2020: 1-6
2010 – 2019
- 2019
- [c6]Ming Gan, Yuchen Guo, Genadiy Tsodik, Yan Xin, Xun Yang, Edward Au, Osama Aboul-Magd:
Full Duplex for Next Generation of 802.11. PIMRC Workshops 2019: 1-6 - 2017
- [c5]Khalid Aldubaikhy, Qinghua Shen, Miao Wang, Wen Wu, Xuemin Shen, Osama Aboul-Magd, Yan Xin, Rob Sun, Edward Au:
MAC layer design for concurrent transmissions in millimeter wave WLANs. ICCC 2017: 1-6
2000 – 2009
- 2008
- [j8]Yan Xin, Ivan J. Fair:
Guided Scrambling Polynomials for Periodic Quotient Relationship Patterns. IEEE Trans. Inf. Theory 54(3): 1363-1367 (2008) - 2007
- [j7]Fengqin Zhai, Yan Xin, Ivan J. Fair:
DC-free trellis-based error-control codes. IET Commun. 1(6): 1170-1178 (2007) - 2006
- [j6]Yan Xin, Ivan J. Fair:
Multiple L-Shift Complementary Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(10): 2640-2648 (2006) - 2005
- [j5]Yan Xin, Ivan J. Fair:
Low-frequency performance of guided scrambling DC-free codes. IEEE Commun. Lett. 9(6): 537-539 (2005) - [j4]Fengqin Zhai, Yan Xin, Ivan J. Fair:
DC-free error-control block codes. IEEE Trans. Commun. 53(10): 1639-1647 (2005) - [c4]Fengqin Zhai, Yan Xin, Ivan J. Fair:
Dc-free convolutional codes and dc-free turbo codes. ICC 2005: 632-636 - [c3]Yan Xin, Ivan J. Fair:
Low complexity PTS approaches for PAPR reduction of OFDM signals. ICC 2005: 1991-1995 - 2004
- [j3]Yan Xin, Ivan J. Fair:
High-order spectral- multimode codes. IEEE Trans. Commun. 52(8): 1231-1237 (2004) - [j2]Yan Xin, Ivan J. Fair:
A performance metric for codes with a high-order spectral at zero frequency. IEEE Trans. Inf. Theory 50(2): 385-394 (2004) - [c2]Yan Xin, Ivan J. Fair:
Multiple-shift complementary sequences and their peak-to-average power ratio values. ISIT 2004: 121 - 2003
- [c1]Yan Xin, Ivan J. Fair:
Peak-to-average power ratio reduction of an OFDM signal using guided scrambling coding. GLOBECOM 2003: 2390-2394 - 2001
- [j1]Yan Xin, Ivan J. Fair:
Algorithms to enumerate codewords for DC2-constrained channels. IEEE Trans. Inf. Theory 47(7): 3020-3025 (2001)
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-01-21 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