• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3C
• /
• pp.287-294
• /
• 2010

MB-OFDM UWB system will adopt LDPC codes to enhance the decoding performance with higher data rates. In this paper, we will consider algorithm and architecture of the LDPC codes in MB-OFDM UWB system. To suggest the hardware efficient LDPC decoder architecture, LLR(log-likelihood-ration) calculation algorithms and check node update algorithms are analyzed. And we proposed the architecture of LDPC decoder for the high throughput application of Wimedia UWB. We estimated the feasibility of the proposed architecture by implementation in a FPGA. The implementation results show our architecture attains higher throughput than other result of QC-LDPC case. Using this architecture, we can implement LDPC decoder for high throughput transmission, but it is 0.2dB inferior to the BP algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.241-244
• /
• 2023

본 연구는 2010년 이후로 다시 활성화가 된 NFC 기술을 이용하여 출석 체크 APP을 개발하고, 아두이노와 MySQL을 통해 데이터베이스를 생성, Node.js를 이용하여 서버를 구축함으로써 출석 체크 과정에서 발생하는 불필요한 시간 사용을 최소화하고 근거리 통신을 통해 확실한 출석 체크를 실현하기 위한 연구이다. 출석 체크시스템에서의 효율성과 정확성은 중요한 요소로서, 이를 위해 NFC 기술을 활용하여 신속하고 정확한 출석 체크를 수행하며, 데이터의 신뢰성과 보안성을 강화한다. 연구를 통해 출석 체크 시스템이 발생하는 인력과 시간의 절약 효과를 확인하고, 효율적인 출석 체크 관리를 위한 혁신적인 해결책을 제시한다. 이러한 연구는 출석 체크 시스템의 개선과 혁신을 이끌며, 다양한 조직이나 교육기관에서 확장될 수 있을 것으로 기대한다.

• Korean Journal of Agricultural Science
• /
• v.20 no.2
• /
• pp.125-132
• /
• 1993

This study was carried out to understand the relationship between sources and sinks in tillering maize hybrid. A non-tillering hybrid was included as check hybrid, The following treatments were imposed on the two hybrids at tasseling stages: 1) no leaves removed, 2) all leaves removed, 3) leaves above 1st ear node removed, 4) leaves below 1st ear node removed and 5) only 1st ear removed. The experiment was arranged in a split plot with hybrids as main plots and treatments as sub plots. Results obtained were summarized as follows: Plant heights in control were significantly higher in both hybrids than other treatments, No significant differences of plant height were observed among treatments of leaf removal in both hybrids. No significant differences of kernel weights of plant were found between locations of leaf removal, But seed weight of tillering hybrids was about 10 to 15% heavier than that of non-tillering hybrid. Stem weight showed the same tendency as the kernel weights. Leaf removal above the ear node lowered kernel weight significantly up to 60% compared with no leaf removal. The leaf removal below the ear node lowered the kernel weight about 40%. The effects of leaf removal on kernel weight was more serious in the non-tillering hybrid than in the tillering hybrid. Contribution of each part to the total dry matter varied with position of leaf removal. When no leaves were removed, contribution of each part to the total dry matter was great in the order of kernel weight, leaf weight and culm weight. When leaves above the ear node were removed, the contribution of each part to the total dry matter was in the order of culm weight, leaf weight and kernel weight. When leaves below the ear node were removed, the contribution of kernel weight was greater than the contribution of leaf and culm weights.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.65-72
• /
• 2009

Due to the popularity of mobile devices and advances in wireless communication technologies, a mobile ad hoc network has received a lot of attention. In the existing data replication management research, the use of a replica has been shown to be an efficient technique for improving data accessibility. However, to use a replica in ad hoc networks, the data consistency between the original data and the replica should be guaranteed. In the traditional research, a mobile node should check an original data whether the data is updated or not. However, It may be costly or sometimes impossible to check the original data. In the case of the time constraint applications, the checking cost can cause more serious problem. In this paper, we propose the time-guarantee based cache invalidation schemes for time constraint applications and the threshold based compensation method to enhance the time-guarantee based scheme. The proposed schemes can remove the "rollback" problem. Simulation results show that our schemes outperform the previous ones in terms of access time with little loss of data currency.

• Journal of Gastric Cancer
• /
• v.7 no.3
• /
• pp.124-131
• /
• 2007

Purpose: This study was conducted to identify prognostic factors in gastric cancer without lymph node metastasis and to specifiy which prognostic factors can be available in detail according to the depth of invasion. Materials and Methods: This retrospective study was based on the medial records of 268 gastric cancer patients who received resectional therapy from 1990 to 1999. The patients who revealed pT2NOMO, pT3NOMO, pT4NOMO on postoperative pathologic reports were enrolled. The survival rate was analyzed according to clinicopathologic and therapeutic factors. Results: According to the depth of invasion, the number of patients with pT2a, pT2b, pT3 and pT4 were 86 (32.1%), 56 (20.9%), 108 (40.3%), and 18 (6.7%) respectively. Age, depth of invasion, histological type, Borrmann type, and Lauren classification were statistically significant in the univariate analysis, and the age, the depth of invasion, and Lauren classification were independent prognostic factors identified by multivariate analysis. On multivariate analysis of subgroups according to the depth of invasion, the independent prognostic factors were age, Borrmann type, and Lauren classification in pT2, and age, Lauren classification, and vascular invasion in pT3. The prognostic factors of pT4 patients could not be analyzed due to limited sample size. Conclusion: In advanced gastric cancer patients without lymph node metastasis, age, the depth of invasion, and Lauren classification should be checked to predict prognosis. In patients with pT2 lesion among the above patients, the Borrmann type should be added in check-list.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.11
• /
• pp.18-26
• /
• 2011

This paper describes a multi-mode LDPC decoder which supports three block lengths(648, 1296, 1944) and four code rates(1/2, 2/3, 3/4, 5/6) of IEEE 802.11n wireless LAN standard. To minimize hardware complexity, it adopts a block-serial (partially parallel) architecture based on the layered decoding scheme. A novel memory reduction technique devised using the min-sum decoding algorithm reduces the size of check-node memory by 47% as compared to conventional method. From fixed-point modeling and Matlab simulations for various bit-widths, decoding performance and optimal hardware parameters such as fixed-point bit-width are analyzed. The designed LDPC decoder is verified by FPGA implementation, and synthesized with a 0.18-${\mu}m$ CMOS cell library. It has 219,100 gates and 45,036 bits RAM, and the estimated throughput is about 164~212 Mbps at 50 MHz@2.5v.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.723-729
• /
• 2014

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.95-101
• /
• 2016

With the rapid development of Internet and communication network technology, various studies had proceeded to develop the technology of wireless sensor networks. Authentication schemes for user and sensor are critical and important security issue to use wireless sensors legally. First, Das introduce a user authentication scheme using smart card and password for wireless sensor networks, various studies had proceeded. Chem et al. suggested a secure user authentication scheme against smart card loss attack but Chen et al. scheme does not still resolve some security vulnerability such as perfect forward secrecy, session key exposure by gateway node, anonymity, and the password check. To resolve the problems, this paper proposes a security enhanced user authentication using the fuzzy extraction, elliptic curves cryptography and dynamic ID and analyzes the security.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.22-30
• /
• 2006

In this paper, the goal of our proposed algorithm is to reduce link -failure and route failure caused by dead nodes which consume all of the battery life. I propose an algorithm which provides a ability of changing mutes to neighbor nodes before some of intermediate nodes be shutting don to get the stable route maintenance. To achieve this goal, The proposed routing algerian uses additional new messages to check energy status for monitoring energy of neighbor nodes and to change the path to a neighbor node. From extensive simulations, results show that possibility of cut-offs and time-delay cause of packet-loss have been decreased and also the improvement of transmission effectiveness.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1150-1156
• /
• 2009

The spread of wireless Internet technology development and applications with location information in the form of location-based services are more varied. In particular, where you recognize the location of objects such as people and things, and to provide valuable services based on ubiquitous, location-based services (Ubiquitous Location Based Services: u-LBS) is emerging as an important service. In this paper precise location data to the car crash through the location and offers related service system. In this paper the precise location tracking proposed by the concept of the Rail, road, to extract the location Data Matching Data and the current location is obtained. System used in GPS Packet and information about the location of the vehicle collision and the collision time, the vehicle consists of NodeID is about. Using these data, a packet is to be created when the conflict between vehicles in the vehicle will be sent to Gateway. Gateway to the packets that were sent from the Server to determine whether the conflict is that in an emergency situation, Emergency Center for location information and let me know whether or not the conflict will be measured. Also, for those on the outside of an emergency such as a family related to the wireless terminal wireless (PDA, cell phone) is to let me know. Server get into the conflict that was configured to store information on the Database. Additionally, the proposed u-LBS system to verify the validity of the experiment was performed.