• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.11
• /
• pp.650-656
• /
• 2003

A high speed Viterbi decoder with a circularly connected 2-dimensional analog processing ceil array Is proposed. The proposed Viterbi .decoder has a 2-dimensional parallel processing structure in which an analog processing cell is placed at each node of a trellis diagram, the output column of the analog processing cells is connected to the decoding column, and thus, the output(last) column becomes a column right before the decoding(first) column. The reference input signal given at a decoding column is propagated to the whole network while Its magnitude is reduced by the amount of a error metric on each branch. The circuit-based decoding is done by adding a trigger signals of same magnitudes to disconnect the path corresponding to logic 0 (or 1) and by observing its effect at an output column (the former column of the decoding column). The proposed Viterbi decoder has advantages in that it is operated with better performance of error correction, has a shorter latency and requires no path memories. The performance of error correction with the proposed Viterbi decoder is tested via the software simulation.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.480-490
• /
• 2015

The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum-Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum-based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake-up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.463-465
• /
• 2005

본 논문에서는 802.l1e MAC의 EDCA 모드를 기반으로 한 무선랜 환경에서 realtime data인 voice traffic의 QoS를 향상하기 위한 방안을 연구하였다. 동적으로 채널의 상태를 보고, 네트워크 상태를 예측하여 채널 경쟁에 참여할지를 결정하는 방안으로, 경쟁이 치열할 때 voice traffic에 차별화된 가중치를 더 줄 수 있어 전반적인 voice traffic의 성능 향상에 기여한다. 본 연구에서 SU(slot utilization)을 계산하여 PT(Probability of Transmission)을 구할 때, 기존의 DCC 알고리즘을 그대로 802.11e에 적용하게 되면 4개의 AC에 똑같은 알고리즘이 적용되어 802.11e의 핵심인 차별화된 QoS를 지원하는데 무리가 있다. 기존 DCC 알고리즘에서 재시도 회수만 고려해 구하는 것을 802.11e 구조에 맞추어 4개의 AC별로 차별화하여 전송확률(PT)를 구할 수 있게 하였다. 뿐만 아니라, 재시도 회수를 고려하여 재시도 회수가 않은 packet에는 PT값이 높게 나을 수 있게 하고, 최대 가능한 재시도 회수에 도달할 때에는 상위 AC 영역의 값이 나오게 하여 AC의 upgrade가 되는 효과를 가져오게 하였다. 이 때 각 AC의 lower bound와 upper bound를 정하고, 이 때 802.11e의 최대 재시도 회수 parameter와의 상관관계를 정의하여 하위 AC가 상위 AC의 영역을 침범하지 못하도록 정의하고 있다. 추가적으로 SU의 값을 구할 때에도 현재의 SU값 대신 누적된 평균 SU값을 사용해 PT값을 구하여, utilization, latency, Packet loss등 전반적인 부분의 성능개선을 확인할 수 있다.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.483-494
• /
• 2015

High Efficiency Video Coding (HEVC) is the most recent video codec standard of the ITU-T Video Coding Experts Group and the ISO/IEC Moving Picture Experts Group. The main goal of this newly introduced standard is for catering to high-resolution video in low bandwidth environments with a higher compression ratio. This paper provides a performance comparison between HEVC and H.264/AVC video compression standards in terms of objective quality, delay, and complexity in the broadcasting environment. The experimental investigation was carried out using six test sequences in the random access configuration of the HEVC test model (HM), the HEVC reference software. This was also carried out in similar configuration settings of the Joint Scalable Video Module (JSVM), the official scalable H.264/AVC reference implementation, running on a single layer mode. According to the results obtained, the HM achieves more than double the compression ratio compared to that of JSVM and delivers the same video quality at half the bitrate. Yet, the HM encodes two times slower (at most) than JSVM. Hence, it can be concluded that the application scenarios of HM and JSVM should be judiciously selected considering the availability of system resources. For instance, HM is not suitable for low delay applications, but it can be used effectively in low bandwidth environments.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.339-347
• /
• 2010

Inter-process communication (IPC), which is a technique that enables exchanging data among multiple processes, is commonly used not only in user applications but also in system processes. For this reason, the performance of IPC highly influences the performance of whole computer system. Especially, heavy overload on a single server process caused by IPC requests from multiple client processes, easily results overall slowdown of IPC response time. Here, to deal with the problem stated above, the time-slice donation technique which is adapted in L4 microkernel is analyzed and enhanced for reducing latency of IPC response time and implemented on linux kernel for actual performance evaluation. While trying to maintain the additional overhead as least as possible, the experiment shows that the use of this technique enhances the performance of IPC multiple times of existing technique under certain circumstances.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.7-14
• /
• 2014

The rapid increase of mobile devices such as smart phone and smart pad have raised the needs for seamless multimedia services during moving at anytime and anywhere. Current 4G mobile devices are equipped with both 4G (LTE) and WLAN (WiFi) interfaces, and mobile services operators provide wireless Internet services using 4G network with a wider coverage and WiFi zone. Generally users prefer to use the Internet services through WLAN rather than LTE in the coverage of WLAN. However, since WLAN has a long L2 handover latency, it is difficult to support seamless services during a handover. In this paper, we proposed an efficient handover scheme based on flow mobility for WLANs to support a seamless service during handovers by using the overlaid 4G network with a wider coverage. Also, we showed the outperformance of the proposed scheme on a testbed.

• Food Science of Animal Resources
• /
• v.40 no.2
• /
• pp.183-196
• /
• 2020

The protective effect of pig skin gelatin water extracts (PSW) and the low molecular weight hydrolysates of PSW generated via enzymatic hydrolysis with Flavourzyme® 1000L (LPSW) against scopolamine-induced impairment of cognitive function in mice was determined. Seventy male ICR mice weighing 20-25 g were randomly assigned to seven groups: Control (CON); scopolamine (SCO, 1 mg/kg B.W., intraperitoneally (i.p.); tetrahydroaminoacridine 10 [THA 10, tacrine; 10 mg/kg B.W. per oral (p.o.) with SCO (i.p.)]; PSW 10 (10 mg/kg B.W. (p.o.) with SCO (i.p.); PSW 40 (40 mg/kg B.W. (p.o.) with SCO (i.p.); LPSW 100 (100 mg/kg B.W. (p.o.) with SCO (i.p.); LPSW 400 (400 mg/kg B.W. (p.o.) with SCO (i.p.). All treatment groups, except CON, received scopolamine on the day of the experiment. The oxygen radical absorbance capacity of LPSW 400 at 1 mg/mL was 154.14 μM Trolox equivalent. Administration of PSW and LPSW for 15 weeks did not significantly affect on physical performance of mice. LPSW 400 significantly increased spontaneous alternation, reaching the level observed for THA and CON. The latency time of animals receiving LPSW 400 was higher than that of mice treated with SCO alone in the passive avoidance test, whereas it was shorter in the water maze test. LPSW 400 increased acetylcholine (ACh) content and decreased ACh esterase activity (p<0.05). LPSW 100 and LPSW 400 reduced monoamine oxidase-B activity. These results indicated that LPSW at 400 mg/kg B.W. is a potentially strong antioxidant and contains novel components for the functional food industry.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.67-73
• /
• 2009

This paper proposes a new fast vertical handover mechanism to optimize and enhance the existing fast vertical handover HMIPv6(FV-HMIP) mechanism in heterogeneous wireless access networks. The proposed mechanism ad opts the IEEE 802.21 Media Independent Handover Function(MIHF), and thus is called the "MFV-HMIP". The Media Independent Handover Service (MIIS) in the IEEE 802.21 MIHF is extended by including new L3 inform ation to provide domain prefixes of heterogeneous neighbouring mobility anchor points(MAPs). This can eliminate the heterogeneous neighbouring MAP discovery phase in the existing FV-HMIP. Thus, the proposed MFV-HMIP can reduce the signalling traffic over wireless link and increase the possibility of predictive mode operation. Therefore, the proposed MFV-HMIP mechanism can be superior to the existing FV-HMIP mechanism for wireless resource efficiency, handover latency, and packet loss. Through analytic performance evaluations and computer si mulations, the proposed mechanism can be shown to optimize and enhance the existing mechanism.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.41 no.2
• /
• pp.117-124
• /
• 2017

The performance of the colored Gauss-Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss-Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss-Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.