• 전기전자학회논문지
• /
• 제9권2호
• /
• pp.123-135
• /
• 2005

3GPP는 RLC 프로토콜 명세서에서 신뢰할 수 있는 데이타 전송을 위해 window에 의해 조절되는 selective-repeat ARQ 방식을 채택하였다. 3GPP의 ARQ는 selective-repeat ARQ 부류에 속하므로 재정렬 문제가 불가피하게 야기된다. 긴 재정렬 시간은 throughput 및 지연 성능의 열화를 빚어내고 재정렬 버퍼의 범람을 불러올 수 있다. 또한 데이타의 상실 및 지연에 모두 민감한 서비스의 요구 조건을 수용하기 위해 재정렬 시간은 반드시 통제되어야 한다. 3GPP ARQ에서 window의 크기나 상태 보고 주기를 줄여 재정렬 버퍼의 점유량을 감소시킬 수 있다. 이로 인해 throughput 및 지연 성능이 저하되고 역방향 채널의 자원이 잠식된다. 재정렬 버퍼의 점유량을 줄이는 동시에 throughput 및 지연 성능의 열화를 억제하기 위한 방안으로 본 논문에서는 post-threshold 방식과 pre-threshold 방식이라는 threshold에 의존하는 점유량 조절 방식을 제안한다. 제안한 방식의 효과성을 판단하기 위해 fading 채널 등 실제적인 환경에서 최고 점유량, 최대 throughput, 평균 지연을 조사한다. 모의 실험 결과로부터 제안한 방식이 점유량과 throughput 간에 trade-off를 불러옴을 관찰한다. 또한 post-threshold 방식은 3GPP의 ARQ와 비교하여 재정렬 버퍼의 점유량을 증가시키지 않고 throughput 및 지연 성능을 향상시킬 수 있음을 확인한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권3호
• /
• pp.494-507
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in 8 ${\times}$ 8 MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi's scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In 4 ${\times}$ 4 MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.330-343
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in $8{\times}8$ MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi’s scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In $4{\times}4$ MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.274-275
• /
• 2000

This paper introduces new ordering algorithms using the graph of data structure and forward/backward substitution of LU decomposition using recursive function. The performance of the algorithm is compared with Tinney's algorithm using 14 bus systems. Test results show that the new fill-in element of Jacobian matrix using the proposed ordering algorithm is same as that of Tinner scheme 3 and the forward/backward substitution can reduce the computation time

• Journal of Communications and Networks
• /
• 제13권2호
• /
• pp.167-174
• /
• 2011

In this paper, we propose and simulate an efficient interference cancellation scheme with an optimal ordering successive interference cancellation (SIC) algorithm for ultra wideband (UWB)/multiple-input-multiple-output (MIMO) systems in a wireless body area network (WBAN). When there are several wireless communication devices on a human body, multiple access interference (MAI) usually occurs. To mitigate the effect of MAI and achieve additional diversity gain, we utilize SIC with an optimal ordering algorithm. A zero correlation duration (ZCD) code with robust MAI capability is employed as a spread code for UWB systems in a multi-device WBAN environment. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER). Simulation results confirm that the BER performance can be improved significantly if the proposed interference cancellation scheme and the ZCD code are jointly employed.

• 한국컴퓨터정보학회논문지
• /
• 제10권5호
• /
• pp.57-64
• /
• 2005

각기 다른 보안 등급을 가지고 트랜잭션을 실행하는 다중 등급 보안 데이터베이스관리시스템에서의 보안 동시성 제어 기법은 비밀통로에 대한 고려가 있어야 한다. 보안 동시성 제어에 관한 선행 연구들은 동시성 제어 과정에서의 기밀성은 보장하고 있지만 무결성과 가용성에 대한 고려를 간과하고 있다. 본 논문에서는 검증된 트랜잭션 순서 관계를 사용하여 각기 다른 보안 등급의 트랜잭션들 간에 형평성을 제공하는 보안 동시성 제어 기법을 제안한다.

• 산업기술연구
• /
• 제16권
• /
• pp.247-256
• /
• 1996

The multilevel grid file(MLGF) is a dynamic multidimensional file organization supporting multi-attribute accesses efficiently. The paper proposes new method for batch-constructing MLGFs. Our method consists of two phases. The first phase begins by relocating all the objects in order that logically adjacent objects in multidimensional domain space are clustered in one dimensional physical space. For this, our method employs the Z-ordering scheme, which effectively maps multidimensional space into one dimensional space preserving proximity. The second phase paginates the relocated objects and creates leaf level directory entries, each of which corresponds to a object page. Simultaneously, it performs same actions on the directory entries recursively in a bottom-up fashion until the root directory fits in a page. For performance evaluation, we analyze our method in terms of the number of page accesses. The result shows the optimality of our method.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.283-296
• /
• 2005

It is well known that the ordering of the unknowns can have a significant effect on the convergence of a preconditioned iterative method and on its implementation on a parallel computer. To do so, we introduce a block red-black coloring to increase the degree of parallelism in the application of the block ILU preconditioner for solving sparse matrices, arising from convection-diffusion equations discretized using the finite difference scheme (five-point operator). We study the preconditioned PGMRES iterative method for solving these linear systems.

• ETRI Journal
• /
• 제29권2호
• /
• pp.240-242
• /
• 2007

This letter proposes a simplified maximum likelihood detection (SMLD) scheme to improve the detection performance of multiple-input multiple-output receivers. The SMLD detects V streams according to the first detected V sub-streams. Through an ML test, the most probable stream is selected. Moreover, to detect the layer with the worst post-detection SNR accurately, reverse ordering is applied to the SMLD. Simulation results show that the performance of the Vertical Bell Laboratories layered space-time (V-BLAST) system can be improved by adopting the SMLD technique. In the case of reverse ordering, the SMLD can achieve a similar ML performance with significant reduction in computational complexity.

• 한국정보통신학회논문지
• /
• 제21권3호
• /
• pp.523-529
• /
• 2017

본 논문은 송신에 이용되는 활성 송신 안테나와 송신 심볼을 이용해 정보를 전송하는 일반화 공간 변조 시스템에서 송신/수신 순서화를 결합하여 기존의 구복호 수신기보다 낮은 계산 복잡도를 갖는 수신 방식을 제안한다. 제안 수신기는 수신 순서화를 통해 수신 신호 연산을 최적의 순서로 수행하여 구 밖의 후보해에 대한 연산을 조기에 종료함으로써 계산량을 줄인다. 또한, 송신 순서화 방식을 적용하여 심볼과 활성 송신 안테나 탐색에서 해일 확률이 높은 후보 해부터 탐색을 수행하여 계산량을 낮추도록 한다. 모의실험을 통해 송신/수신 순서화를 적용한 제안 구복호 수신기가 기존 구복호 기법, 수신 순서화만 적용한 구복호 기법과 비교하여 동일한 비트오류율 성능을 유지하면서 더 낮은 계산 복잡도를 가짐을 확인하였다.