Multi-channel Recursive Least-Squares Algorithm Adaptive Filter

碩士 === 國立高雄應用科技大學 === 電子與資訊工程研究所碩士班 === 94 === The well-known code division multiple access (CDMA) decorrelating detector (DD) uses a bank of correlators, followed by the inverse of the matrix operation to eliminate the multiple access interference (MAI). However, the operation for the inverse of th...

Full description

Bibliographic Details
Main Authors: Hsing-Hsuan Chien, 簡杏軒
Other Authors: Te-Jen Su
Format: Others
Language:zh-TW
Published: 2006
Online Access:http://ndltd.ncl.edu.tw/handle/82854445515589945692
id ndltd-TW-094KUAS0393034
record_format oai_dc
spelling ndltd-TW-094KUAS03930342016-06-01T04:21:41Z http://ndltd.ncl.edu.tw/handle/82854445515589945692 Multi-channel Recursive Least-Squares Algorithm Adaptive Filter 多通道遞迴最小平方演算法之適應性濾波器 Hsing-Hsuan Chien 簡杏軒 碩士 國立高雄應用科技大學 電子與資訊工程研究所碩士班 94 The well-known code division multiple access (CDMA) decorrelating detector (DD) uses a bank of correlators, followed by the inverse of the matrix operation to eliminate the multiple access interference (MAI). However, the operation for the inverse of the matrix involves a great deal of computation, especially when the users’ number is large. Therefore, in this thesis, we propose some recursive methods, the Least-Mean-Square (LMS) algorithm and the Recursive Least-Squares (RLS) algorithm, to detect users’ signals adaptively. We make use of the analogy between a traditional Winner filter and the decorrelating detector to construct adaptive implementation schemes of the decorrelating detector, called decorrelating transversal filter . We applied both LMS algorithm and RLS algorithm to the decorrelating transversal filter, just as the ways to apply the LMS algorithm and RLS algorithm to the Winner filters. With the proposed schemes, we can greatly reduce the computational complexity of a CDMA multi-user detector while maintaining an acceptable performance. Te-Jen Su 蘇德仁 2006 學位論文 ; thesis 61 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立高雄應用科技大學 === 電子與資訊工程研究所碩士班 === 94 === The well-known code division multiple access (CDMA) decorrelating detector (DD) uses a bank of correlators, followed by the inverse of the matrix operation to eliminate the multiple access interference (MAI). However, the operation for the inverse of the matrix involves a great deal of computation, especially when the users’ number is large. Therefore, in this thesis, we propose some recursive methods, the Least-Mean-Square (LMS) algorithm and the Recursive Least-Squares (RLS) algorithm, to detect users’ signals adaptively. We make use of the analogy between a traditional Winner filter and the decorrelating detector to construct adaptive implementation schemes of the decorrelating detector, called decorrelating transversal filter . We applied both LMS algorithm and RLS algorithm to the decorrelating transversal filter, just as the ways to apply the LMS algorithm and RLS algorithm to the Winner filters. With the proposed schemes, we can greatly reduce the computational complexity of a CDMA multi-user detector while maintaining an acceptable performance.
author2 Te-Jen Su
author_facet Te-Jen Su
Hsing-Hsuan Chien
簡杏軒
author Hsing-Hsuan Chien
簡杏軒
spellingShingle Hsing-Hsuan Chien
簡杏軒
Multi-channel Recursive Least-Squares Algorithm Adaptive Filter
author_sort Hsing-Hsuan Chien
title Multi-channel Recursive Least-Squares Algorithm Adaptive Filter
title_short Multi-channel Recursive Least-Squares Algorithm Adaptive Filter
title_full Multi-channel Recursive Least-Squares Algorithm Adaptive Filter
title_fullStr Multi-channel Recursive Least-Squares Algorithm Adaptive Filter
title_full_unstemmed Multi-channel Recursive Least-Squares Algorithm Adaptive Filter
title_sort multi-channel recursive least-squares algorithm adaptive filter
publishDate 2006
url http://ndltd.ncl.edu.tw/handle/82854445515589945692
work_keys_str_mv AT hsinghsuanchien multichannelrecursiveleastsquaresalgorithmadaptivefilter
AT jiǎnxìngxuān multichannelrecursiveleastsquaresalgorithmadaptivefilter
AT hsinghsuanchien duōtōngdàodìhuízuìxiǎopíngfāngyǎnsuànfǎzhīshìyīngxìnglǜbōqì
AT jiǎnxìngxuān duōtōngdàodìhuízuìxiǎopíngfāngyǎnsuànfǎzhīshìyīngxìnglǜbōqì
_version_ 1718289486346977280