• 대한전자공학회논문지SD
• /
• 제49권8호
• /
• pp.27-34
• /
• 2012

본 논문에서 H.264표준을 위해 2차원 $8{\times}8$ 순방향/역방향 정수 DCT 변환을 빠르고 효율적으로 계산할 수 있는 알고리즘을 제안한다. 순방향/역방향 변환은 간단한 시프트와 덧셈 동작을 사용하여 계산 복잡도를 줄였으며, DCT 연산에 메모리를 사용하지 않으므로 해서 불필요한 자원소모를 줄였다. 제안된 파이프라인 아키텍처의 최대 동작 주파수는 1.184GHz이며, 합성결과는 44864 게이트가 사용되어 25.27Gpixels/sec의 스루풋을 보여준다. 면적 비율에 비해 높은 스루풋으로 인해, 제안된 설계는 H.264/AVC 고해상도 비디오기술의 실시간 처리에 효율적으로 사용할 수 있다.

• 한국통신학회논문지
• /
• 제36권4A호
• /
• pp.414-422
• /
• 2011

모바일 WiMAX 표준 IEEE 802.16e의 블록길이 2,304 비트, 부호율 1/2을 지원하는 LDPC(low-density parity-check) 복호기를 설계하였다. 설계된 LDPC 복호기는 최소-합(min-sum) 알고리듬과 layered 복호를 기반으로 $96{\times}96$ 크기의 부행렬을 병렬로 처리하는 부분병렬 구조를 갖는다. 최소-합 알고리듬의 특징을 이용하여 메모리 용량을 감소시킬 수 있는 새로운 방법을 고안하여 적용함으로써 검사노드 메모리 용량을 기존의 방법보다 46% 감소시켰다. Verilog HDL로 설계된 LDPC 복호기를 $0.18{\mu}m$ CMOS 셀 라이브러리로 합성한 결과 174,181개의 게이트와 52,992 비프의 메모리로 구현되었으며, Eb/No=2.1dB의 AWGN 채널에 대해 평균 비트 오율 (BER)는 $4.34{\times}10^{-5}$이고, 100 MHz@1.8-V로 동작하여 약 417 Mbps의 성능을 갖는다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1415-1435
• /
• 2018

Resource allocation in device-to-device (D2D) aided cellular systems, in which the proximity users are allowed to communicate directly with each other without relying on the intervention of base stations (BSs), is investigated in this paper. A new uplink resource allocation policy is proposed by exploiting the relationship between D2D-access probability and channel gain among variant devices, such as cellular user equipments (CUEs), D2D user equipments (DUEs) and BSs, etc., under the constraints of their minimum signal to interference-plus-noise ratio (SINR) requirements. Furthermore, the proposed resource-allocation problem can be formulated as the cost function of "maximizing the number of simultaneously activated D2D pairs subject to the SINR constraints at both CUEs and DUEs". Numerical results relying on system-level simulations show that the proposed scheme is capable of substantially improving both the D2D-access probability and the network throughput without sacrificing the performance of conventional CUEs.

• International Journal of Contents
• /
• 제11권4호
• /
• pp.38-43
• /
• 2015

Non-orthogonal multiple access (NOMA) where all users share the entire time and frequency resource has paid attention as one of the key technologies to enhance the spectral efficiency and the total throughput. Nevertheless, as the number of users and SIC error increase, the inter-user interference and the residual interference due to the SIC error also increase, resulting in performance degradation. In order to mitigate the performance degradation, we propose grouping-based NOMA system. In the proposed scheme, all users are divided into two groups based on the distance between the BS and each user, where one utilizes the first half of the bandwidth and the other utilizes the rest in the orthogonal manner. On the other hand, users in each group share the spectrum in the non-orthogonal manner. Grouping users can reduce both the inter-user interference and residual interference due to the SIC error, so it can outperform conventional NOMA system, especially in case that the number of users and the SIC error increase. Based on that, we also present the hybrid operation of the conventional and the proposed NOMA systems. In numerical results, the total throughput of the proposed NOMA systems is compared with that of the conventional NOMA systems with regard to the number of users and SIC error. It is confirmed that the proposed NOMA system outperforms the conventional NOMA system as the number of users and the SIC error increase.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• 한국경영과학회지
• /
• 제22권1호
• /
• pp.101-121
• /
• 1997

Consider a Jackson type closed queueing network in which each queue has a single exponential server. Assume that N customers are moving among .kappa. queues. We propose a candidata procedure which yields a lower bound of the network throughput which is sharper than those which are currently available : Let (.rho.$_{1}$, ... .rho.$_{\kappa}$) be the loading vector, let x be a real number with 0 .leq. x .leq. N, and let y(x) denote that y is a function of x and be the unique positive solution of the equation. .sum.$_{i = 1}$$^{\kappa}$y(x) .rho.$_{i}$ (N - y(x) x $p_{i}$ ) = 1 Whitt [17] has shown that y(N) is a lower bound for the throughput. In this paper, we present evidence that y(N -1) is also a lower bound. In dosing so, we are led to formulate a rather general conjecture on 'quot;Migrating Critical Points'quot; (MCP). The .MCP. conjecture asserts that zeros of successive derivatives of certain rational functions migrate at an accelerating rate. We provide a proof of MCP in the polynomial case and some other special cases, including that in which the rational function has exactly two real poles and fewer than three real zeros.tion has exactly two real poles and fewer than three real zeros.

• 한국통신학회논문지
• /
• 제33권11B호
• /
• pp.981-988
• /
• 2008

본 논문에서는 MANET에서 효율적인 AODV 알고리즘을 제안한다. MANET에서는 전송 채널이 에러와 손실이 높기 때문에 홉 수를 절대적인 네트워크의 메트릭으로 볼 수 없다는 점이다. 제안된 기법은 크로스레이어 디자인을 이용하여 데이터 링크 계층에서 FER을 주기적으로 측정한 후, 각 노드는 링크 상태의 가중치를 AODV 프로토콜의 예약된 필드로 전송하는 방법을 사용하였다. 효과적인 경로 설정을 위해서 가중치의 합을 비교해서 채널 상태가 양호한 링크를 경로 설정에 사용하도록 설계하였다. 제안된 AODV는 기존 AODV 방식에 비하여 throughput, 라우팅 오버헤드 및 평균 전송 지연시간을 향상시킨다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권6호
• /
• pp.1606-1626
• /
• 2012

This paper investigates the performance of an amplify-and-forward (AF) two-way relaying system with antenna correlation. The system consists of two multiple-antenna sources, which exchange information via the aid of a single-antenna relay. In particular, we derive the exact outage probability expression. Furthermore, we provide a simple, tight closed-form lower bound for the outage probability. Based on the lower bound, we obtain the closed-form asymptotic outage probability and the average symbol error rate expressions at high signal-to-noise ratio (SNR), which reveal the system's diversity order and coding gain with antenna correlation. To investigate the system's throughput performance with antenna correlation, we also derive a closed-form lower bound for the average sum-rate, which is quite tight from medium to high SNR regime. The analytical results readily enable us to obtain insight into the effect of antenna correlation on the system's performance. Extensive Monte Carlo simulations are conducted to verify the analytical results.

• 디지털산업정보학회논문지
• /
• 제10권1호
• /
• pp.99-104
• /
• 2014

Nowadays, various researches fulfill in many communication engineering area for B4G (Beyond Forth Generation). Next LTE-A (Long Term Evolution Advanced), MU-MIMO (Multi-User Multi Input Multi Output) method raises to upgrade throughput performance. However, the method of user selection is not decided because of many types and discussions in MU-MIMO system. Many existing methods are powerful for enhancing performance but have various restrictions in practical implementation. Fairness problem is primary restriction in this area. Existing papers emphasis algorithm to increase sum-rate but we introduce an algorithm about dealing with fairness problem for real commercialization implementation. Therefore, this paper introduces new user selection method in MU-MIMO system. This method overcomes a fairness problem in SUS (Semiorthogonal User Selection) algorithm. We can use the method to get a similar sum-rate with SUS and a high fairness performance. And this paper uses a hybrid method with SC-SUS (Superposition Coding SUS) algorithm and SUS algorithm. We find a threshold value of optimal performance by experimental method. We show this performance by computer simulation with MATLAB and analysis that results. And we compare the results with another paper's that different way to solve fairness problem.

• 대한전자공학회논문지SD
• /
• 제47권5호
• /
• pp.31-40
• /
• 2010

본 논문에서는 IEEE 802.11n 무선 랜 표준용 LDPC 복호기 프로세서를 설계하였다. 설계된 프로세서는 IEEE 802.11n 표준의 블록길이 1,944와 부호화율 1/2의 패리티 검사 행렬을 지원하며, 하드웨어 감소를 위해 최소합 알고리듬과 layered 구조를 적용하였다. 최소합 알고리듬의 특징을 이용한 검사노드 메모리 최소화 방법을 고안하여 적용하였으며, 이를 통해 기존방법의 메모리 크기의 25%만을 사용하여 구현하였다. 설계된 프로세서를 $0.35-{\mu}m$ CMOS 셀 라이브러리로 합성한 결과, 200,400 게이트와 19,400 비트의 메모리로 구현되었으며, 80 MHz@2.5V로 동작하여 약 135 Mbps의 성능을 갖는다. 설계된 회로는 FPGA 구현을 통해 하드웨어 동작 검증과 복호성능을 분석하였으며, 이를 통해 설계된 LDPC 복호기의 유용성을 입증하였다.