default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNing Chen 0004
Person information
- affiliation: Lehigh University, Department of Electrical and Computer Engineering, Bethlehem, PA, USA
Other persons with the same name
- Ning Chen — disambiguation page
- Ning Chen 0001 — InteliFusion Technologies, China (and 1 more)
- Ning Chen 0002
![[0000-0002-6742-0048]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6742-0048")
— Tsinghua University, TNList / Tsinghua-Fuzhou Institute for Data Technology, Beijing, China - Ning Chen 0003 — Henan Polytechnic University, College of Computer Science and Technology, China (and 1 more)
- Ning Chen 0005 — Nanyang Technological University, Division of Mathematical Sciences, Singapore (and 1 more)
- Ning Chen 0006 — TU Munich, Institute for Electronic Design Automation, Germany
- Ning Chen 0007 — East China University of Science and Technology, School of Information Science & Engineering, Shanghai, China (and 1 more)
- Ning Chen 0008 — City University of Hong Kong, Hong Kong, SAR, China (and 2 more)
- Ning Chen 0009 — Central South University, School of Automation, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j8]Ning Chen, Zhiyuan Yan, Maximilien Gadouleau, Ying Wang, Bruce W. Suter:
Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control. IEEE Trans. Very Large Scale Integr. Syst. 20(2): 296-309 (2012)- 2011
- [j7]Xuebin Wu, Meghanad D. Wagh, Ning Chen, Ying Wang, Zhiyuan Yan:
Composite Cyclotomic Fourier Transforms With Reduced Complexities. IEEE Trans. Signal Process. 59(5): 2136-2145 (2011) - 2010
- [i7]Xuebin Wu, Zhiyuan Yan, Ning Chen, Meghanad D. Wagh:
Prime Factor Cyclotomic Fourier Transforms with Reduced Complexity over Finite Fields. CoRR abs/1007.1209 (2010) - [i6]Xuebin Wu, Meghanad D. Wagh, Ning Chen, Zhiyuan Yan, Ying Wang:
Composite Cyclotomic Fourier Transforms with Reduced Complexities. CoRR abs/1007.1213 (2010)
2000 – 2009
- 2009
- [j6]Ning Chen, Zhiyuan Yan:
Reduced-Complexity Reed-Solomon Decoders Based on Cyclotomic FFTs. IEEE Signal Process. Lett. 16(4): 279-282 (2009) - [j5]Yongmei Dai, Zhiyuan Yan, Ning Chen:
Memory-efficient and high-throughput decoding of quasi-cyclic LDPC codes. IEEE Trans. Commun. 57(4): 879-883 (2009) - [j4]Ning Chen, Zhiyuan Yan:
Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm. IEEE Trans. Signal Process. 57(3): 1010-1020 (2009) - [c8]Ning Chen, Zhiyuan Yan:
High-performance Designs of AES Transformations. ISCAS 2009: 2906-2909 - [c7]Ning Chen, Maximilien Gadouleau, Zhiyuan Yan:
Rank metric decoder architectures for noncoherent error control in random network coding. SiPS 2009: 127-132 - [i5]Ning Chen, Maximilien Gadouleau, Zhiyuan Yan:
Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding. CoRR abs/0909.4601 (2009) - 2008
- [j3]Ning Chen, Zhiyuan Yan:
Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [j2]Yongmei Dai, Ning Chen, Zhiyuan Yan:
Memory Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes. IEEE Trans. Circuits Syst. I Regul. Pap. 55-I(9): 2898-2911 (2008) - [j1]Yongmei Dai, Zhiyuan Yan, Ning Chen:
Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes. IEEE Trans. Very Large Scale Integr. Syst. 16(5): 565-578 (2008) - [c6]Ning Chen, Zhiyuan Yan:
Compact designs of mixcolumns and subbytes using a novel common subexpression elimination algorithm. ISCAS 2008: 1584-1587 - [i4]Ning Chen, Zhiyuan Yan:
Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes. CoRR abs/0803.0731 (2008) - [i3]Ning Chen, Zhiyuan Yan:
Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs. CoRR abs/0811.0196 (2008) - [i2]Meghanad D. Wagh, Ning Chen, Zhiyuan Yan:
Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic Convolution. CoRR abs/0812.2971 (2008) - 2007
- [c5]Ning Chen, Zhiyuan Yan:
Complexity Analysis of The GAO Algorithm. SiPS 2007: 243-248 - [c4]Ning Chen, Zhiyuan Yan:
Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding. SiPS 2007: 657-662 - [i1]Ning Chen, Zhiyuan Yan:
Reduced-Complexity Cyclotomic FFT and Its Application in Reed-Solomon Decoding. CoRR abs/0710.1879 (2007) - 2006
- [c3]Yongmei Dai, Zhiyuan Yan, Ning Chen:
High-Throughput Turbo-Sum-Product Decoding of QC LDPC Codes. CISS 2006: 839-844 - [c2]Yongmei Dai, Zhiyuan Yan, Ning Chen:
Parallel turbo-sum-product decoder architecture for quasi-cyclic LDPC codes. ACM Great Lakes Symposium on VLSI 2006: 312-315 - [c1]Ning Chen, Yongmei Dai, Zhiyuan Yan:
Partly Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes. SiPS 2006: 220-225
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-11-14 22:01 CET 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:
