Остановите войну!
for scientists:
default search action
Pak-Chung Ching
- > Home > Persons > Pak-Chung Ching
Publications
- 2019
- [c134]Man-Wai Un, Mingjie Shao, Wing-Kin Ma, P. C. Ching:
Deep Mimo Detection Using ADMM Unfolding. DSW 2019: 333-337 - 2017
- [c121]Man-Wai Un, Wing-Kin Ma, Pak-Chung Ching:
Joint transmit beamforming optimization and uplink/downlink user selection in a full-duplex multi-user MIMO system. ICASSP 2017: 3639-3643 - 2013
- [j52]Ye Yang, Qiang Li, Wing-Kin Ma, Jianhua Ge, P. C. Ching:
Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers. IEEE Signal Process. Lett. 20(1): 35-38 (2013) - [c108]Ye Yang, Tsung-Hui Chang, Jianhua Ge, Wing-Kin Ma, P. C. Ching:
Achieving full cooperative and frequency diversity in bit-interleaved coded two-way relay networks. WCNC 2013: 3254-3259 - 2012
- [j50]Ye Yang, Tsung-Hui Chang, Wing-Kin Ma, Jianhua Ge, Chong-Yung Chi, Pak-Chung Ching:
Noncoherent Bit-Interleaved Coded OSTBC-OFDM with Maximum Spatial-Frequency Diversity. IEEE Trans. Wirel. Commun. 11(9): 3335-3347 (2012) - 2011
- [j48]Feng Tian, Wei Zhang, Wing-Kin Ma, Pak-Chung Ching, H. Vincent Poor:
An Effective Distributed Space-Time Code for Two-Path Successive Relay Network. IEEE Trans. Commun. 59(8): 2254-2263 (2011) - 2010
- [j47]Feng Tian, Xiang-Gen Xia, Wing-Kin Ma, Pak-Chung Ching:
On the Full Diversity Property of A Space-Frequency Code Family with Multiple Carrier Frequency Offsets in Cooperative Communication Systems. J. Commun. 5(4): 317-331 (2010) - [c102]Feng Tian, Wei Zhang, Wing-Kin Ma, Pak-Chung Ching:
Distributed Space-Time Coding for Two-Path Successive Relaying. GLOBECOM 2010: 1-5 - 2009
- [j45]Feng Tian, Xiang-Gen Xia, Pak-Chung Ching, Wing-Kin Ma:
Signal Detection in a Space-Frequency Coded Cooperative Communication System With Multiple Carrier Frequency Offsets by Exploiting Specific Properties of the Code Structure. IEEE Trans. Veh. Technol. 58(7): 3396-3409 (2009) - [c97]Feng Tian, Xiang-Gen Xia, Wing-Kin Ma, Pak-Chung Ching:
Full diversity under multiple carrier frequency offsets of a family of space-frequency codes. ICASSP 2009: 2733-2736 - 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) - [c81]Wing-Kin Ma, Chong-Yung Chi, P. C. Ching:
Extended Differential Unitary Space-Time Modulation: A Non-Coherent Scheme with Error Penalty Less Than 3DB. ICASSP (4) 2006: 529-532 - 2005
- [c75]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
- [j30]Wing-Kin Ma, Pak-Chung Ching, Ba-Ngu Vo:
Crosstalk resilient interference cancellation in microphone arrays using Capon beamforming. IEEE Trans. Speech Audio Process. 12(5): 468-477 (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) - [j27]Wing-Kin Ma, Pak-Chung Ching, Zhi Ding:
Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems. IEEE Trans. Signal Process. 52(10): 2862-2872 (2004) - [c68]Wei Zhang, Xiang-Gen Xia, P. C. Ching, Wing-Kin Ma:
On the number of pilots for OFDM system in multipath fading channels. ICASSP (4) 2004: 381-384 - [c65]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
- [j26]Wing-Kin Ma, Pak-Chung Ching:
Asymptotic minimum bit error rate property of maximum-likelihood multiuser detection. IEEE Commun. Lett. 7(9): 425-427 (2003) - [c58]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 - [c57]Wing-Kin Ma, Pak-Chung Ching:
Robust interference suppression and blind speech beamforming in room reverberant environments. ICASSP (5) 2003: 493-496 - 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) - [c50]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
- [j19]Wing-Kin Ma, Kon Max Wong, Pak-Chung Ching:
On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems. IEEE Trans. Inf. Theory 47(7): 3049-3053 (2001) - [c44]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
- [c38]Wing-Kin Ma, P. C. Ching, Kon Max Wong:
Maximum likelihood detection for multicarrier systems employing non-orthogonal pulse shapes. ICASSP 2000: 2489-2492
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 02:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint