• Journal of Communications and Networks
• /
• 제5권2호
• /
• pp.174-183
• /
• 2003

Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

• 대한전자공학회논문지TC
• /
• 제46권3호
• /
• pp.15-18
• /
• 2009

본 논문에서는 수신기에서 채널 추정을 필요로 하지 않는 MWSK (M-ary orthogonal Walsh sequence keying)를 적용한 ST-MWSK (space-time MWSK)를 제안한다. ST-MWSK의 noncoherent ML (maximum-likelihood) 검출기의 계산 복잡도는 기존의 ST-FSK (ST frequency-shift keying) 방식에 비해 크게 줄어든다. 또한 ST-MWSK는 ST-FSK와 거의 동일한 성능을 나타낸다.

• ETRI Journal
• /
• 제43권2호
• /
• pp.324-331
• /
• 2021

Space-based automatic dependent surveillance-broadcast (ADS-B) is an important emerging augmentation of existing ground-based ADS-B systems. In this paper, the problem of space-based ultra-long-range reception processing of ADS-B signals is described. We first introduce a header detection method for accurately determining the pulse position of a weak ADS-B signal. We designed a signal encoding method, shaping method, and fitness function. We then employed a genetic algorithm to perform high-precision frequency and phase estimations of the detected weak signal. The advantage of this algorithm is that it can simultaneously estimate the frequency and phase, meaning a direct coherent demodulation can be implemented. To address the computational complexity of the genetic algorithm, we improved the ratio algorithm for frequency estimation and raised the accuracy beyond that of the original ratio algorithm with only a slight increase in the computational complexity using relatively few sampling points.

• 한국통신학회논문지
• /
• 제29권11A
• /
• pp.1244-1252
• /
• 2004

본 논문에서는 Alamouti의 시공간블록부호화를 적용한 다중화 시스템에서 선형 검출기 (zero forcing 또는 minimum mean square error)의 특성을 유도하고 이를 이용하여 수신기의 복잡도를 줄일 수 있는 방안을 제시한다. MMSE 검출기를 적응형으로 설계할 경우 계산해야 하는 가중치 벡터들의 수는 공간 다중화하여 전송한 심볼들의 수만큼 필요하지만 유도한 특성을 이용하면 STBC블록들의 수로 줄어든다. 적응형 알고리즘으로 RLS 알고리즘을 적용해 보았고 복잡도를 50%이상 줄일 수 있었다. 또한 V-Blast검출방법의 복잡도를 줄이기 위해 제안된 정렬QR분해 검출기를 본 시스템에 적용할 때 동일한 특성이 유니타리 행렬 Q와 상위삼각행렬 R에 나타나는 것을 확인하였고, 이 경우에도 성능의 저하 없이 복잡도를 50%까지 줄일 수 있었다.

• 정보보호학회논문지
• /
• 제20권5호
• /
• pp.11-22
• /
• 2010

최근 Fan과 Dai는 이진체 곱셈기의 효율성을 개선하기 위하여 Shifted Polynomial Basis(SPB)를 제안하고 이를 이용한 non-pipeline 비트-병렬 곱셈기를 제안하였다. SPB는 PB에 {1, ${\alpha}$, $\cdots$, ${\alpha}^{n-l}$}에 ${\alpha}^{-\upsilon}$를 곱한 것으로, 이 둘 사이는 매우 적은 비용으로 쉽게 기저 변환이 된다. 이후 삼항 기약다항식 $f(x)=x^n+x^k+1$을 사용하여 Modified Shifted Polynomial Basis(MSPB) 기반의 SPB 비트-병렬 Mastrovito type I과 type II 곱셈기가 제안되었다. 본 논문에서는 SPB를 이용한 비트-병렬 곱셈기를 제안한다. n ${\neq}$ 2k 일 때 제안하는 곱셈기 구조는 기존의 모든 SPB 곱셈기와 비교하여 효율적인 공간 복잡도를 가진다. 또한, 기존의 가장 작은 공간 복잡도를 가지는 곱셈기와 비교하여 1 ${\leq}$ k ${\leq}$ (n+1)/3인 경우 항상 효율적이다. 또한, (n+2)/3 $\leq$ k < n/2인 경우에도 일분 경우를 제외하고 기존 결과보다 항상 작은 공간 복잡도를 가진다.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.607-620
• /
• 2002

In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.

• 한국조경학회지
• /
• 제27권1호
• /
• pp.11-18
• /
• 1999

The objective of this study are to figure out the physical attributes of the three predictors in the Informational Approach: complexity, coherence, mystery and to investigate the relationships between these attributes and the preference exploratively. Visual inspection of the scenes relative to their rated levels of the predictors revealed the existence of relationship between these variables and the physical attributes. The following are the summary of the relationship between three predictors and the physical attributes: (1) The level of complexity was associated with the pattern of physical attributes which were the amount of facility, line, shape, color plant and arrangement of the visual elements. (2) The level of coherence was related with the regular arrangement of the visual elements. For example, there was certain pattern founded the color, shape, texture was applied to the various space repetitively and symmetrically. (3) The level of mystery had the relationship with the physical attributes of screen, spatial definition, distance of view, physical accessibility, radiant forest, the depth of space.

• 한국통신학회논문지
• /
• 제38A권2호
• /
• pp.143-155
• /
• 2013

주파수 선택적 페이딩 환경에서 두 사용자가 OFDM 기법과 단일 안테나를 이용하여 기지국으로 동시에 신호를 전송할 때 다이버시티 이득을 효과적으로 얻고 다른 사용자의 간섭을 제거할 수 있는 기법을 제안한다. 이 기법은 기존의 주파수-공간 부호화 기법을 변형한 것으로 부분 간섭 제거 및 연속 간섭 제거 수신기를 통해 낮은 복잡도로 두 사용자의 신호를 복구할 수 있다. 주파수 다이버시티를 고려하지 않은 기존의 다중 전송 신호를 ZF 및 최대우도 기법으로 복호하는 기법과 비교하여 제안하는 기법의 우수한 성능을 모의실험을 통해 고찰하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.126-130
• /
• 2005

In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providingthe V-BLAST schemes with ML performance at low detection complexity.

• 한국통신학회논문지
• /
• 제32권2C호
• /
• pp.160-165
• /
• 2007

In this paper, we propose a novel signal detection method that achieves the maximum likelihood (ML) performance but requires much less computational complexity than the ML detection. When the well-known linear decoding method is used for space-time block coded (STBC) OFDM systems in fast-fading channels, co-channel interference (CCI) as well as inter-carrier interference (ICI) occurs. A maximum likelihood (ML) method can be employed to deal with the CCI; however, its computational complexity is very high. In this paper, we propose a signal detection method for orthogonal space-time coded OFDM systems that achieves the similar error performance as the ML method, but requires much less computational complexity.