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

An Efficient ZJ-Based Decoding algorithm for Space-Time Trellis Codes in Slow Rayleigh Fading Channels

IEEE TRANSACTIONS ON COMMUNICATIONS 2011年第2期59卷 337-342页

作者： Cha, Jongsub Kim, Youngok Lee, Heyungsub Kang, Joonhyuk R&D Patent Ctr Seoul 135080 South Korea Kwangwoon Univ Dept Elect Engn Seoul 139701 South Korea ETRI RFID USN Res Dept Taejon 305700 South Korea Korea Adv Inst Sci & Technol Taejon 305732 South Korea

In this paper, we propose a computationally efficient decoding algorithm for space-time trellis codes in slow Rayleigh fading channels. The proposed scheme is based on a stack algorithm with two key ideas: (i) a variable stack size depending upon the signal-to-noise ratio to avoid the exhaustive search of paths and (ii) a normalized metric, which is defined as each cumulative path metric divided by its own length in the stack, to provide an appropriate comparison of the paths with different lengths. Simulation results demonstrate that the proposed algorithm achieves near-ML performance with significant reduction in complexity, compared with the conventional Viterbi algorithm.

关键词： Space-time codes space-time trellis codes maximum likelihood decoding stack algorithm normalized metric

来源：评论

学校读者我要写书评

暂无评论

MLSE EQUALIZATION AND DECODING FOR MULTIPATH-FADING CHANNELS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1991年第10期39卷 1455-1464页

作者： SHEEN, WH STUBER, GL School of Electrical Engineering Georgia Institute of Technology Atlanta GA USA

The performance of a receiver using a combined MLSE equalizer/decoder and D-diversity reception is analyzed for multipath Rayleigh fading channels. A new upper bound on the (decoded) bit error probability is derived. Comparisons to simulation results show that this upper bound is quite tight when the system has a high signal-to-noise ratio or when diversity reception is employed. The upper bound involves an infinite series that must be truncated at a point where the remainder can be safely assumed to be small. An algorithm which is based on a one-directional stack algorithm is proposed for this calculation, because it makes efficient use of computer memory.

关键词： maximum likelihood sequence estimation stack algorithm computer memory Rayleigh fading Upper bound DECODING multi-path fading channel Infinite series diversity reception Remainder Simulation results bit error probability Equalization

来源：评论

学校读者我要写书评

暂无评论

stacked Bayesian Matching Pursuit for One-Bit Compressed Sensing

引用

IEEE SIGNAL PROCESSING LETTERS 2020年 27卷 550-554页

作者： Chae, Jeongmin Kim, Seonho Hong, Songnam Ajou Univ Dept Elect & Comp Engn Suwon 16499 South Korea Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA

We consider a compressed sensing problem to recover a sparse signal vector from a small number of one-bit quantized and noisy measurements. In this system, a probabilistic greedy algorithm, called bayesian matching pursuit (BMP), has been recently proposed in which a new support index is identified for each iteration, via a local optimal strategy based on a Gaussian-approximated maximum a posteriori estimation. Although BMP can outperform the other existing methods as Quantized Compressive Sampling Matched Pursuit (QCoSaMP) and Quantized Iterative Shrinkage-Thresholding algorithm (QISTA), its accuracy is still far from the optimal, yielding a locally optimal solution. Motivated by this, we propose an advanced greedy algorithm by leveraging the idea of a stack algorithm, which is referred to as stacked BMP (StBMP). The key idea of the proposed algorithm is to store a number of candidate partial paths (i.e., the candidate support sets) in an ordered stack and tries to find the global optimal solution by searching along the best path in the stack. The proposed method can efficiently remove unnecessary paths having lower path metrics, which can provide a lower complexity. Simulation results demonstrate that the proposed StBMP can significantly improve the BMP by keeping a low computational complexity.

关键词： Measurement Greedy algorithms Signal processing algorithms Matching pursuit algorithms Probabilistic logic Indexes Complexity theory One-bit compressed sensing greedy algorithm stack algorithm

来源：评论

学校读者我要写书评

暂无评论

Sequential Decoding of Short Length Binary Codes: Performance Versus Complexity

引用

IEEE COMMUNICATIONS LETTERS 2021年第10期25卷 3195-3198页

作者： Lian, Bo Kschischang, Frank R. Univ Toronto Edward S Rogers Sr Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

Sequential decoding of short length binary codes for the additive white Gaussian noise channel is considered. A variant of the variable-bias term (VBT) metric is introduced, producing useful trade-offs between performance and computational complexity. Comparisons are made with tail-biting convolutional codes decoded with a wrap-around Viterbi algorithm (WAVA) and with polar codes under successive-cancellation list (SCL) decoding. It is found that sequential decoding with the improved VBT metric has a better performance-complexity tradeoff than tail-biting codes under WAVA decoding (except at low complexities) but a worse performance-complexity tradeoff than polar codes under SCL decoding (except at high complexities).

关键词： Decoding Measurement Complexity theory Signal to noise ratio Maximum likelihood decoding Polar codes Convolutional codes Decoding complexity short length codes sequential decoding stack algorithm variable bias-term metric polar codes

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第3期58卷 1780-1793页

作者： Choi, Jun Won Shim, Byonghyo Singer, Andrew C. Cho, Nam Ik Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Korea Univ Sch Informat & Commun Seoul 136701 South Korea Seoul Natl Univ Dept Elect & Comp Engn Seoul 151744 South Korea

In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i. e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on M-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) (10(-1) similar to 10(-4)), while limiting performance loss to within 1 dB from ML detection.

关键词： Dimension reduction list tree search maximum-likelihood (ML) decoding minimum mean square error (MMSE) multiple input multiple output (MIMO) sphere decoding stack algorithm

来源：评论

学校读者我要写书评

暂无评论

On the decoding of convolutional codes on an unknown channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第7期45卷 2321-2332页

作者： Lapidoth, A Ziv, J MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA ETH Zentrum Swiss Fed Inst Technol CH-8092 Zurich Switzerland Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

An algorithm is proposed for universal decoding of convolutional/trellis codes employed over unknown channels. On discrete memoryless channels and at rates below the channel's computational cutoff rate (for a uniform input distribution), the algorithm achieves an asymptotic complexity-performance tradeoff similar to the tradeoff achieved by the Viterbi algorithm, but with the benefit that the algorithm's implementation does not require knowledge of the channel law. The algorithm is also applicable to channels with memory, and in particular to intersymbol interference (ISI) channels, to channels with nonlinear ISI, and even to general finite-state channels.

关键词： computational cutoff rate convolutional codes error exponent finite-state channels intersymbol interference nonlinear intersymbol interference sequential decoding stack algorithm trellis codes universal decoding Viterbi decoding

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE OF SEQUENTIAL-DECODING OF HIGH-RATE PUNCTURED CONVOLUTIONAL-CODES

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1994年第2-4期42卷 966-978页

作者： BEGIN, G HACCOUN, D ECOLE POLYTECH DEPT ELECT & COMP ENGNMONTREAL H3C 3A7QUEBECCANADA

The decoding of long memory high-rate punctured convolutional codes by sequential decoding algorithms is investigated. Both the stack and the Fano algorithms have been thoroughly tested through computer simulation with coding rates ranging from R = 2/3 to R = 7/8. Error and overflow probabilities and variability of decoding effort are similar for both algorithms. With hard quantization, plateaus appear in the cumulatives of decoding effort for both algorithms. Comparing the punctured approach of decoding to the more traditional technique for high-rate codes, it is found that punctured decoders perform a larger number of simpler computations, so that the overall decoding effort is on the average more important for the usual decoder than it is for its punctured counterpart. Finally, computational variability, error and overflow probabilities are no worse for punctured decoders than they are for normal decoders.

关键词： CONVOLUTIONAL CODE PUNCTURED HIGH-RATE SEQUENTIAL DECODING stack algorithm FANO

来源：评论

学校读者我要写书评

暂无评论

OFF-LINE CURSIVE SCRIPT WORD RECOGNITION

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1989年第1期11卷 68-83页

作者： BOZINOVIC, RM SRIHARI, SN SUNY BUFFALO DEPT COMP SCIBUFFALONY 14260

Cursive script word recognition is the problem of transforming a word from the iconic form of cursive writing to its symbolic form. Several component processes of a recognition system for isolated offline cursive script words are described. A word image is transformed through a hierarchy of representation levels: points, contours, features, letters, and words. A unique feature representation is generated bottom-up from the image using statistical dependences between letters and features. Ratings for partially formed words are computed using a stack algorithm and a lexicon represented as a trie. Several novel techniques for low- and intermediate-level processing for cursive script are described, including heuristics for reference line finding, letter segmentation based on detecting local minima along the lower contour and areas with low vertical profiles, simultaneous encoding of contours and their topological relationships, extracting features, and finding shape-oriented events. Experiments demonstrating the performance of the system are also described.

关键词： stack algorithm recognition system letter OFF LINE Dictionaries as Topic System performance Heuristics Rating Word images Social Hierarchy word recognition Correspondence BASELINE

来源：评论

学校读者我要写书评

暂无评论

ERROR-PROBABILITY FOR REDUCED-STATE SEQUENCE ESTIMATION

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1992年第3期10卷 571-578页

作者： SHEEN, WH STUBER, GL GEORGIA INST TECHNOL SCH ELECT ENGNATLANTAGA 30332

The performance of ideal reduced-state sequence estimation (RSSE) (without error propagation) is known as a good approximation to the performance of real RSSE. In the literature, the minimum distance of ideal RSSE has been employed for approximating the error probability of real RSSE. However, this approximation can be very poor, even though the system has a large signal-to-noise ratio. In this paper, a union upper bound on the error probability for ideal RSSE is used to approximate the true error probability. This union bound provides a better approximation than the minimum distance. A new method based on a stack algorithm and a subset-error state diagram is proposed for calculating this union bound. The stack algorithm is employed because it provides a good tradeoff between computer memory and computing time.

关键词： stack algorithm Error propagation computer memory RSSE minimum distance Error probability

来源：评论

学校读者我要写书评

暂无评论

ERROR-PROBABILITY OF REDUCED-STATE SEQUENCE ESTIMATION FOR TRELLIS-CODED MODULATION ON INTERSYMBOL INTERFERENCE CHANNELS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1993年第9期41卷 1265-1269页

作者： SHEEN, WH STUBER, GL School of Electrical Engineering Georgia Institute of Technology Atlanta GA USA

The error probability of reduced-state sequence estimation (RSSE) for trellis-coded modulation (TCM) on intersymbol interference channels is evaluated. A method based on a stack algorithm is proposed to evaluate the union bound on the error probability for ideal RSSE which is a good approximation to the error probability of real RSSE. The stack algorithm is employed because it provides a good tradeoff between computer memory and computing time.

关键词： stack algorithm RSSE trellis coded modulation Error probability intersymbolic interference computer memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：