• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5305-5321
• /
• 2016

In wireless communication, the multiple-input multiple-output (MIMO) system is a well-known approach to improve the reliability as well as the data rate. In MIMO systems, channel state information (CSI) is typically required at the receiver to detect transmitted signals; however, in practical systems, the CSI is imperfect and contains errors, which affect the overall system performance. In this paper, we propose a novel maximum likelihood (ML) scheme for MIMO systems that is robust to the CSI errors. We apply an optimization method to estimate an instantaneous covariance matrix of the CSI errors in order to improve the detection performance. Furthermore, we propose the employment of the list sphere decoding (LSD) scheme to reduce the computational complexity, which is capable of efficiently finding a reduced set of the candidate symbol vectors for the computation of the covariance matrix of the CSI errors. An iterative detection scheme is also proposed to further improve the detection performance.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1145-1157
• /
• 2020

A convolution neural networks (CNNs) has demonstrated outstanding performance compared to other algorithms in the field of face recognition. Regarding the over-fitting problem of CNN, researchers have proposed a residual network to ease the training for recognition accuracy improvement. In this study, a novel face recognition model based on game theory for call-over in the classroom was proposed. In the proposed scheme, an image with multiple faces was used as input, and the residual network identified each face with a confidence score to form a list of student identities. Face tracking of the same identity or low confidence were determined to be the optimisation objective, with the game participants set formed from the student identity list. Game theory optimises the authentication strategy according to the confidence value and identity set to improve recognition accuracy. We observed that there exists an optimal mapping relation between face and identity to avoid multiple faces associated with one identity in the proposed scheme and that the proposed game-based scheme can reduce the error rate, as compared to the existing schemes with deeper neural network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.2223-2242
• /
• 2019

Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제35권6호
• /
• pp.386-391
• /
• 2008

휴대폰과 메신저 등 통신 환경에서 문자 메시지를 전송할 때 표준어가 아닌 왜곡된 어휘들을 사용하고 있으며, 이러한 변형된 어휘들은 음성 인식, 음성 합성, 문서 정보 추출 등 언어처리 및 관련 분야의 응용 시스템에서 많은 문제점을 유발시킨다. 본 논문에서는SMS 문장들의 변형 및 띄어쓰기 오류를 자동으로 교정하여 형태소 분석 및 품사 태깅의 성능 저하 문제를 방지하는 문자열 오류의 교정 방법을 제안하고 시스템을 구현하였다. 시스템의 성능에 가장 큰 영향을 미치는 변형된 문자열 사전을 구축하는 방법으로 (1) 통신 어휘집을 기반으로 수동으로 구축하는 방법, (2) 수작업으로 구축된 말뭉치로부터 자동으로 변형된 문자열을 추출하는 방법, (3) 자동으로 변형된 문자열을 추출할 때 좌우 문맥을 고려하는 방법에 대하여 시스템을 구현하고 실험을 통하여 비교-분석 및 성능 평가 결과를 제시하였다.

• 한국멀티미디어학회논문지
• /
• 제25권3호
• /
• pp.493-501
• /
• 2022

This paper is a study on context-sensitive spelling error correction and uses the Korean WordNet (KorLex)[1] that defines the relationship between words as a graph to improve the performance of the correction[2] based on the vector information of the word embedded in the correction technique. The Korean WordNet replaced WordNet[3] developed at Princeton University in the United States and was additionally constructed for Korean. In order to learn a semantic network in graph form or to use it for learned vector information, it is necessary to transform it into a vector form by embedding learning. For transformation, we list the nodes (limited number) in a line format like a sentence in a graph in the form of a network before the training input. One of the learning techniques that use this strategy is Deepwalk[4]. DeepWalk is used to learn graphs between words in the Korean WordNet. The graph embedding information is used in concatenation with the word vector information of the learned language model for correction, and the final correction word is determined by the cosine distance value between the vectors. In this paper, In order to test whether the information of graph embedding affects the improvement of the performance of context- sensitive spelling error correction, a confused word pair was constructed and tested from the perspective of Word Sense Disambiguation(WSD). In the experimental results, the average correction performance of all confused word pairs was improved by 2.24% compared to the baseline correction performance.

• ETRI Journal
• /
• 제46권3호
• /
• pp.485-500
• /
• 2024

A hardware architecture is presented to decode (N, K) polar codes based on a low-density parity-check code-like decoding method. By applying suitable pruning techniques to the dense graph of the polar code, the decoder architectures are optimized using fewer check nodes (CN) and variable nodes (VN). Pipelining is introduced in the CN and VN architectures, reducing the critical path delay. Latency is reduced further by a fully parallelized, single-stage architecture compared with the log N stages in the conventional belief propagation (BP) decoder. The designed decoder for short-to-intermediate code lengths was implemented using the Virtex-7 field-programmable gate array (FPGA). It achieved a throughput of 2.44 Gbps, which is four times and 1.4 times higher than those of the fast-simplified successive cancellation and combinational decoders, respectively. The proposed decoder for the (1024, 512) polar code yielded a negligible bit error rate of 10^-4 at 2.7 E_b/N_o (dB). It converged faster than the BP decoding scheme on a dense parity-check matrix. Moreover, the proposed decoder is also implemented using the Xilinx ultra-scale FPGA and verified with the fifth generation new radio physical downlink control channel specification. The superior error-correcting performance and better hardware efficiency makes our decoder a suitable alternative to the successive cancellation list decoders used in 5G wireless communication.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 춘계종합학술대회 A
• /
• pp.567-571
• /
• 2008

In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.475-479
• /
• 2010

The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

• 한국정보관리학회:학술대회논문집
• /
• 한국정보관리학회 2012년도 제19회 학술대회 논문집
• /
• pp.129-132
• /
• 2012

이 연구의 목적은 SCI 논문들이 한국 의학 학술지 논문을 인용할 때, 잘못 표기한 학술지 명칭의 유형별 오류를 파악하는 것이다. Koreamed에 등재된 국내 의학 학술지 187종 중 SCI의 Cited Work List에 나타난 학술지명 표기가 13종이 넘는 학술지를 선택했고, 그 중 SCI에서 인용이 많이 된 학술지 7종의 2001-2011년을 대상으로 하였다. 총 463회의 학술지명 표기 오류가 있었는데, 8가지 유형별로 보면, 관사(the)오류 170회, 약어명 오류 104회, 학술지명 변경 오류 104회, 학술지명 부분누락 또는 삽입오류 43회, 스펠링 오류 27회, 전치사 오류 10회, 타 학술지명 기재 오류 3회, 대소문자 오류 2회로 나타났다.

• 한국마린엔지니어링학회:학술대회논문집
• /
• 한국마린엔지니어링학회 2005년도 후기학술대회논문집
• /
• pp.176-177
• /
• 2005

KOWACO - ChangWon Branch - have conducted the new study which aimed to improve flocculation performance in Mixers. The Purposes in this study were increasing flocculation efficiency by finding significant factor which was affected flow characteristics. In the result of this research we modified the error in equation of G-value and RPM which have been used till quite recently. Also we developed program auto-calculating G-value and RPM and then we had made their statistical list. We had conducted experiment with flocculation Mixer's model sized 1/10 by PIV's method. We analysed characteristic of all flow fields by changing case such as changing direction of flocculator roatation etc.