default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKa Shun Carson Pun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j7]Ka Shun Carson Pun, Truong Q. Nguyen:
Widely Linear Filter Bank Equalizer for Real STBC. IEEE Trans. Signal Process. 56(9): 4544-4548 (2008)- 2007
- [c8]Ka Shun Carson Pun, Truong Q. Nguyen:
Design of Oversampled Filter Bank Based Widely Linear OQPSK Equalizer. ICASSP (3) 2007: 861-864 - 2005
- [j6]Shing-Chow Chan, Haihua Chen, C. K. S. Pun:
The design of digital all-pass filters using second-order cone programming (SOCP). IEEE Trans. Circuits Syst. II Express Briefs 52-II(2): 66-70 (2005) - 2004
- [j5]Shing-Chow Chan, C. K. S. Pun, Ka-Leung Ho:
A new method for designing FIR filters with variable characteristics. IEEE Signal Process. Lett. 11(2): 274-277 (2004) - [j4]Shing-Chow Chan, C. K. S. Pun, Ka-Leung Ho:
The design of a class of perfect reconstruction two-channel FIR linear-phase filterbanks and wavelets bases using semidefinite programming. IEEE Signal Process. Lett. 11(2): 297-300 (2004) - [j3]Ka Shun Carson Pun, Truong Q. Nguyen:
A novel and efficient design of multidimensional PR two-channel filter banks with hourglass-shaped passband support. IEEE Signal Process. Lett. 11(3): 345-348 (2004) - [j2]Shing-Chow Chan, C. K. S. Pun, Ka-Leung Ho:
New design and realization techniques for a class of perfect reconstruction two-channel FIR filterbanks and wavelets bases. IEEE Trans. Signal Process. 52(7): 2135-2141 (2004) - [c7]Ka Shun Carson Pun, Truong Q. Nguyen:
A novel boundary handling scheme for arbitrary object shape in video and image compression. ICIP 2004: 1069-1072 - 2003
- [j1]Ka Shun Carson Pun, Yik-Chung Wu
, S. C. Chan, Ka-Leung Ho:
On the design and efficient implementation of the Farrow structure. IEEE Signal Process. Lett. 10(7): 189-192 (2003) - [c6]Ka Shun Carson Pun, Shing-Chow Chan:
The minimax design of digital all-pass filters with prescribed pole radius constraint using semidefinite programming (SDP). ICASSP (6) 2003: 413-416 - 2002
- [c5]Shing-Chow Chan, Ka Shun Carson Pun, Ka-Leung Ho:
Efficient implementation of wideband multibeam forming network using SOPOT coefficients and multiplier block. DSP 2002: 243-246 - [c4]Shing-Chow Chan, Ka Shun Carson Pun, Ka-Leung Ho:
The design of a class of prefect reconstruction two-channel FIR and wavelets filterbanks using constrained least squares method and semidefinite programming. DSP 2002: 497-500 - [c3]Shing-Chow Chan, C. K. S. Pun:
On the design of digital broadband beamformer for uniform circular array with frequency invariant characteristics. ISCAS (1) 2002: 693-696 - 2001
- [c2]Shing-Chow Chan, Ka Shun Carson Pun, Ka-Leung Ho:
On the design and implementation of a class of multiplierless two-channel 1D and 2D nonseparable PR FIR filterbanks. ICIP (2) 2001: 241-244 - [c1]C. K. S. Pun, Shing-Chow Chan, Ka-Leung Ho:
Efficient 1D and circular symmetric 2D FIR filters with variable cutoff frequencies using the Farrow structure and multiplier-block. ISCAS (2) 2001: 561-564
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 2024-04-25 05:50 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:
