default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRan Xu 0009
Person information
- affiliation: University of Bristol, Centre for Communications Research, Department of Electrical and Electronic Engineering, UK
Other persons with the same name
- Ran Xu — disambiguation page
- Ran Xu 0001
![[0009-0004-4585-5261]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0009-0004-4585-5261")
— Salesforce Research, Salesforce AI Research, - Ran Xu 0002 — Emory University, Department of Computer Science, Atlanta, GA, USA
- Ran Xu 0003 — Purdue University, School of Electrical and Computer Engineering, West Lafayette, IN, USA
- Ran Xu 0004 — University of California, Santa Cruz, Department of Computational Media, USA
- Ran Xu 0005 — Loughborough University, Department of Computer Science, UK
- Ran Xu 0006 — University of Connecticut, Department of Allied Health Sciences, Storrs, CT, USA (and 1 more)
- Ran Xu 0007 — Nanjing University of Posts and Telecommunications, Jiangsu Key Laboratory of Image Processing and Image Communications, China
- Ran Xu 0008 — Huawei Technologies Co., Cloud Database Innovation Lab of Cloud BU, Chengdu, China
- Ran Xu 0010 — Canadian Surgical Technologies and Advanced Robotics, CSTAR, Lawson Health Research Institute, London, ON, Canada
- Ran Xu 0011 — Chinese Academy and Sciences, ThinkIT Speech Lab Institute of Acoustics, Beijing, China
- Ran Xu 0012 — Shaanxi Normal University, School of Computer Science, Xi'an, China
- Ran Xu 0013 — Peking University, National Key Laboratory for Multimedia Information Processing, School of Computer Science, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j3]Ran Xu, Kevin A. Morris, Graeme Woodward, Taskin Koçak:
Low-complexity high-throughput decoding architecture for convolutional codes. EURASIP J. Wirel. Commun. Netw. 2012: 151 (2012)- [j2]Ran Xu, Kevin A. Morris:
High throughput sequential decoding with state estimation. IET Commun. 6(13): 2033-2039 (2012) - 2011
- [j1]Ran Xu, Taskin Koçak, Graeme Woodward, Kevin A. Morris, Craig Dolwin:
High Throughput Parallel Fano Decoding. IEEE Trans. Commun. 59(9): 2394-2405 (2011) - 2010
- [c3]Ran Xu, Graeme Woodward, Kevin A. Morris, Taskin Koçak:
A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders. GLOBECOM 2010: 1-5 - [c2]Ran Xu, Taskin Koçak, Graeme Woodward, Kevin A. Morris:
Throughput improvement on bidirectional Fano algorithm. IWCMC 2010: 276-280 - [i1]Ran Xu, Graeme Woodward, Kevin A. Morris, Taskin Koçak:
A Discrete Time Markov Chain Model for High Throughput Bidirectional Fano Decoders. CoRR abs/1011.2686 (2010)
2000 – 2009
- 2009
- [c1]Ran Xu, Taskin Koçak, Graeme Woodward, Kevin A. Morris, Craig Dolwin:
Bidirectional Fano algorithm for high throughput sequential decoding. PIMRC 2009: 1809-1813
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 2025-01-27 00:47 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:
