default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew F. Brejza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j9]Luping Xiang
, Matthew F. Brejza, Robert G. Maunder, Bashir M. Al-Hashimi, Lajos Hanzo:
Arbitrarily Parallel Turbo Decoding for Ultra-Reliable Low Latency Communication in 3GPP LTE. IEEE J. Sel. Areas Commun. 37(4): 826-838 (2019)- 2017
- [j8]Matthew F. Brejza, Robert G. Maunder, Bashir M. Al-Hashimi, Lajos Hanzo:
A High-Throughput FPGA Architecture for Joint Source and Channel Decoding. IEEE Access 5: 2921-2944 (2017) - [j7]Matthew F. Brejza, Robert G. Maunder, Bashir M. Al-Hashimi, Lajos Hanzo:
Flexible iterative receiver architecture for wireless sensor networks: a joint source and channel coding design example. IET Wirel. Sens. Syst. 7(2): 27-34 (2017) - 2016
- [j6]Wenbo Zhang, Zeyu Song, Matthew F. Brejza, Tao Wang, Robert G. Maunder, Lajos Hanzo:
Learning-Aided Unary Error Correction Codes for Non-Stationary and Unknown Sources. IEEE Access 4: 2408-2428 (2016) - [j5]Tao Wang, Matthew F. Brejza, Wenbo Zhang, Robert G. Maunder, Lajos Hanzo:
Reordered Elias Gamma Error Correction Codes for the Near-Capacity Transmission of Multimedia Information. IEEE Access 4: 5948-5970 (2016) - [j4]Matthew F. Brejza, Tao Wang, Wenbo Zhang, David Al-Khalili, Robert G. Maunder, Bashir M. Al-Hashimi, Lajos Hanzo:
Exponential Golomb and Rice Error Correction Codes for Generalized Near-Capacity Joint Source and Channel Coding. IEEE Access 4: 7154-7175 (2016) - [j3]Matthew F. Brejza, Liang Li, Robert G. Maunder, Bashir M. Al-Hashimi, Claude Berrou, Lajos Hanzo:
20 Years of Turbo Coding and Energy-Aware Design Guidelines for Energy-Constrained Wireless Applications. IEEE Commun. Surv. Tutorials 18(1): 8-28 (2016) - 2015
- [j2]Wenbo Zhang, Matthew F. Brejza, Tao Wang, Robert G. Maunder, Lajos Hanzo:
Irregular Trellis for the Near-Capacity Unary Error Correction Coding of Symbol Values From an Infinite Set. IEEE Trans. Commun. 63(12): 5073-5088 (2015) - [j1]Wenbo Zhang, Yanbo Jia, Xi Meng, Matthew F. Brejza, Robert G. Maunder, Lajos Hanzo:
Adaptive Iterative Decoding for Expediting the Convergence of Unary Error Correction Codes. IEEE Trans. Veh. Technol. 64(2): 621-635 (2015)
Conference and Workshop Papers
- 2016
- [c2]Matthew F. Brejza, Jeffrey Hooker, Jonathan Sowman, David Oakley, Robert G. Maunder:
Design of digital testbeds for undergraduate microelectronics teaching. EWME 2016: 1-4 - 2015
- [c1]Matthew F. Brejza, Wenbo Zhang, Robert G. Maunder, Bashir M. Al-Hashimi, Lajos Hanzo:
Adaptive iterative detection for expediting the convergence of a serially concatenated Unary Error Correction decoder, turbo decoder and an iterative demodulator. ICC 2015: 2603-2608
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-24 22:54 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:
