페이딩 채널에서 직렬 결합 CPM (SCCPM)에 대한 RS-A-SISO 알고리즘과 확률 밀도 진화 분석

정규혁,허준,Chung, Kyu-Hyuk,Heo, Jun 대한전자공학회 2005 電子工學會論文誌-TC (Telecommunications) Vol.42 No.7

Iterative detection은 additive white Gaussian noise(AWGN) channel의 경우 interleaver들을 포함한 조합유한상태머신(concatenated Finite State Machine)들에 대해 근사적으로 optimal solution에 가깝다는 것이 입증되었습니다. 수신단에서 정확한 채널 상태 정보(perfect channel state information)가 얻어질 수 없는 경우 adaptive Iterative detection이 시간적으로 변하거나 또는 부정확한 채널 변수를 다루기위해 필요합니다. Iterative detection과 adaptive iterative detection대한 기본 building block은 각각 Soft-Input Soft-Output (SISO)와adaptive SISO (A-SISO)입니다. SISO와 A-SISO의 complexity은 state memory나 channel memory에 비례해서 지수적으로 증가합니다. 본 논문에서는 Reduced State SISO (RS-SISO) 알고리즘이 A-SISO의 complexity 감소를 위해 적용되어 fading ISI channel을 통한 serially concatenated CPM의 성능이 adaptive iterative detection을 이용하면 터보 코드 같은 성능을 나타내는 것과 또한 RS-A-SISO system이 큰 iterative detection gain을 가지는 것을 보였습니다. RS-A-SISO 알고리즘에 대한 다양한 design option들의 성능을 평가하였으며 성능과 complexity를 비교하였습니다. 또한 보통 AWGN 채널에서 사용되어지는 density evolution 분석기법이 주파수 선택적인 페이딩 채널에서 RS-A-SISO 시스템에서도 좋은 분석기법임을 보였습니다 Iterative detection (ID) has proven to be a near-optimal solution for concatenated Finite State Machines (FSMs) with interleavers over an additive white Gaussian noise (AWGN) channel. When perfect channel state information (CSI) is not available at the receiver, an adaptive ID (AID) scheme is required to deal with the unknown, and possibly time-varying parameters. The basic building block for ID or AID is the soft-input soft-output (SISO) or adaptive SISO (A-SISO) module. In this paper, Reduced State SISO (RS-SISO) algorithms have been applied for complexity reduction of the A-SISO module. We show that serially concatenated CPM (SCCPM) with AID has turbo-like performance over fading ISI channels and also RS-A-SISO systems have large iteration gains. Various design options for RS-A-SISO algorithms are evaluated. Recently developed density evolution technique is used to analyze RS-A-SISO algorithms. We show that density evolution technique that is usually used for AWGN systems is also a good analysis tool for RS-A-SISO systems over frequency-selective fading channels.

A comparative study of low-complexity MMSE signal detection for massive MIMO systems

( Shufeng Zhao ),( Bin Shen ),( Quan Hua ) 한국인터넷정보학회 2018 KSII Transactions on Internet and Information Syst Vol.12 No.4

For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from □(K³) to □(K²) or □(NK) with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.

Iterative Error Analysis 기반 분광혼합분석에 의한 초분광 영상의 표적물질 탐지 기법

김광은,Kim, Kwang-Eun 대한원격탐사학회 2017 大韓遠隔探査學會誌 Vol.33 No.5

In this paper, a new spectral unmixing based target detection algorithm is proposed which adopted Iterative Error Analysis as a tool for extraction of background endmembers by using the target spectrum to be detected as initial endmember. In the presented method, the number of background endmembers is automatically decided during the IEA by stopping the iteration when the maximum change in abundance of the target is less than a given threshold value. The proposed algorithm does not have the dependence on the selection of image endmembers in the model-based approaches such as Orthogonal Subspace Projection and the target influence on the background statistics in the stochastic approaches such as Matched Filter. The experimental result with hyperspectral image data where various real and simulated targets are implanted shows that the proposed method is very effective for the detection of both rare and non-rare targets. It is expected that the proposed method can be effectively used for mineral detection and mapping as well as target object detection. 본 연구에서는 탐지하고자 하는 표적신호를 초기 엔드멤버로 하여 Iterative Error Analysis를 통해 배경물질들의 반사 스펙트럼을 순차적으로 엔드멤버로 추출하고, 추출된 엔드멤버들을 이용하여 분광 혼합분석함으로써 표적물질의 분포를 탐지하는 새로운 초분광 표적탐지 기법을 제안한다. 제안된 기법에서는 표적물질에 대한 점유율의 변화가 주어진 문턱값보다 작아질 때 엔드멤버 추출을 위한 반복을 멈추게 된다. 이 기법은 Orthogonal Subspace Projection과 같은 모델 기반 표적 탐지기법들과 달리 사전에 엔드멤버들을 확보해야 할 필요가 없으며, Matched Filter와 같은 확률론적 표적 탐지 기법들과 달리 배경 전체를 하나의 신호로 특징화하지 않기 때문에 표적의 희소성 여부에 의한 영향을 받지 않는다는 장점을 가지고 있다. 실제 항공 초분광 영상자료 및 다양한 인공 표적물질들이 삽입된 모의 초분광 영상자료를 이용한 실험 결과, 제안된 방법이 희소 및 비 희소 표적의 탐지에 매우 효과적임이 확인되었다. 제안된 방법은 표적 물체 탐지뿐만 아니라 광물, 오염물질 등 자원 및 환경 분야에서 다양한 피복 물질을 탐지하는데 효과적으로 사용될 수 있을 것으로 기대된다.

Chip-Interleaved Self-Encoded Multiple Access with Iterative Detection in Fading Channels

Kim, Youn-Seok,Jang, Won-Mee,Kong, Yan,Nguyen, Lim The Korea Institute of Information and Commucation 2007 Journal of communications and networks Vol.9 No.1

We propose to apply chip interleaving and iterative detection to self-encoded multiple access (SEMA) communications. In SEMA, the spreading code is obtained from user bit information itself without using a pseudo noise code generator. The proposed scheme exploits the inherent diversity in self encoded spread spectrum signals. Chip interleaving not only increases the diversity gain, but also enhances the performance of iterative detection. We employ user-mask and interference cancellation to decouple self-encoded multiuser signals. This paper describes the proposed scheme and analyzes its performance. The analytical and simulation results show that the proposed system can achieve a 3 dB power gain and possess a diversity gain that can yield a significant performance improvement in both Rayleigh and multipath fading channels.

M-레벨 QAM 계층 변조 시스템에서 연 간섭 제거를 이용한 연속 MAP 판정 기법

김종경(Jongkyung Kim),서종수(Jongsoo Seo) 한국통신학회 2009 韓國通信學會論文誌 Vol.34 No.3

본 논문은 M-레벨 QAM 계층 변조 시스템에서 반복 수신기의 복잡도를 줄이기 위한 연속 MAP(maximum a posteriori probability) 검파 방식을 제안한다. 계층 변조 신호 내의 특정 우선 순위를 갖는 신호는 계층 변조 신호를 구성하는 각 신호를 우선 순위에 따라 간섭 신호 성분으로서 제거하거나 가우시안 잡음으로 간주한 후 MAP 방식에 의해 순차적으로 검파된다. 검파 과정을 순차적으로 진행함으로써 반복 수신의 복잡도를 신호 당 전송되는 비트 수에 선형적으로 증가하도록 감소시킬 수 있으며 각 부호화 비트의 연판정 값 계산 시 간섭 제거와 가우시안 가정의 효과를 검파 과정에 반영하여 잡음 분산을 조정함으로써 순차적 검파 방식에 의해 발생할 수 있는 성능 열화를 최소화한다. 전산 모의 실험을 통하여 제안하는 순차적 MAP 검파 방식의 성능이 최적 MAP 검파 방식과 비교하여 0.5dB 미만의 성능열화를 나타내는 것을 보인다. This paper proposes a successive MAP (maximum a posteriori probability) detection scheme with SoIC(soft interference cancellation) to reduce the receiver complexity of hierarchical M-ary QAM system. For the successive MAP detection, modulation symbols generated from the other data streams are treated as Gaussian noise or eliminated as the soft interference according to their priorities. The log-likelihood ratio of the a posteriori probability (LAPRP) of each bit is calculated by the MAP detector with an adjusted noise variance in order to take the elimination and Gaussian assumption effect into account. By separating the detection process into the successive steps, the detection complexity is reduced to increase linearly with the number of bits per hierarchical M-ary QAM symbol. Simulation results show that the proposed detection provides a small performance degradation as compared to the optimal MAP detection.

Self-Encoded Spread Spectrum with Iterative Detection under Pulsed-Noise Jamming

Duraisamy, Poomathi,Nguyen, Lim The Korea Institute of Information and Commucation 2013 Journal of communications and networks Vol.15 No.3

Self-encoded spread spectrum (SESS) is a novel modulation technique that acquires its spreading code from a random information source, rather than using the traditional pseudo-random noise (PN) codes. In this paper, we present our study of the SESS system performance under pulsed-noise jamming and show that iterative detection can significantly improve the bit error rate (BER) performance. The jamming performance of the SESS with correlation detection is verified to be similar to that of the conventional direct sequence spread spectrum (DSSS) system. On the other hand, the time diversity detection of the SESS can completely mitigate the effect of jamming by exploiting the inherent temporal diversity of the SESS system. Furthermore, iterative detection with multiple iterations can not only eliminate the jamming completely but also achieve a gain of approximately 1 dB at $10^{-3}$ BER as compared with the binary phase shift keying (BPSK) system under additive white gaussian noise (AWGN) by effectively combining the correlation and time diversity detections.

A new algorithm of abstracting numeric image outline

Xiao-Feng Shang,Xue-Heng Tao,Xin Zhao,Jin-Shi Lu 한국멀티미디어학회 2006 한국멀티미디어학회 국제학술대회 Vol.2006 No.-

A new algorithm based on iterative-dynamic algorithm and edge detection algorithm has been formulated in this paper. In the experiment, the binary image was first introduced by iterative-dynamic threshold algorithm, which had a good performance in restraining noise. Gauss filter was then applied to the binary image in order to eliminate some false edge pixels; statistic and differential coefficient methods were used for calculating the grads-in-image of scope and direction. The object edge was hereby detected and abstracted by using double threshold. Compared with traditional edge abstraction algorithm, the algorithm is advanced in solving the main problem that traditional edge abstraction was in the face of. By reason of using iterative-dynamic algorithm in the first step, it has perfect quality in restraining variety of disturbing factor, like random noise, optic distortion, light intensity and so on. Due to the application of statistic and differential coefficient, the perfect outcome was realized. The results of experiments have indicated that the edge of complex image can be precisely abstracted and the drawbacks of traditional edge detection algorithm can be thoroughly overcome by means of this method.

Efficient SIC-MMSE MIMO detection with three iterative loops

Ahmed, Saleem,Kim, Sooyoung Elsevier 2017 International journal of electronics and communica Vol.72 No.-

<P><B>Abstract</B></P> <P>In this paper, we propose an efficient joint iterative detection and decoding (JIDD) scheme with a soft interference cancellation minimum mean squared error (SIC-MMSE) based method for a turbo coded multiple-input multiple-output (MIMO) system. In the proposed method, we activate a loop inside the SIC-MMSE based MIMO detection process in addition to the iterative loop between the MIMO detector and turbo decoder, so that the iteration inside the SIC-MMSE detection can be performed in parallel to the iterations inside the turbo decoder. Subsequently, soft outputs from each loop is exchanged for next further iteration, and this makes three iterative loops in total. In comparison with the conventional JIDD schemes, employing additional loop inside the MIMO detection process largely contributes to enhance the performance. In addition, the additional loop speeds up the performance convergence and eventually requires smaller overall computational complexity at the same performance.</P>

Distributed and Centralized Iterative Detection of Self-Encoded Spread Spectrum in Multi-Channel Communication

Chi, Liang,Jang, Won-Mee,Nguyen, Lim The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.3

We propose self-encoded spread spectrum with two different iterative detection methods in multi-channel communication. The centralized iterative detection outperforms the iterative detection distributed over multiple channels. The results show that self-encoded spread spectrum with the centralized iterative detection is an excellent candidate for cognitive radio network.

Distributed and Centralized Iterative Detection of Self-Encoded Spread Spectrum in Multi-Channel Communication

Liang Chi,Won Mee Jang,Lim Nguyen 한국통신학회 2012 Journal of communications and networks Vol.14 No.3

We propose self-encoded spread spectrum with two different iterative detection methods in multi-channel communication. The centralized iterative detection outperforms the iterative detection distributed over multiple channels. The results show that self-encoded spread spectrum with the centralized iterative detection is an excellent candidate for cognitive radio network.