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

20th IEEE Symposium on Personal, Indoor and Mobile Radio Communications

作者： Xu, Ran Kocak, Taskin Woodward, Graeme Morris, Kevin Dolwin, Craig Univ Bristol Ctr Commun Res Merchant Venturers Bldg Bristol Avon England Toshiba Res Europe Ltd Telecomm Res Lab Queens Square Bristol Avon England

ISBN: (纸本)9781424451234

Various techniques, such as bidirectional search, have been employed in sequential decoding to reduce the decoding delay. In this paper, a bidirectional fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction simultaneously. It is shown that the proposed BFA can reduce the average decoding delay by at least 50% compared to the unidirectional fano algorithm (UFA). Due to the reduction in the variability of the computational effort by using bidirectional search, there is even higher decoding throughput improvement at low signal-to-noise-ratio (SNR). For example at Eb/No=3dB, there is 300% throughput improvement by using the BFA decoding compared to the conventional UFA decoding. The proposed BFA decoding technique can be employed in very high throughput wireless communication systems with low hardware complexity and power consumption.

关键词： bidirectional decoding fano algorithm high throughput decoding sequential decoding

来源：评论

学校读者我要写书评

暂无评论

Reduced complexity sequential sequence detection using modified fano algorithm for V-BLAST systems 62

Reduced complexity sequential sequence detection using modif...

引用

62nd IEEE Vehicular Technology Conference

作者： Cha, J Kan, J Lee, H Lee, H Korea Univ Sch Engn Informat & Commun Seoul South Korea

ISBN: (纸本)0780391527

Layered space-time architectures employed in BLAST system can provide remarkable capacity using multiple antennas in Rayleigh fading environments. In this paper, we propose a sub-optimal but computationally efficient Modified fano Detection algorithm (MFD). This algorithm utilizes the QR decomposition of the channel matrix and the sequential detection scheme based on tree searching in order to find the optimal symbol sequence. For more reliable signal detection, the decoder makes intentional backward movement at the stage one step greater than the end of tree. Simulation results show that the performance of MFD is comparable to that of ML detector with reduced complexity. The computation time of MFD is about 45 times shorter than that of ML even at low SNR region.

关键词： MIMO V-BLAST sphere decoding fano algorithm

来源：评论

学校读者我要写书评

暂无评论

Decoding overlapped time division multiplexing system with fano algorithm

Decoding overlapped time division multiplexing system with F...

引用

10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014)

作者： Qingshuang Zhang Ke Wang Aijun Liu Daoben Li Xiaofei Pan School of Communications Engineering PLA University of Science and Technology Nanjing China School of Information and Engineering Key Laboratory of Information Processing and Intelligent Technology Beijing University of Posts and Telecommunications China

ISBN: (纸本)9781510804166

OvTDM is a new transmission scheme that can obtain high spectral efficiency with very low threshold signal noise ratio (SNR) by using the inter symbol interference (ISI). fano algorithm (FA) is researched in this paper to implement fast ML decoding at high spectral efficiency for OvTDM. Numerical results show that the complexity of OvTDM with FA has no relationship with the number of state which is lower than 15% of that of Viterbi algorithm and the bit SNR loss is under 2 dB. Moreover, OvTDM with FA can even outperform Shannon limit when spectral is above 6.7 bits/s/Hz.

关键词： FA ISI MLSD OvTDM maximum likelihood sequence detection fano algorithm spectral efficiency FAS gene signal to noise ratios ISIS SATELLITES Shannon limit Time division time division multiplexing Viterbi algorithm DECODING

来源：评论

学校读者我要写书评

暂无评论

Low complexity fano-based detection algorithm with iterative structure for V-BLAST systems

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2008年第1期E91B卷 347-350页

作者： Cha, Jongsub Jeon, Hyoungsuk Lee, Hyuckjae Informat & Commun Univ Sch Engn Taejon 305714 South Korea

We present a computationally efficient fano detection algorithm with an iterative structure for V-BLAST systems. As our previous work, we introduced a fano-based sequential detection scheme with three interrelated steps whose computational loads are excessive. To deal with the computational inefficiency, the proposed algorithm is redesigned by the addition of two steps: preparation and iterative tree searching. In particular, it employs an early stop technique to avoid the unnecessary iteration or to stop the needless searching process of the algorithm. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation, compared with sphere detection (SD).

关键词： V-BLAST sphere detection fano algorithm iterative structure early stop

来源：评论

学校读者我要写书评

暂无评论

fano multiple-symbol differential detectors for differential unitary space-time modulation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2007年第3期55卷 540-550页

作者： Pun, Patrick K. M. Ho, Paul K. M. Broadcom Corp Packet Tel Richmond BC V6V 2Z8 Canada Simon Fraser Univ Sch Engn Sci Burnaby BC V5A 1S6 Canada

We present a class of suboptimal multiple-symbol differential detectors (MSDDs) for differential unitary space-time (ST) codes in a time-selective Rayleigh flat-fading channel. These noncoherent detectors, termed fano ST-MSDDs, employ the well-known fano algorithm as their decoding engines. Their bit-error rate (BER) performance is excellent, as there is no irreducible error floor, even at very high fade rates. Compared with the sphere decoder, which is optimal, our best detector, termed an on-demand bi-fano ST-MSDD, suffers only a 0.3 dB degradation in power efficiency. However, its computational complexity, as a function of the signal-to-noise ratio (SNR), is consistently lower than that of the sphere decoder and does not experience the exponential growth in complexity in the latter when the SNR decreases. It can thus be concluded that the fano algorithm is a powerful detection strategy for differential ST codes in fading channels. Our main contribution is in making the modifications and improvements to the fano algorithm that enables this realization. The innovations include the bi-fano, edge-bi-fano, and on-demand bi-fano search strategies, as well as a new dynamic threshold adjustment scheme for avoiding unnecessary back-and-forth node evaluations during backtracking.

关键词： fano algorithm fast Rayleigh fading multiple-symbol differential detection (MSDD) noncoherent space-time (ST) demodulation sequential decoding

来源：评论

学校读者我要写书评

暂无评论

High throughput graphics processing unit based fano decoder

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2016年第0期75卷 128-137页

作者： Ates, Ozgur Keskin, Selcuk Kocak, Taskin Ozyegin Univ Dept Comp Sci TR-34794 Istanbul Turkey Bahcesehir Univ Dept Comp Engn TR-34353 Istanbul Turkey

The next-generation high speed wireless technologies, such as WirelessHD, bring the concept of several Gigabits per second data communication. However, forward error correction that takes place at the receiver side has become a real computational challenge. So far, only hardware solutions have offered such high-speed convolutional decoding, which could not be achieved by software solutions. Our paper aims to fill this gap and proposes a software level solution offering such multi-Gbps convolutional decoding. For this intend, we use the massively parallel computing power of NVIDIA GPGPUs and CUDA programming environment to implement a solution. As a decoding method, the fano algorithm is selected for its relatively low memory requirements and computational complexity. A look-ahead mechanism and compact history in the form of circular queue is presented to support such high throughput. Conducted tests showed that our GPU based algorithm can decode up to 9.25 Gbps. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： fano algorithm High throughput decoding Look-ahead Forward error correction (FEC) Compute unified device architecture (CUDA) KEPLER MAXWELL

来源：评论

学校读者我要写书评

暂无评论

fano space-time multiple symbol differential detectors

Fano space-time multiple symbol differential detectors

引用

IEEE Global Telecommunications Conference (GLOBECOM 05)

作者： Pun, P Ho, P Simon Fraser Univ Sch Engn Sci Burnaby BC V5A 1S6 Canada

ISBN: (纸本)0780394143

We present in the paper a multiple-symbol differential detector (MSDD) for differential space-time (ST) codes in Rayleigh flat fading channel. The detector, termed a fano ST-MSDD, uses the fano algorithm as its decoding engine and is capable of delivering excellent error performance at moderate implementation complexity over a wide range of fading rates. Essentially, the detector is an "intelligent" decision feedback detector (DID) that uses a running threshold and the accumulated path metric as navigation tools when it roams the decoding tree. In the static channel, our best fano ST-MSDD scheme with a detection window size of N=6 is able to narrow the original 3 dB gap between ideal coherent and conventional ST differential detection by 1 dB. In a fast fading channel with a Doppler frequency of three percent the ST symbol rate, the error curve of our best N=10 fano ST-MSDD is able to "track" that of the ideal coherent detector (with a 3-dB gap in between) and there is no irreducible error floor. All these performances become even more remarkable when we consider the rather moderate implementation complexity reported in the paper. Because of its close relationship with a DID, the fano ST-MSDD has a similar complexity as the DFD at large signal-to-noise ratio (SNR). Actually, we found that the complexity of the fano ST-MSDD is a relatively stable function of the SNR.

关键词： non-coherent space-time demodulation fano algorithm multiple-symbol-differential detection sequential decoding fast Rayleigh fading

来源：评论

学校读者我要写书评

暂无评论

Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第8期71卷 4425-4436页

作者： Moradi, Mohsen Bilkent Univ Dept Elect & Elect Engn TR-06800 Ankara Turkiye

Despite the extreme error-correction performance, the amount of computation of sequential decoding of the polarization-adjusted convolutional (PAC) codes is random. In sequential decoding of convolutional codes, the cutoff rate denotes the region between rates whose average computational complexity of decoding is finite and those which is infinite. In this paper, by benefiting from the polarization and guessing techniques, we prove that the required computation in sequential decoding of pre-transformed polar codes polarizes, and this polarization determines which set of bit positions within the rate profile may result in high computational complexity. Based on this, we propose a technique for taming the Reed-Muller (RM) rate-profile construction, and the performance results demonstrate that the error-correction performance of the PAC codes can achieve the theoretical bounds using the tamed-RM rate-profile construction and requires a significantly lower computational complexity than the RM rate-profile construction.

关键词： PAC codes sequential decoding fano algorithm polar coding channel coding guessing cutoff rate

来源：评论

学校读者我要写书评

暂无评论

Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第2期70卷 1434-1447页

作者： Rowshan, Mohammad Burg, Andreas Viterbo, Emanuele Monash Univ Dept Elect & Comp Syst Engn ECSE Clayton Vic 3800 Australia Ecole Polytech Fed Lausanne Telecommun Circuits Lab CH-1015 Lausanne Switzerland

In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called polarization-adjusted convolutional (PAC) codes. In this scheme, a pair of polar mapper and demapper as pre- and postprocessing devices are deployed around a memoryless channel, which provides polarized information to an outer decoder leading to improved error correction performance of the outer code. In this paper, the list decoding and sequential decoding (including fano decoding and stack decoding) are first adapted for use to decode PAC codes. Then, to reduce the complexity of sequential decoding of PAC/polar codes, we propose (i) an adaptive heuristic metric, (ii) tree search constraints for backtracking to avoid exploration of unlikely sub-paths, and (iii) tree search strategies consistent with the pattern of error occurrence in polar codes. These contribute to the reduction of the average decoding time complexity from 50% to 80%, trading with 0.05 to 0.3 dB degradation in error correction performance within FER = 10(-3) range, respectively, relative to not applying the corresponding search strategies. Additionally, as an important ingredient in fano decoding of PAC/polar codes, an efficient computation method for the intermediate LLRs and partial sums is provided. This method is effective in backtracking and avoids storing the intermediate information or restarting the decoding process. Eventually, all three decoding algorithms are compared in terms of performance, complexity, and resource requirements.

关键词： Polarization-adjusted convolutional codes polar codes convolutional codes list decoding sequential decoding fano algorithm tree search path metric stack decoding

来源：评论

学校读者我要写书评

暂无评论

Sequential decoding of convolutional codes for Rayleigh fading channels

引用

WIRELESS PERSONAL COMMUNICATIONS 2002年第1期20卷 61-74页

作者： Orten, P Svensson, A Nera Res N-1375 Billingstad Norway Chalmers Univ Technol Dept Signals & Syst Commun Syst Grp SE-41296 Gothenburg Sweden

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50 x 50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.

关键词： sequential decoding Rayleigh fading fano algorithm Pareto exponent wireless communication quantization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：