


default search action
Leilei Song
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j7]Yuexing Han, Yuhong Liu, Bing Wang, Qiaochuan Chen, Leilei Song, Lin Tong, Chuanbin Lai, Akihiko Konagaya:
A novel transfer learning for recognition of overlapping nano object. Neural Comput. Appl. 34(7): 5729-5741 (2022)
2000 – 2009
- 2009
- [j6]Jungwon Lee, Edward W. Jang, John M. Cioffi, Leilei Song:
An efficient symbol-level combining scheme for MIMO systems with hybrid ARQ. IEEE Trans. Wirel. Commun. 8(5): 2443-2451 (2009) - 2007
- [c10]Edward W. Jang, Jungwon Lee, Leilei Song, John M. Cioffi:
Concatenation-Assisted Symbol-Level Combining Scheme for MIMO Systems with Hybrid ARQ. GLOBECOM 2007: 3275-3279 - 2004
- [j5]Zhipei Chi, Leilei Song, Keshab K. Parhi
:
On The Performance/Complexity Tradeoff in Block Turbo Decoder Design. IEEE Trans. Commun. 52(2): 173-175 (2004) - 2002
- [j4]Kamran Azadet, Erich F. Haratsch, Helen Kim, Fadi Saibi
, Jeffrey H. Saunders, Michael Shaffer, Leilei Song, Meng-Lin Yu:
Equalization and FEC techniques for optical transceivers. IEEE J. Solid State Circuits 37(3): 317-327 (2002) - [j3]Leilei Song, Meng-Lin Yu, Michael S. Shaffer:
10- and 40-Gb/s forward error correction devices for optical communications. IEEE J. Solid State Circuits 37(11): 1565-1573 (2002) - 2001
- [c9]Kamran Azadet, Erich Haratsch, Helen Kim, Fadi Saibi
, Jeffrey H. Saunders, Mike Shaffer, Leilei Song, Meng-Lin Yu:
DSP techniques for optical transceivers. CICC 2001: 281-288 - [c8]Zhipei Chi, Leilei Song, Keshab K. Parhi
:
A study on the performance, complexity tradeoffs of block turbo decoder design. ISCAS (4) 2001: 65-68 - 2000
- [j2]Leilei Song, Keshab K. Parhi
, Ichiro Kuroda, Takao Nishitani:
Hardware/software codesign of finite field datapath for low-energy Reed-Solomon codecs. IEEE Trans. Very Large Scale Integr. Syst. 8(2): 160-172 (2000) - [c7]Hanho Lee, Meng-Lin Yu, Leilei Song:
VLSI design of Reed-Solomon decoder architectures. ISCAS 2000: 705-708
1990 – 1999
- 1999
- [c6]Leilei Song, Keshab K. Parhi
:
Low-energy software Reed-Solomon codecs using specialized finite field datapath and division-free Berlekamp-Massey algorithm. ISCAS (1) 1999: 84-89 - [c5]Leilei Song, Keshab K. Parhi:
Low-complexity modified Mastrovito multipliers over finite fields GF(2M). ISCAS (1) 1999: 508-512 - 1998
- [j1]S. K. Jain, Leilei Song, Keshab K. Parhi
:
Efficient semisystolic architectures for finite-field arithmetic. IEEE Trans. Very Large Scale Integr. Syst. 6(1): 101-113 (1998) - [c4]Leilei Song, Keshab K. Parhi
, Ichiro Kuroda, Takao Nishitani:
Low-energy heterogeneous digit-serial Reed-Solomon codecs. ICASSP 1998: 3049-3052 - 1997
- [c3]Leilei Song, Keshab K. Parhi:
Low-area dual basis divider over GF(2M). ICASSP 1997: 627-630 - 1996
- [c2]Leilei Song, Keshab K. Parhi
:
Efficient Finite Field Serial/Parallel Multiplication. ASAP 1996: 72- - [c1]Janardhan H. Satyanarayana, Keshab K. Parhi
, Leilei Song, Yun-Nan Chang:
Systematic analysis of bounds on power consumption in pipelined and non-pipelined multipliers. ICCD 1996: 492-499
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-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint