• 전기학회논문지
• /
• 제59권8호
• /
• pp.1489-1496
• /
• 2010

A feed forward differential architecture of analog PRML decoder is investigated to implement on analog parallel processing circuits. The conventional PRML decoder performs the trellis processing with the implementation of single stage in digital and its repeated use. The analog parallel processing-based PRML comes from the idea that the decoding of PRML is done mainly with the information of the first several number of stages. Shortening the trellis processing stages but implementing it with analog parallel circuits, several benefits including higher speed, no memory requirement and no A/D converter requirement are obtained. Most of the conventional analog parallel processing-based PRML decoders are differential architecture with the feedback of the previous decoded data. The architecture used in this paper is without feedback, where error metric accumulation is allowed to start from all the states of the decoding stage, which enables to be decoded without feedback. The circuit of the proposed architecture is simpler than that of the conventional analog parallel processing structure with the similar decoding performance. Characteristics of the feed forward differential architecture are investigated through various simulation studies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.257-271
• /
• 2016

The Structural SIMilarity (SSIM) index is one of the most widely-used methods for perceptual image quality assessment (IQA). It is based on the principle that the human visual system (HVS) is sensitive to the overall structure of an image. However, it has been reported that indices predicted by SSIM tend to be biased depending on the type of distortion, which increases the deviation from the main regression curve. Consequently, SSIM can result in serious performance degradation. In this study, we investigate the aforementioned phenomenon from a new perspective and review a constant that plays a big role within the SSIM metric but has been overlooked thus far. Through an experimental study on the influence of this constant in evaluating images with SSIM, we are able to propose a new solution that resolves this issue. In the proposed IQA method, we first design a system to classify different types of distortion, and then match an optimal constant to each type. In addition, we supplement the proposed method by adding color perception-based structural information. For a comprehensive assessment, we compare the proposed method with 15 existing IQA methods. The experimental results show that the proposed method is more consistent with the HVS than the other methods.

• 대한수학회지
• /
• 제48권2호
• /
• pp.397-420
• /
• 2011

In this paper we study the structure of closed weakly dense ideals in Privalov spaces $N^p$ (1 < p < $\infty$) of holomorphic functions on the disk $\mathbb{D}$ : |z| < 1. The space $N^p$ with the topology given by Stoll's metric [21] becomes an F-algebra. N. Mochizuki [16] proved that a closed ideal in $N^p$ is a principal ideal generated by an inner function. Consequently, a closed subspace E of $N^p$ is invariant under multiplication by z if and only if it has the form $IN^p$ for some inner function I. We prove that if $\cal{M}$ is a closed ideal in $N^p$ that is dense in the weak topology of $N^p$, then $\cal{M}$ is generated by a singular inner function. On the other hand, if $S_{\mu}$ is a singular inner function whose associated singular measure $\mu$ has the modulus of continuity $O(t^{(p-1)/p})$, then we prove that the ideal $S_{\mu}N^p$ is weakly dense in $N^p$. Consequently, for such singular inner function $S_{\mu}$, the quotient space $N^p/S_{\mu}N^p$ is an F-space with trivial dual, and hence $N^p$ does not have the separation property.

• 한국항행학회논문지
• /
• 제16권3호
• /
• pp.455-462
• /
• 2012

무선 모바일 프록시 캐싱 구조에서 캐싱 교체로 인한 손실은 스트리밍 QoS에 중요한 영향을 미친다. 본 논문에서는 캐싱 교체 과정에서 발생하는 손실을 최소화하기 위하여 유사도 기반의 캐싱 손실 최소화 기법 SCLM(Similarity-based Caching Loss Minimization)을 제안한다. 제안된 기법은 객체 세그먼트를 분할 한 후 유사도 관계를 수행한다. 유사도 관계가 수행된 세그먼트들은 SRT (Similarity Relation Tree)가 생성되고 유사도가 측정된다. 유사도는 적합성 피드백을 결정하는 중요한 척도로서 적합성을 만족한 세그먼트들은 캐싱 교체를 위해 캐시 블록에 저장한다. 시뮬레이션 결과 제안된 기법은 prefix 캐싱 기법, segment 캐싱 기법, 그리고 bps 캐싱 기법에 비해서 캐싱 시작 지연 제어율, 캐시 처리율, 그리고 캐시 응답율의 QoS가 효율적임을 보인다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.628-633
• /
• 1994

A new Riemannian geometric model for the controlled plant is proposed by imbedding the control vector space in the state space, so as to reduce the dimension of the model. This geometric model is derived by replacing the orthogonal straight coordinate axes on the state space of a linear system with the curvilinear coordinate axes. Therefore the integral manifold of the geometric model becomes homeomorphic to that of fictitious linear system. For the lower dimensional Riemannian geometric model, a nonlinear optimal regulator with a quadratic form performance index which contains the Riemannian metric tensor is designed. Since the integral manifold of the nonlinear regulator is determined to be homeomorphic to that of the linear regulator, it is expected that the basic properties of the linear regulator such as feedback structure, stability and robustness are to be reflected in those of the nonlinear regulator. To apply the above regulator theory to a real nonlinear plant, it is discussed how to distort the curvilinear coordinate axes on which a nonlinear plant behaves as a linear system. Consequently, a partial differential equation with respect to the homeomorphism is derived. Finally, the computational algorithm for the nonlinear optimal regulator is discussed and a numerical example is shown.

• 한국군사과학기술학회지
• /
• 제3권1호
• /
• pp.116-126
• /
• 2000

Turbo codes are the most exciting and potentially important development in coding theory in recent years. They were introduced in 1993 by Berrou, Glavieux and $Thitimajshima,({(1)}$ and claimed to achieve near Shannon-limit error correction performance with relatively simple component codes and large interleavers. A required Eb/N0 of 0.7㏈ was reported for BER of $10^{-5}$ and code rate of $l/2.^{(1)}$ However, to implement the turbo code system, there are various important details that are necessary to reproduce these results such as AGC gain control, optimal wordlength determination, and metric rescaling. Further, the memory required to implement MAP-based turbo decoder is relatively considerable. In this paper, we confirmed the accuracy of these claims by computer simulation considering these points, and presented a optimal wordlength for Turbo code design. First, based on the analysis and simulation of the turbo decoder, we determined an optimal wordlength of Turbo decoder. Second, we suggested the MAP decoding algorithm based on sliding-window method which reduces the system memory significantly. By computer simulation, we could demonstrate that the suggested fixed-point Turbo decoder operates well with negligible performance loss.

• 대한수학회보
• /
• 제29권2호
• /
• pp.237-243
• /
• 1992

Let (M, g, J) be a closed Kahler manifold of complex dimension m > 1. We denote by Spec(M,g) the spectrum of the real Laplace-Beltrami operator. DELTA. acting on functions on M. The following characterization problem on the spectral rigidity of the complex projective space (CP$^{m}$ , g$_{0}$ , J$_{0}$ ) with the standard complex structure J$_{0}$ and the Fubini-Study metric g$_{0}$ has been attacked by many mathematicians : if (M,g,J) and (CP$^{m}$ ,g$_{0}$ ,J$_{0}$ ) are isospectral then is it true that (M,g,J) is holomorphically isometric to (CP$^{m}$ ,g$_{0}$ ,J$_{0}$ )\ulcorner In [BGM], [LB], it is proved that if (M,J) is (CP$^{m}$ , J$_{0}$ ) then the answer to the problem is affirmative. Tanno ([Ta]) has proved that the answer is affirmative if m .leq. 6. Recently, Wu([Wu]) has showed in a more general sense that if (M, g) and (CP$^{m}$ ,g$_{0}$ ) are (-4/m)-isospectral, m .geq. 4, and if the second betti number b$_{2}$(M) is equal to b$_{2}$(CP$^{m}$ ).

• 대한기계학회논문집B
• /
• 제20권4호
• /
• pp.1510-1520
• /
• 1996

An experimental study on the flow over the axisymmetric backward-facing step was carried out. The purpose of the present study is to investigate the effect of the separating streamline curvature on the reattachment length and to understand the structure of recirculating flows. Local mean and fluctuating velocity components were measured in the separating and reattaching axisymmetric region of turbulent boundary layer on the wall of convex cylinder placed in a water tunnel by using 2-color 4-beam fiber optics laser Doppler velocimetry. The study demonstrates that the reattachment length increases with increasing separating streamline curvature. It is also observed that the reverse flow velocity and turbulent kinetic energy increase with an increase in the separating streamline curvature. In addition, the behavior of maximum turbulent stresses show that the effect of separating streamline curvature is larger in the region of recirculating zone(X/H<2) than in the region of reattachment point.

• Journal of information and communication convergence engineering
• /
• 제14권4호
• /
• pp.240-245
• /
• 2016

Scalable video streaming over wireless networks has many challenges. The most significant challenge is related to packet loss. To overcome this problem, in this paper, we propose an unequal loss protection (ULP) method using a new forward error correction (FEC) mechanism for robust scalable video streaming over wireless networks. For an efficient FEC assignment considering video quality, we first introduce a simple and efficient performance metric, the layer-based recovery rate (LRR), for quantifying the unequal error propagation effects of the temporal and quality layers on the basis of packet losses. LRR is based on the unequal importance in both the temporal and the quality layers of a hierarchical scalable video coding structure. Then, the proposed ULP-LRR method assigns an appropriate number of FEC packets on the basis of the LRR to protect the video layers against packet lossy network environments. Compared with conventional ULP algorithms, the proposed ULP-LRR algorithm demonstrates a higher performance for various error-prone wireless channel statuses.

• 로봇학회논문지
• /
• 제9권2호
• /
• pp.104-110
• /
• 2014

Mapping is a fundamental element for robotic services. There are available many types of map data representation such as grid map, metric map, topology map, etc. As more robots are deployed for services, more chances of exchanging map data among the robots emerge and standardization of map data representation (MDR) becomes more valuable. Currently, activities in developing MDR standard are underway in IEEE Robotics and Automation Society. The MDR standard is for a common representation and encoding of the two-dimensional map data used for navigation by mobile robots. The standard focuses on interchange of map data among components and systems, particularly those that may be supplied by different vendors. This paper aims to introduce MDR standard and its application to map merging. We have applied the basic structure of the MDR standard to a grid map and Voronoi graph as a kind of topology map and performed map merging between two different maps. Simulation results show that the proposed MDR is suitable for map data exchange among robots.