• The Journal of the Convergence on Culture Technology
• /
• v.9 no.5
• /
• pp.229-235
• /
• 2023

This study investigates the relationship between syntactic complexity indices and scores on language use in Jacobs et al.(1981)' analytic rating scale. Syntactic complexity indices obtained from TAASSC program and 440 essays written by EFL students from the ICNALE corpus were analyzed. Specifically, this study explores the relationship between scores on language use and Lu(2011)'s traditional syntactic complexity indices, phrasal complexity indices, and clausal complexity indices, respectively. Results of the stepwise regression analysis showed that phrasal complexity indices turned out to be the best predictor of scores on language use, although the variance in scores on language use was relatively small, compared with the previous study. Implications of the findings of the current study for writing instruction (i.e., syntactic structures at the phrase level) were also discussed.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.635-646
• /
• 2011

In distributed video coding, low complexity encoder can be realized by shifting encoder-side complex processes to decoder-side. However, not only motion estimation/compensation processes but also complex LDPC decoding process are imposed to the Wyner-Ziv decoder, therefore decoder-side complexity has been one important issue to improve. LDPC decoding process consists of numerous iterative decoding processes, therefore complexity increases as the number of iteration increases. This iterative LDPC decoding process accounts for more than 60% of whole WZ decoding complexity, therefore it can be said to be a main target for complexity reduction. Previously, HDA (Hard Decision Aided) method is introduced for fast LDPC decoding process. For currently received parity bits, HDA method certainly reduces the complexity of decoding process, however, LDPC decoding process is still performed even with insufficient amount of parity request which cannot lead to successful LDPC decoding. Therefore, we can further reduce complexity by avoiding the decoding process for insufficient parity bits. In this paper, therefore, a parity request estimation method is proposed using bit plane-wise correlation and temporal correlation. Joint usage of HDA method and the proposed method achieves about 72% of complexity reduction in LDPC decoding process, while rate distortion performance is degraded only by -0.0275 dB in BDPSNR.

• Journal of Broadcast Engineering
• /
• v.17 no.5
• /
• pp.781-788
• /
• 2012

In HEVC, the fast search method is used for reducing the complexity of the motion prediction procedure. It is consisted of the sub-sampled SAD which reduce the complexity of Sum of Absolute Differences(SAD) calculation and the simplified bi-prediction method which reduce the iterations of the uni-prediction for the bi-prediction. The computational complexity is largely decreased by the fast search method but the coding gain is also decreased. In this paper, the simplified bi-prediction is extended to compensate the performance loss and the prediction cost based complexity reduction methods are also proposed to reduce the complexity burden by the extended bi-prediction method. A prediction cost based complexity reduction method is consisted of early termination method for the extended bi-prediction and the bi-prediction skipping method. Compare with HM 6.0 references S/W, the average 0.42% of BD-bitrate is decreased by both the extended bi-prediction method and the prediction cost based complexity reduction methods with negligible increasement of the complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.183-191
• /
• 2014

In this study Cyclomatic Complexity of Web Software has been analyzed quantitatively by correlation between complexity and Number of Classes(NOC), and Number of Methods(NOM) which are object oriented programming measures. Based on the frequency distribution of complexity, NOC and NOM of software at the Web environment, correlation between complexity threshold and NOC threshold, and NOM threshold has been measured and more than 4,000 ASP files of 10 Web real projects have been used as the sample. The empirical result shows that NOC threshold is 21, NOM threshold is 40 and complexity threshold is 68 as high value, and 8 projects among of 10 except 2 projects with especially high frequency distribution shows that NOC threshold is 12, NOM threshold is 21 and complexity threshold is 52 with relatively low value, so correlation has been found out as exists. And also 8 projects with low threshold of complexity, NOC and NOM were internal management software, and the other 2 projects were external sales service software, Number of Classes and Number of Methods can be defined at the design stage according to business properties, and also the complexity can be estimated in order to improve the software quality.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.325-327
• /
• 2006

H.264/AVC는 ITU-T H.264와 ISO/IEC 14496-10(MPEG-4 Part 10)으로 승인된 새로운 국제 비디오 압축 표준이다. H.264/AVC는 압축부호화 효율(이하 압축률)이 높으며 MPEG-2나 MPEG-4등에 비해 압축률이 2배 이상 향상되었으나 복잡도 또한 훨씬 증가하였다. 월등한 압축성능 때문에 방송 분야(DTV 등), 저장용 시스템 분야(PVR 등)에 많은 응용 분야들에 적용하기 위한 움직임이 있다. 그러나, 디코더로 구현하면 복잡도 증가하는 문제가 발생한다. HD급을 지원하기 위한 메모리 대역폭의 경우 MPEG-2 HD에 비해 H.264/AVC만의 복잡한 움직임 보상으로 인해 2배 이상이 요구된다. H.264/AVC 디코더는 두 개의 참조픽처를 이용하여 움직임 보상하는 B-픽처와 쌍예측 픽처가있다. 여기서, 참조픽처를 각각 하나씩만 사용하여 디코딩 하면 기존의 복잡도를 줄일 수 있다. 본 논문에서 제안하는 방법은 하나의 참조픽처 선택으로 H.264/AVC 소프트웨어 디코더에서 움직임 보상을 한다. 이로 인하여 복잡도와 메모리 대역폭이 감소하는 방법을 제안한다.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.1-8
• /
• 2016

This paper proposes a novel broadcast scheduling algorithm for wireless large-scale networks based on theory of complex networks. In the proposed algorithm, the network topology is formed based on a scale-free network and the probability of link distribution is analyzed. In this paper, the characteristics of complex systems are analyzed (which are not concerned by the existing broadcast scheduling algorithm techniques) and the optimization of network transmission efficiency and network time delay are provided.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.267-270
• /
• 2008

H.264|AVC는 인트라 부호화 효율을 높이기 위해 공간 영역에서 주변 화소를 이용하여 다양한 방향에 대한 율-왜곡 최적화 기법을 사용하여 최적의 인트라 예측 모드를 선택한다. 하지만 율-왜곡 최적화 기법을 사용함에 따라 인트라 부호화에 높은 복잡도가 필요하게 되었다. 따라서 본 논문에서는 인트라 예측 모드 결정의 연산 복잡도를 감소시키고자 사전에 인트라 4x4 예측 모드들의 SATD(Sum of Absolute Transform Difference)를 계산하여 조기에 최우선 모드(Most Probable Mode)를 선택하는 방법을 제안하고, SATD의 값에 따라 제한된 후보 모드에 대해서만 율-왜곡 최적화를 수행하여 연산 복잡도를 감소하는 방법을 제안한다. 또한 Vertical, Horizontal 그리고 DC모드는 인트라 $4{\times}4$와 인트라 $16{\times}16$의 공통적인 모드이므로 인트라 $4{\times}4$에서 계산되어진 SATD값을 이용하여 인트라 $16{\times}16$에서의 SAD 계산 복잡도를 줄이는 방법을 제안한다. 본 논문에서 제안하는 빠른 인트라 예측 모드 결정 기법은 연산 복잡도는 평균 61.4% 감소 시킨 반면 부호화 손실은 평균 3.09%에 불과하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2020-2028
• /
• 2013

In this paper, we propose a novel analysis and design methodology based on complex network theory for wireless large-scale ad hoc networks. We also enhance the conventional analysis methods which does not sufficiently consider the effect of the wireless communication channels and extend the existing random graph theory by reflecting the wireless communication environments. As a main result, the effect of the network topology such as average degree of each communication node on the network capacity through extensive computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.632-638
• /
• 2010

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The Proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4\times4$ MU-MIMO system, the complexity of the proposed FSE is 16% that of the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the proposed endoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.240-252
• /
• 2017

Multi-view video codec based on the High Efficiency Video Coding (MV-HEVC) has high encoding complexity because it exploits an additional reference picture for disparity compensation prediction (DCP) when the picture of dependent view is encoded. In this paper, we propose an efficient method to reduce the complexity of disparity motion vector search for the MV-HEVC. The proposed method includes the initial search point decision method using affine transform and the adaptive search range decision method. The simulation results show that the proposed method reduces the complexity of disparity motion vector search up to 90.78% with negligible coding efficiency degradation. Also the results show that the proposed method outperforms other conventional techniques reducing complexity.