default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPak-Chung Ching
- > Home > Persons > Pak-Chung Ching
Publications
- 2015
[j54]Ran Cai, Jian-Kang Zhang, Timothy N. Davidson
, Wei Zhang, Kon Max Wong, Pak-Chung Ching:
A Power Allocation Strategy for Multiple Poisson Spectrum-Sharing Networks. IEEE Trans. Wirel. Commun. 14(4): 1785-1799 (2015)- 2014
- [c116]Ran Cai, Wei Zhang, P. C. Ching, Timothy N. Davidson, Jian-Kang Zhang:
Performance of partial zero-forcing beamforming in large random spectrum sharing networks. ICASSP 2014: 6989-6993 - [c114]Ran Cai, Pak-Chung Ching, Timothy N. Davidson:
Tradeoff analysis of partial zero-forcing beamforming in large random spectrum sharing networks. SPAWC 2014: 75-79 - 2013
- [c113]Ran Cai, Jian-Kang Zhang, Timothy N. Davidson, Kon Max Wong, P. C. Ching:
Power control for multiple spectrum-sharing networks under random geometric topologies. ICASSP 2013: 4809-4813 - 2006
- [j35]Wing-Kin Ma, Ba-Ngu Vo, Timothy N. Davidson, Pak-Chung Ching:
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations. IEEE Trans. Signal Process. 54(2): 738-751 (2006) - 2005
- [c77]Wing-Kin Ma, Ba-Ngu Vo, Timothy N. Davidson, Pak-Chung Ching:
On implementing the blind ML receiver for orthogonal space-time block codes. ICASSP (3) 2005: 437-440 - 2004
- [j28]Wing-Kin Ma, Timothy N. Davidson, Kon Max Wong, Pak-Chung Ching:
A block alternating likelihood maximization approach to multiuser detection. IEEE Trans. Signal Process. 52(9): 2600-2611 (2004) - [c67]Wing-Kin Ma, P. C. Ching, Timothy N. Davidson, Ba-Ngu Vo:
Blind symbol identifiability of orthogonal space-time block codes. ICASSP (4) 2004: 821-824 - 2003
- [c60]Wing-Kin Ma, Pak-Chung Ching, Timothy N. Davidson, Xiang-Gen Xia:
Blind maximum-likelihood decoding for orthogonal space-time block codes: a semidefinite relaxation approach. GLOBECOM 2003: 2094-2098 - 2002
- [j20]Wing-Kin Ma, Timothy N. Davidson, Kon Max Wong, Zhi-Quan Luo, Pak-Chung Ching:
Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA. IEEE Trans. Signal Process. 50(4): 912-922 (2002) - [c52]Wing-Kin Ma, Timothy N. Davidson, Kon Max Wong, Pak-Chung Ching:
Multiuser detection for asynchronous CDMA using block coordinate ascent and semi-definite relaxation. ICASSP 2002: 2309-2308 - 2001
- [c46]Wing-Kin Ma, Timothy N. Davidson, Kon Max Wong, Zhi-Quan Luo, Pak-Chung Ching:
Efficient quasi-maximum-likelihood multiuser detection by semi-definite relaxation. ICC 2001: 6-10 - 2000
- [j17]Kon Max Wong, Jiangfeng Wu, Timothy N. Davidson, Qu Jin, Pak-Chung Ching:
Performance of wavelet packet-division multiplexing in impulsive and Gaussian noise. IEEE Trans. Commun. 48(7): 1083-1086 (2000)
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-09-22 00:38 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:
