检索结果-内蒙古大学图书馆

Iterative decoding with a hamming thresholdfor block turbo-codes

IEEE COMMUNICATIONS LETTERS 2004年第9期8卷 567-569页

作者： Mahran, A Benaissa, M Mil Tech Coll Dept Elect Engn Cairo Egypt Univ Sheffield Dept Elect & Elect Engn Sheffield S1 3JD S Yorkshire England

This work introduces a novel approach to increase the performance of block turbo codes (BTCs). The idea is based on using a Hamming threshold to limit the search for the maximum-likelihood (ML) codeword within only those codewords that lie within this threshold. The proposed iterative decoding approach is shown to offer both significant coding gain and complexity reduction over the standard iterative decoding methods.

关键词： block turbo codes (BTCs) channel coding decoding complexity Hamming threshold soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

Convolutional Codes Under a Minimal Trellis complexity Measure

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2009年第1期57卷 1-5页

作者： Uchoa-Filho, Bartolomeu F. Souza, Richard Demo Pimentel, Cecilio Jar, Marcel Univ Fed Santa Catarina CTC EEL GPqCom Florianopolis SC Brazil UTFPR CPGEI DAELN Curitiba Parana Brazil Univ Fed Pernambuco DES CODEC Recife PE Brazil

We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in a distance spectrum sense) of existing and new trellis complexities are tabulated.

关键词： Convolutional codes decoding complexity distance spectrum minimal trellis

来源：评论

学校读者我要写书评

暂无评论

Full Diversity Full Rate Cyclotomic Orthogonal Space-Time Block Codes for MIMO Wireless Systems

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第10期E95B卷 3349-3352页

作者： Jiang, Hua Zhao, Kanglian Li, Yang Du, Sidan Nanjing Univ Sch Elect Sci & Engn Nanjing 210093 Jiangsu Peoples R China

In this letter we design a new family of space-time block codes (STBC) for multi-input multi-output (MIMO) systems. The complex orthogonal STBC achieves full diversity and full transmission rate with fast maximum-likelihood decoding when only two transmit antennas are employed. By combining the Alamouti STBC and the multidimensional signal constellation rotation based on the cyclotomic number field, we construct cyclotomic orthogonal space-time block codes (COSTBCs) which can achieve full diversity and full rate for multiple transmit antennas. Theoretical analysis and simulation results demonstrate excellent performance of the proposed codes, while the decoding complexity is further reduced.

关键词： space-time block code (STBC) multi-input multi-output (MIMO) coding gain decoding complexity

来源：评论

学校读者我要写书评

暂无评论

PARALLEL decoding OF THE [23, 12, 7] BINARY GOLAY CODE

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1994年第2期141卷 119-122页

作者： DODUNEKOV, SM NILSSON, JEM GERMAN AEROSP RES ESTAB DLR INST COMMUN TECHNOLW-8031 OBERPFAFFENHOFENGERMANY

This paper deals with the decoding of the [23,12,7] binary Golay code. Recently, S.W. Wei and C.H. Wei suggested a step-by-step decoding algorithm. We present an improvement in the comparison circuit of their algorith... 详细信息

关键词： GOLAY BINARY CODE PARALLEL decoding decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Edge-Based Dynamic Scheduling for Belief-Propagation decoding of LDPC and RS Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第2期65卷 525-535页

作者： Aslam, Chaudhry Adnan Guan, Yong Liang Cai, Kui Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Singapore Univ Technol & Design Sci & Math Cluster Singapore 487372 Singapore

This paper presents two low-complexity edge-based scheduling schemes, referred to as the e-Flooding and e-Shuffled schedules, for the belief-propagation (BP) decoding of low-density parity-check and Reed-Solomon codes. The proposed schedules selectively update the edges of the code graph based on the runtime reliability of variable and check nodes. Specifically, new message update is propagated exclusively along the unreliable edges of the code graph. This reduces the decoding complexity of BP algorithm as only a partial set of message updates is computed per decoding iteration. Besides, restricting the flow of message updates may also precludes the occurrence of some short graph cycles, which helps to preserve the BP message independence at certain variable and check nodes. Using numerical simulations, it is shown that the proposed edge-based schedules reduce the BP decoding complexity by more than 90% compared with the prior-art BP schedules, while simultaneously improving the error-rate performance, at medium-to-high signal-to-noise ratio over additive white Gaussian noise channel.

关键词： LDPC code RS code message-passing belief-propagation scheduling code graph decoding complexity error-rate performance

来源：评论

学校读者我要写书评

暂无评论

Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第6期61卷 2318-2329页

作者： Rajashekar, Rakshith Hari, K. V. S. Hanzo, L. Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India Univ Southampton Sch ECS Southampton SO9 5NH Hants England

In this paper, we consider spatial modulation (SM) operating in a frequency-selective single-carrier (SC) communication scenario and propose zero-padding instead of the cyclic-prefix considered in the existing literature. We show that the zero-padded single-carrier (ZP-SC) SM system offers full multipath diversity under maximum-likelihood (ML) detection, unlike the cyclic-prefix based SM system. Furthermore, we show that the order of ML detection complexity in our proposed ZP-SC SM system is independent of the frame length and depends only on the number of multipath links between the transmitter and the receiver. Thus, we show that the zero-padding applied in the SC SM system has two advantages over the cyclic prefix: 1) achieves full multipath diversity, and 2) imposes a relatively low ML detection complexity. Furthermore, we extend the partial interference cancellation receiver (PIC-R) proposed by Guo and Xia for the detection of space-time block codes (STBCs) in order to convert the ZP-SC system into a set of narrowband subsystems experiencing flat-fading. We show that full rank STBC transmissions over these subsystems achieves full transmit, receive as well as multipath diversity for the PIC-R. Furthermore, we show that the ZP-SC SM system achieves receive and multipath diversity for the PIC-R at a detection complexity order which is the same as that of the SM system in flat-fading scenario. Our simulation results demonstrate that the symbol error ratio performance of the proposed linear receiver for the ZP-SC SM system is significantly better than that of the SM in cyclic prefix based orthogonal frequency division multiplexing as well as of the SM in the cyclic-prefixed and zero-padded single carrier systems relying on zero-forcing/minimum mean-squared error equalizer based receivers.

关键词： Spatial modulation zero padded single carrier communication partial interference cancellation diversity decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Adaptive detection method of FTN signalling at constant Nyquist sampling rate

引用

IET COMMUNICATIONS 2017年第5期11卷 739-745页

作者： Wang, Ke Liu, Aijun Liang, Xiaohu Pen, Siming Wang, Heng PLA Univ Sci & Technol Lab Satellite Commun Inst Commun Engn Nanjing Jiangsu Peoples R China

Faster-than-Nyquist (FTN) signalling, as a candidate technology of fifth generation, can transmit more data with the same bandwidth. In the adaptive transmission system based on FTN signalling (FNS), the transmitter changes the packing ratios to adapt to the wireless channels. The scheme that combines the adaptive coding and modulation with the FNS has higher spectral efficiency. However, the symbol rate changing with the packing ratio challenges the receiver of adaptive transmission system based on FNS. Moreover, the decoding complexity based on viterbi algorithm (VA) is increasing exponentially when the packing ratios of FNS decrease. In this study, the authors proposed an adaptive detection method to detect FTN signal at constant sampling rate. The proposed method adopted an linear minimum mean square error (LMMSE) equaliser to solve the mismatch of the symbol rate and the sampling rate. Their simulation results show that the adaptive detection method of FNS can approach the optimal bit error rate performance of the coded FTN system. At the same time, the proposed method can avoid the complexity induced by the variable sampling rate in the adaptive transmission system based on FNS.

关键词： 5G mobile communication adaptive modulation least mean squares methods error statistics wireless channels signal sampling adaptive detection method FTN signalling constant Nyquist sampling rate faster-than-Nyquist signalling fifth generation FNS wireless channels adaptive coding and modulation decoding complexity LMMSE equaliser optimal bit error rate performance

来源：评论

学校读者我要写书评

暂无评论

Design of segmented CRC-aided spinal codes for IoT applications

引用

IET COMMUNICATIONS 2020年第20期14卷 3541-3548页

作者： Bian, Hongxiu Liu, Rongke Kaushik, Aryan Hu, Yingmeng Thompson, John S. Beihang Univ Sch Elect Informat Engn Beijing Peoples R China Univ Coll London UCL Dept Elect & Elect Engn London England Univ Edinburgh Inst Digital Commun Edinburgh Midlothian Scotland

Rateless spinal codes can achieve reliable transmission with high throughput performance, which is required by some power-constrained applications, such as internet of things (IoT). In this study, the cyclic redundancy check (CRC) is divided into segments. We design the segmented CRC-aided (SCA) spinal codes and propose a novel hybrid decoding algorithm. The decoder can terminate the decoding process earlier when an error decoding is detected in any segment. Moreover, a more targeted symbol transmission strategy after decoding errors occur is provided and we call it as the transmitting redundant symbols for specific segments (RSSS) strategy. The RSSS strategy saves the transmitting symbols by transmitting a variable number of symbols, thus improving the throughput of the system. Furthermore, we design a new tail-biting structure for SCA-spinal codes to compensate for the disadvantage of poor error detection ability for short segment CRC bits. The simulation results show that the proposed SCA-spinal codes can reduce the decoding complexity and improve the throughput of the system. The transmission delay can also be reduced by dividing the information bits and CRC bits into an appropriate number of segments.

关键词： error statistics channel coding cyclic redundancy check codes sequential decoding Internet of Things computer network reliability poor error detection ability short segment CRC bits SCA-spinal codes decoding complexity transmission delay segmented CRC-aided spinal codes IoT applications rateless spinal codes high throughput performance power-constrained applications cyclic redundancy check novel hybrid decoding algorithm decoder decoding process error decoding targeted symbol transmission strategy transmitting redundant symbols specific segments strategy RSSS strategy transmitting symbols high signal-to-noise ratio regions

来源：评论

学校读者我要写书评

暂无评论

Multiple Beamforming with Perfect Coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第6期60卷 1575-1586页

作者： Li, Boyu Ayanoglu, Ender Univ Calif Irvine Henry Samueli Sch Engn Dept Elect Engn & Comp Sci Ctr Pervas Commun & Comp Irvine CA 92697 USA

Perfect Space-Time Block Codes (PSTBCs) achieve full diversity, full rate, nonvanishing constant minimum determinant, uniform average transmitted energy per antenna, and good shaping. However, the high decoding complexity is a critical issue for practice. When the Channel State Information (CSI) is available at both the transmitter and the receiver, Singular Value Decomposition (SVD) is commonly applied for a Multiple-Input Multiple-Output (MIMO) system to enhance the throughput or the performance. In this paper, two novel techniques, Perfect Coded Multiple Beamforming (PCMB) and Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), are proposed, employing both PSTBCs and SVD with and without channel coding, respectively. With CSI at the transmitter (CSIT), the decoding complexity of PCMB is substantially reduced compared to a MIMO system employing PSTBC, providing a new prospect of CSIT. Especially, because of the special property of the generation matrices, PCMB provides much lower decoding complexity than the state-of-the-art SVD-based uncoded technique in dimensions 2 and 4. Similarly, the decoding complexity of BICMB-PC is much lower than the state-of-the-art SVD-based coded technique in these two dimensions, and the complexity gain is greater than the uncoded case. Moreover, these aforementioned complexity reductions are achieved with only negligible or modest loss in performance.

关键词： MIMO SVD perfect space-time block codes golden code BICMB constellation precoding diversity decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Flexible Generalized Spatial Modulation for Visible Light Communications

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第1期70卷 1041-1045页

作者： Al-Nahhal, Mohamed Basar, Ertugrul Uysal, Murat Ozyegin Univ Dept Elect & Elect Engn TR-34794 Istanbul Turkey Koc Univ Dept Elect & Elect Engn CoreLab TR-34450 Istanbul Turkey

Adaptive spatial modulation (ASM) varies the modulation size across the transmit light-emitting diodes (LEDs) to improve the overall spectral efficiency of visible light communication (VLC) systems. This article proposes a novel ASM scheme, referred to as flexible generalized spatial modulation (FGSM), for VLC systems. The proposed FGSM system changes the modulation sizes over the LEDs and the number of active LEDs, to improve the average symbol error rate (SER) and spectral efficiency compared to ASM with a fixed overall number of LEDs. The modulation sizes are selected in order to optimize the average SER under a predefined spectral efficiency value. A closed-form expression of approximate SER is derived along with decoding complexity calculations for the proposed system. Numerical results are provided to confirm the superiority of the proposed system and to support theoretical derivations.

关键词： Closed-form solutions Spectral efficiency Modulation Light emitting diodes decoding complexity theory Visible light communication Visible light communication generalized spatial modulation decoding complexity adaptive modulation sizes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：