• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.95-102
• /
• 2005

This paper is purpose for improvement performance wireless lan of IEEE802.11a/b/g. Access point utilized a single server, multi-queuing system, FIFS system model to adapted priority multi-bufferto be alteration packet type. The main purpose of the paper improve the transmission rate and the performance of access point to settle transmission delay for load in MAC, has priority multi-buffer. We use experimentation to obtain our model of the access point and buffer-related parameters. Using our test design, we are able to extract the parameters of an analytic equation giving the average service time of a packet as a function of packer IP payload.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.04a
• /
• pp.1-3
• /
• 1983

The General Assembly of the UN has proclaimed the year 1983 world Communications Year, Development of Communications Infrastructures, with the International Telecommunication Union serving as the lead agency for the year. Therefore, Author investigate the purpose and background of WCY83 and its programs by ITU. As the result, those international plans to implement effectively WCY83 are highly reputed to be reasonable. On this Occassion, I review the current problems refferring to communications policies in Korea and suggest some proposals from the view point of its legislations in order to stimulate the development of communications Science.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.2
• /
• pp.15-23
• /
• 2009

This paper presents a novel high-speed, low-complexity flexible 128/64-point $radix-2^4$ FFT/IFFT processor for the applications in high-throughput MIMO-OFDM systems. The high radix multi-path delay feed-back (MDF) FFT architecture provides a higher throughput rate and low hardware complexity by using a four-parallel data-path scheme. The proposed processor not only supports the operation of FFT/IFFT in 128-point and 64-point but can also provide a high data processing rate by using a four-parallel data-path scheme. Furthermore, the proposed design has a less hardware complexity compared with traditional 128/64-point FFT/IFFT processors. Our proposed processor has a high throughput rate of up to 560Msample/s at 140MHz while requiring much smaller hardware expenditure satisfying IEEE 802.11n standard requirements.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.70-77
• /
• 2017

Among available people counting methods, map-based approaches based on moving interest points have shown good performance. However, the stationary people counting is challenging in such methods since all static points of interest are considered as background. To include stationary people in counting, it is needed to discriminate between the static points of stationary people and the background region. In this paper, we propose a people counting method based on using both moving and static points. The proposed method separates the moving and static points by motion information. Then, the static points of the stationary people are classified using foreground mask processing and point pattern analysis. The experimental results reveal that the proposed method provides more accurate count estimation by including stationary people. Also, the background updating is enabled to solve the static point misclassification problem due to background changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2365-2371
• /
• 1998

Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.685-693
• /
• 2011

General framework for proximal point algorithms based on the notion of (A, ${\eta}$)-maximal monotonicity (also referred to as (A, ${\eta}$)-monotonicity in literature) is developed. Linear convergence analysis for this class of algorithms to the context of solving a general class of nonlinear variational inclusion problems is successfully achieved along with some results on the generalized resolvent corresponding to (A, ${\eta}$)-monotonicity. The obtained results generalize and unify a wide range of investigations readily available in literature.

• Communications of the Korean Mathematical Society
• /
• v.16 no.3
• /
• pp.415-425
• /
• 2001

We consider the problem of determining conductivity of the medium from the measurements of the electric potential on the boundary and the corresponding current flux across the boundary. We give a formula for reconstructing the conductivity and its normal derivative at the point of the boundary simultaneously from the localized Diichlet to Neumann map around that point.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.171-177
• /
• 2018

In this research paper considering a differential equation with impulsive effect and dependent delay and applied Banach fixed point theorem using the impulsive condition to the impulsive fractional functional differential equation of an order ${\alpha}{\in}(1,2)$ to get an uniqueness solution. At last, theorem is verified by using a numerical example to illustrate the uniqueness solution.

• Communications of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.415-421
• /
• 2022

This paper presents a fundamental theorem of calculus, an integration by parts formula and a version of equiintegrability convergence theorem for the M_α-integral using the M_α-strong Lusin condition. In the convergence theorem, to be able to relax the condition of being point-wise convergent everywhere to point-wise convergent almost everywhere, the uniform M_α-strong Lusin condition was imposed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.1
• /
• pp.17-31
• /
• 2002

Using some techniques developed by Dragomir and Wang in the recent paper [2] in connection to Ostrowski integral inequality, we point out some approximation results for the Henkel's transform of absolutely continuous mapping.