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

Low Complexity State Metric Memory Reduction for turbo Decoding With Stochastic Quantization

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2024年第1期71卷 385-389页

作者： Hu, Shuai Han, Kaining Hu, Jianhao Univ Elect Sci & Technol China UESTC Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China

The size of the state metrics cache (SMC) has a predominant impact on the overall hardware consumption of the turbo decoder. This brief presents a low complexity SMC reduction algorithm based on the proposed stochastic quantization (SQ) technique, which reduces the size of the SMC by randomly quantizing the state metrics to different small bit-width numbers. The selection of the random source and the updating method of the extrinsic information are further explored to minimize the performance loss caused by bit-width reduction. The simulation and synthesis results show that the proposed algorithm can achieve the best bit error rate (BER) performance with the lowest hardware consumption among the compared SMC reduction algorithms.

关键词： Decoding Measurement Complexity theory turbo codes Quantization (signal) Long Term Evolution Hardware turbo decoder SMC reduction stochastic computing MAP decoding

来源：评论

学校读者我要写书评

暂无评论

High Throughput turbo Decoding Scheme

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第6期E95B卷 2109-2112页

作者： Choi, Jaesung Shin, Joonyoung Lee, Jeong Woo Chung Ang Univ Sch Elect & Elect Engn Seoul 156756 South Korea

A new high-throughput turbo decoding scheme adopting double flow, sliding window and shuffled decoding is proposed. Analytical and numerical results show that the proposed scheme requires low number of clock cycles an... 详细信息

关键词： turbo decoder throughput clock cycle memory

来源：评论

学校读者我要写书评

暂无评论

An iterative ITI cancellation method for multi-head multi-track bit-patterned magnetic recording systems

引用

Digital Communications and Networks 2021年第1期7卷 107-112页

作者： Santi Koonkamkhai Piya Kovintavewat Data Storage Technology Research Center Nakhon Pathom Rajabhat UniversityNakhon Patiiom73000Thailand

Bit-Pattemed Magnetic Recording(BPMR)is one of the emerging data storage technologies,which promises an Areal Density(AD)of about 4 Tb/***,a major problem practically encountered in a BPMR system is Inter-Track Interference(ITI)that can deteriorate the overall system performance,especially at high *** paper proposes an iterative ITI cancellation method for an m-head m-track BPMR system,which uses m heads to read m adjacent tracks and decodes them *** cancel the ITI,we subtract the weighted readback signals of adjacent tracks,acting as the ITI signals,from the readback signal of the target track,before passing the refined readback signal to a turbo ***,the decoded data will be employed to reconstruct the ITI signal for the next turbo *** results indicate that the proposed system performs better than the conventional system that uses one head to read one data ***,we also find out that the proposed system is more robust to media noise and track misregistration than the conventional system.

关键词： Emerging magnetic recording technology Multi-head multi-track Inter-track interference turbo decoder

来源：评论

学校读者我要写书评

暂无评论

Modified enhanced max-log-maximum a posteriori algorithm using variable scaling factor

引用

IET COMMUNICATIONS 2007年第5期1卷 1061-1066页

作者： Kim, J. Kim, J. Park, H. Kim, B. Park, S. Informat & Commun Univ Sch Engn Taejon 305714 South Korea Elect & Telecommun Res Inst Commun Device Module Team Taejon 305700 South Korea

Using a variable scaling factor (VSF), a modified enhanced max-log-maximum a posteriori (EMLMAP) algorithm is proposed to improve the performance of the conventional EMLMAP algorithm which uses a fixed SF. The VSF, maximising the mutual information exchanged between component decoders in a turbo decoder, is adaptively varied with a priori information of each component decoder. For a large size of interleaver, it is shown that the proposed algorithm improves the bit error rate performance and speed of decoding convergence of the conventional EMLMAP algorithm. The improved speed of the decoding convergence reduces the average number of iterations and results in low-power implementations of a turbo decoder.

关键词： bit error rate interleaved codes maximum likelihood estimation turbo decoder low-power implementation component decoder modified enhanced max-log-maximum a posteriori algorithm error statistics iterative decoding convergence iterative decoding interleaved code variable scaling factor turbo codes

来源：评论

学校读者我要写书评

暂无评论

Parallel Interleavers Through Optimized Memory Address Remapping

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2010年第6期18卷 978-987页

作者： Yang, Jing-ling Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

This work presents mathematical models and collision-free exchange rules for a parallel interleaver, using which it develops an optimized memory address remapping (OPMM) scheme that enables a classic interleaver to be exchanged for a parallel interleaver readily and efficiently. Both analytic and experimental results demonstrate that the rate of annealing achieved using the OPMM approach is much faster than that achieved using the traditional memory address remapping (MM) method.

关键词： Collision-free memory address mapping parallel interleaver turbo decoder

来源：评论

学校读者我要写书评

暂无评论

The K-Best Sphere Decoding for Soft Detection of Generalized Spatial Modulation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第11期65卷 4803-4816页

作者： Zheng, Beixiong Wen, Miaowen Chen, Fangjiong Huang, Nuo Ji, Fei Yu, Hua South China Univ Technol Sch Elect & Informat Engn Guangzhou 510641 Guangdong Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

Due to the interchannel interference and the varying active antennas in generalized spatial modulation (GSM), it is challenging to detect the transmitted data effectively while imposing low computational burden to the receiver. In this paper, we propose a novel algorithm based on the K-best sphere decoding for the soft detection of the GSM signal, which performs the breadth-first tree search in two stages sequentially. By exploiting the null space of the GSM channel, the inactive antenna searching is carried out antennawise in the first stage, in which a recursive algorithm for updating the QL decomposition (a decomposition of a matrix into a product of an orthogonal matrix and a lower triangular matrix) is proposed to calculate the branch metrics and an effective examination scheme is developed to prune those illegal or repetitive child nodes. Based on the available QL decomposition structure that has been updated recursively during the first stage, the second stage of the proposed detector is then readily concatenated to search for the modulated symbols carried on the active antennas in a one-by-one manner. Moreover, owing to the soft-input soft-output nature, the proposed detector can be applied in a turbo decoder for a coded GSM system. Both complexity analysis and simulation results corroborate the superiority of the proposed soft detector for the GSM system.

关键词： Spatial modulation MIMO systems maximum-likelihood (ML) detection sphere decoding (SD) turbo decoder

来源：评论

学校读者我要写书评

暂无评论

Performance of spectrum sharing cognitive radio network based on MIMO MC-CDMA system for medical image transmission

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第4-Sup期22卷 S7705-S7712页

作者： Rammyaa, B. Vishvaksenan, K. S. Poobal, Sumathi KCG Coll Technol Dept EIE Chennai Tamil Nadu India SSN Coll Engn Dept ECE Chennai Tamil Nadu India KCG Coll Technol Dept ECE Chennai Tamil Nadu India

Cognitive radio (CR) is a futuristic technology which efficiently uses the underutilized TV band spectrum for mobile communication. The spectrum scarcity issue, mobile traffic due to ever-increasing number of clients utilizing the same spectrum and interference problems will be efficiently handled by CR networks. In this paper, we employ CR spectrum for safe transmission of medical reports consisting of magnetic resonance imaging (MRI) scanned images. An effective image encryption algorithm named Arnold cat-map (ACM) transform is used in order to prevent unauthorized alterations in the MRI scanned image by any un-authenticated personnel. Further, we upgrade the resolution of the MRI scanned image by super-resoluting it by SPARSE super-resolution technique. Furthermore, we analyze the transmission of MRI scanned image by considering turbo code as channel encoder. We incorporate space time block code (STBC) as multiple-input and multiple-output (MIMO) profile due to its supremacy in spatial diversity and code division multiple access (CDMA) for simultaneous data transmission to numerous users, for transmission of the MRI scanned report. We utilize CR sub-band frequency to realize multi-carrier (MC) communication and to generate orthogonal spread-spectrum. Furthermore, we also analyse the error rate performance of the system for various Stanford University Interim (SUI) channel models. Finally, from the simulations we divulge that CR defined MIMO MC-CDMA system obtain MRI image with enhanced resolution and upgraded privacy when communicating through realistic channel model specifications.

关键词： Code division multiple-access (CDMA) Multicarrier modulation (MCM) Multi-user interference (MUI) Multiple input multiple output (MIMO) turbo decoder

来源：评论

学校读者我要写书评

暂无评论

Efficient soft bit estimation for joint iterative multiple-input multiple-output detection

引用

IET COMMUNICATIONS 2015年第17期9卷 2107-2113页

作者： Ahmed, Saleem Kim, Sooyoung Chonbuk Natl Univ Div Elect Engn IT Convergence Res Ctr Jeonju South Korea

In this study, the authors propose a joint iterative detection and decoding (JIDD) method for a turbo coded multiple-input multiple-output (MIMO) system, with a linear order of complexity. Accurate estimation of soft information should be conditioned for excellent performance of the JIDD, but it usually requires an exponential order of complexity. They propose a method which improves the performance of soft interference cancellation minimum mean-squared error (SIC-MMSE) method by increasing the reliability of the soft information utilised for interference cancellation. The proposed method utilises a posteriori probabilities from the MIMO detector as well as a priori probabilities from the turbo decoder, and perform soft minimum mean-squared error filtering for symbol level detection. With this approach, soft information is fully fed into the symbol detection process, and thus the reliability of soft symbol is increased. In addition, they can separate out the bit-level soft estimation process by using a simple linear method. Simulation results show that the proposed method provides substantial complexity reduction, with a bit error rate performance comparable to the conventional SIC-MMSE methods.

关键词： error statistics MIMO communication signal detection iterative decoding turbo codes linear codes interference suppression least mean squares methods telecommunication network reliability maximum likelihood estimation filtering theory joint iterative multiple input multiple output detection joint iterative detection and decoding method JIDD method turbo coded MIMO system soft information bit estimation reliability soft interference cancellation performance minimum mean square error filtering method SIC-MMSE method interference cancellation posteriori probability MIMO detector priori probability turbo decoder symbol level detection process soft symbol reliability linear method substantial complexity reduction bit error rate performance

来源：评论

学校读者我要写书评

暂无评论

Optimal Datapath Widths Within turbo and Viterbi decoders for High Area- and Energy-Efficiency

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2017年第3期87卷 299-325页

作者： Broich, Martin Noll, Tobias G. Rhein Westfal TH Aachen Chair Elect Engn & Comp Syst Schinkelstr 2 D-52062 Aachen Germany

Datapath widths in state-of-the-art turbo and Viterbi decoder implementations depend on estimated upper bounds of the differences of processed metrics. Aiming at highest area and energy efficiency, this paper presents guidelines for designing turbo and Viterbi decoder datapaths with minimal widths. This is based on maximum absolute values of branch, state and path metric differences within theMax-Log-MAP respectively Viterbi decoding algorithm applying modulo normalization. The proposed methodology for determining the maximum absolute values covers punctured as well as n-input binary convolutional and turbo codes so it accommodates higherradix add-compare-select operations. Maximum absolute values of metric differences and minimum datapath widths are presented for the 3GPP-LTE, DVB-RCS2 and IEEE-802.16 (WiMAX) compliant turbo decoders and for the IEEE-802.11 (Wi-Fi), IEEE-802.16 (WiMAX) and 3GPP-LTE compliant Viterbi decoders. Besides, a new dynamic branch-metric saturation scheme is presented, which enables a further datapath width reduction within turbo decoders. In total, a datapath width reduction of two bits (-20 %) is achieved applying radix-4 Max-Log-MAP arithmetic. An overall area-time-energy complexity reduction of 31% is achieved for a soft-input soft-output decoder and of 24% for the LTE turbo decoder.

关键词： turbo decoder Iterative decoding Soft-input soft-output decoder Maximum-a-posteriori algorithm Modulo normalization Dynamic branch-metric saturation

来源：评论

学校读者我要写书评

暂无评论

Performance Study of a Near Maximum Likelihood Code-Aided Timing Recovery Technique

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2016年第3期64卷 799-811页

作者： Nasr, Imen Geller, Benoit Atallah, Leila Najjar Cherif, Sofiane Univ Carthage Higher Sch Commun Tunis SUPCOM COSIM Res Lab Tunis Tunisia Ecole Natl Super Tech Avancees ENSTA ParisTech UPSA Res Lab U2IS Palaiseau France

In this paper, we propose a new code-aided (CA) timing recovery algorithm for various linear constant modulus constellations based on the Maximum Likelihood (ML) estimator. The first contribution is the derivation of a soft estimator expression of the transmitted symbol instead of its true or hard estimated value which is fed into the timing error detector (TED) equation. The proposed expression includes the Log-Likelihood Ratios (LLRs) obtained from a turbo decoder. Our results show that the proposed CA approach achieves almost as good results as the data-aided (DA) approach over a large interval of SNR values while achieving a higher spectral efficiency. We also derive the corresponding CA Cramer Rao Bounds (CRB) for various modulation orders. Contrarily to former work, we develop here the CRB analytical expression for different M-PSK modulation orders and validate them through comparison to empirical CRB obtained by Monte Carlo iterations. The proposed CA estimator realizes an important gain over the nondata-aided approach (NDA) and achieves a smaller gap when compared to its relative CA CRB, especially at moderate SNR values where modern systems are constrained to work.

关键词： Time synchronization turbo decoder Cramer-Rao bound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：