Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 103 matches
- 2021
- Xuan Zhou, Zheng Ma, Li Li, Ming Xiao:
Low Complexity Generalized-LDPC Decoder Based on Trellis Splicing. IEEE Commun. Lett. 25(3): 830-834 (2021) - Meng Wang, Shiqi Wang, Junru Li, Li Zhang, Yue Wang, Siwei Ma, Sam Kwong:
Low Complexity Trellis-Coded Quantization in Versatile Video Coding. IEEE Trans. Image Process. 30: 2378-2393 (2021) - 2020
- Xiaohuan Peng, Zhipeng Pan, Ke Lai, Lei Wen, Jing Lei:
Low complexity receiver of sparse code multiple access based on dynamic trellis. IET Commun. 14(9): 1420-1427 (2020) - Vinh Hoang Son Le, Charbel Abdel Nour, Catherine Douillard, Emmanuel Boutillon:
A Low-Complexity Dual Trellis Decoding Algorithm for High-Rate Convolutional Codes. WCNC 2020: 1-7 - Meng Wang, Shiqi Wang, Junru Li, Li Zhang, Yue Wang, Siwei Ma, Sam Kwong:
Low Complexity Trellis-Coded Quantization in Versatile Video Coding. CoRR abs/2008.11420 (2020) - 2019
- Shigeichi Hirasawa, Hideki Yagi, Manabu Kobayashi, Masao Kasahara:
Exponential Error Bounds and Decoding Complexity for Block Codes Constructed by Unit Memory Trellis Codes of Branch Length Two. CISS 2019: 1-6 - 2018
- Houshou Chen, Kuo-Chen Chung:
A Low Complexity PTS Technique Using Minimal Trellis in OFDM Systems. IEEE Trans. Veh. Technol. 67(1): 817-821 (2018) - Huyen Pham Thi, Hanho Lee:
Reduced-Complexity Trellis Min-Max Decoder for Non-Binary Ldpc Codes. ICASSP 2018: 1179-1183 - Dominik Auras, Sebastian Birke, Rainer Leupers, Gerd Ascheid:
Reducing the Computational Complexity of ORVD-Trellis Search Based MIMO Detection. ICNC 2018: 315-321 - Takanori Hara, Koji Ishibashi, Soon Xin Ng, Lajos Hanzo:
Low-Complexity Generator Polynomial Search for Turbo Trellis-Coded Spatial Modulation Using Symbol-based EXIT Charts. ISTC 2018: 1-5 - Junya Watanabe, Hideki Ochiai:
A new low-complexity trellis shaping design based on clipping for PAPR reduction in BICM-OFDM system. WCNC 2018: 1-6 - 2016
- Zihui Liu, Xin-Wen Wu:
Trellis complexity and pseudoredundancy of relative two-weight codes. Appl. Algebra Eng. Commun. Comput. 27(2): 139-158 (2016) - Jesus Omar Lacruz, Francisco Garcia-Herrero, María José Canet, Javier Valls:
Reduced-Complexity Nonbinary LDPC Decoder for High-Order Galois Fields Based on Trellis Min-Max Algorithm. IEEE Trans. Very Large Scale Integr. Syst. 24(8): 2643-2653 (2016) - 2015
- Wim J. van Houtum, Frans M. J. Willems:
Complexity reduction for non-coherent iteratively detected differentially encoded quaternary phase shift keying based on trellis decomposition. Trans. Emerg. Telecommun. Technol. 26(3): 318-321 (2015) - Xinmiao Zhang:
Low-Complexity Modified Trellis-Based Min-Max Non- Binary LDPC Decoders. J. Commun. 10(11): 836-842 (2015) - Isaac Benchimol, Cecilio Pimentel, Richard Demo Souza:
Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis. Telecommun. Syst. 59(4): 491-500 (2015) - 2014
- Nico Aerts, Iancu Avram, Marc Moeneclaey:
Low-complexity a posteriori probability approximation in EM-based channel estimation for trellis-coded systems. EURASIP J. Wirel. Commun. Netw. 2014: 153 (2014) - Weiwei Liu, Guangjie Liu, Yuewei Dai:
Alternative Syndrome-Trellis Codes With Reduced Trellis Complexity. J. Inf. Hiding Multim. Signal Process. 5(4): 769-777 (2014) - Fabian Schuh, Johannes B. Huber:
Low complexity decoding for higher order punctured trellis-coded modulation over intersymbol interference channels. ISCCSP 2014: 475-478 - Fabian Schuh, Johannes B. Huber:
Low Complexity Decoding for Higher Order Punctured Trellis-Coded Modulation Over Intersymbol Interference Channels. CoRR abs/1405.6880 (2014) - 2013
- Xiaotao Wang, Hua Qian, Kai Kang, Weidong Xiang:
A low-complexity maximum likelihood decoder for tail-biting trellis. EURASIP J. Wirel. Commun. Netw. 2013: 130 (2013) - Guilherme Luiz Moritz, Richard Demo Souza, Cecilio Pimentel, Marcelo Eduardo Pellenz, Bartolomeu F. Uchôa Filho, Isaac Benchimol:
Turbo Decoding Using the Sectionalized Minimal Trellis of the Constituent Code: Performance-Complexity Trade-Off. IEEE Trans. Commun. 61(9): 3600-3610 (2013) - Fabian Schuh, Andreas Schenk, Johannes B. Huber:
Reduced complexity super-trellis decoding for convolutionally encoded transmission over ISI-channels. ICNC 2013: 484-489 - Isaac Benchimol, Cecilio Pimentel, Richard Demo Souza, Bartolomeu F. Uchôa Filho:
A computational complexity measure for trellis modules of convolutional codes. TSP 2013: 144-148 - Fabian Schuh, Johannes B. Huber:
Low Complexity Decoding for Punctured Trellis-Coded Modulation Over Intersymbol Interference Channels. CoRR abs/1312.1482 (2013) - 2012
- Richard Demo Souza, Cecilio Pimentel, Daiana Nascimento Muniz:
Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis. Ann. des Télécommunications 67(11-12): 537-545 (2012) - Heide Gluesing-Luerssen, G. David Forney Jr.:
Reducing complexity of tail-biting trellises. ISIT 2012: 646-650 - Heide Gluesing-Luerssen, G. David Forney Jr.:
Reducing complexity of tail-biting trellises. CoRR abs/1202.1336 (2012) - Fabian Schuh, Andreas Schenk, Johannes B. Huber:
Reduced Complexity Super-Trellis Decoding for Convolutionally Encoded Transmission Over ISI-Channels. CoRR abs/1207.4680 (2012) - 2011
- Yen-Ming Chen, Yeong-Luh Ueng, Jhong-Jheng Su, Jen-Yuan Hsu, Pangan Ting:
A lower-complexity iterative trellis-based factor search algorithm and blind detector for PTS-based OFDM systems. ICICS 2011: 1-5
skipping 73 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-25 00:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint