• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.270-279
• /
• 2014

The Viterbi decoding algorithm, which provides maximum - likelihood decoding, is currently considered the most widely used technique for the decoding of codes having a state description, including the class of linear error-correcting convolutional codes. Two classes of nonbinary convolutional codes are presented. Distance preserving mapping convolutional codes and M-ary convolutional codes are designed, respectively, from the distance-preserving mappings technique and the implementation of the conventional convolutional codes in Galois fields of order higher than two. We also investigated the performance of these codes when combined with a multiple frequency-shift keying (M-FSK) modulation scheme to correct narrowband interference (NBI) in power-line communications channel. Themodification of certain detectors of the M-FSK demodulator to refine the selection and the detection at the decoder is also presented. M-FSK detectors used in our simulations are discussed, and their chosen values are justified. Interesting and promising obtained results have shown a very strong link between the designed codes and the selected detector for M-FSK modulation. An important improvement in gain for certain values of the modified detectors was also observed. The paper also shows that the newly designed codes outperform the conventional convolutional codes in a NBI environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5189-5208
• /
• 2015

To address the contradiction between data aggregation and data security in wireless sensor networks, a Recoverable Privacy-preserving Integrity-assured Data Aggregation (RPIDA) scheme is proposed based on privacy homomorphism and aggregate message authentication code. The proposed scheme provides both end-to-end privacy and data integrity for data aggregation in WSNs. In our scheme, the base station can recover each sensing data collected by all sensors even if these data have been aggregated by aggregators, thus can verify the integrity of all sensing data. Besides, with these individual sensing data, base station is able to perform any further operations on them, which means RPIDA is not limited in types of aggregation functions. The security analysis indicates that our proposal is resilient against typical security attacks; besides, it can detect and locate the malicious nodes in a certain range. The performance analysis shows that the proposed scheme has remarkable advantage over other asymmetric schemes in terms of computation and communication overhead. In order to evaluate the performance and the feasibility of our proposal, the prototype implementation is presented based on the TinyOS platform. The experiment results demonstrate that RPIDA is feasible and efficient for resource-constrained sensor nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3375-3400
• /
• 2018

With the advent of database-as-a-service (DAAS) and cloud computing, more and more data owners are motivated to outsource their data to cloud database in consideration of convenience and cost. However, it has become a challenging work to provide security to database as service model in cloud computing, because adversaries may try to gain access to sensitive data, and curious or malicious administrators may capture and leak data. In order to realize privacy preservation, sensitive data should be encrypted before outsourcing. In this paper, we present a secure and practical system over encrypted cloud data, called QSDB (queryable and secure database), which simultaneously supports SQL query operations. The proposed system can store and process the floating point numbers without compromising the security of data. To balance tradeoff between data privacy protection and query processing efficiency, QSDB utilizes three different encryption models to encrypt data. Our strategy is to process as much queries as possible at the cloud server. Encryption of queries and decryption of encrypted queries results are performed at client. Experiments on the real-world data sets were conducted to demonstrate the efficiency and practicality of the proposed system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4226-4241
• /
• 2014

Cloud storage provides an easy, cost-effective and reliable way of data management for users without the burden of local data storage and maintenance. Whereas, this new paradigm poses many challenges on integrity and privacy of users' data, since users losing grip on their data after outsourcing the data to the cloud server. In order to address these problems, recently, Worku et al. have proposed an efficient privacy-preserving public auditing scheme for cloud storage. However, in this paper, we point out the security flaw existing in the scheme. An adversary, who is on-line and active, is capable of modifying the outsourced data arbitrarily and avoiding the detection by exploiting the security flaw. To fix this security flaw, we further propose a secure and efficient privacy-preserving public auditing scheme, which makes up the security flaw of Worku et al.'s scheme while retaining all the features. Finally, we give a formal security proof and the performance analysis, they show the proposed scheme has much more advantages over the Worku et al.'s scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.4
• /
• pp.75-80
• /
• 2001

In this paper, we propose a new chaotic synchronization algorithm of using HVPM(Hyperchaotic Volume Preserving Maps) model. The proposed chaotic equation, that is, HVPM model which consists of three dimensional discrete-time simultaneous difference equations and shows uniquely random chaotic attractor using nonlinear maps and modulus function. Pecora and Carrol have recently shown that it is possible to synchronize a chaotic system by sending a signal from the drive chaotic system to the response subsystem. We proposed coupled synchronization algorithm in order to accomplish discrete time hyperchaotic HVPM signals. In the numerical results, two hyperchaotic signals are coupled and driven for accomplishing to the chaotic synchronization systems. And it is demonstrated that HVPM signals have shown the chaotic behavior and chaotic coupled synchronization.

• Journal of Power Electronics
• /
• v.7 no.4
• /
• pp.310-317
• /
• 2007

In this paper, an analysis and hysteretic controller design of a $3^{rd}$ order buck converter is presented. The proposed hysteretic controller consists of an inner current-loop, just like the conventional cascade control scheme, and an outer voltage-loop for load voltage regulation. Although it is possible to include an inner current loop from different branches of the converter, from the feasibility and operational point of view, the load side capacitor current would be the better choice. The addition of an inner current-loop improves the dynamic performance of the converter while preserving the robustness of the hysteretic control. The controller formulation and closed-loop converter performance analysis are validated through computer simulations. Few experimental results of the proposed converter are given and compared with the buck converter.

• Journal of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.719-734
• /
• 2018

An image restoration problem with Poisson noise arises in many applications of medical imaging, astronomy, and microscopy. To overcome ill-posedness, Total Variation (TV) model is commonly used owing to edge preserving property. Since staircase artifacts are observed in restored smooth regions, higher-order TV regularization is introduced. However, sharpness of edges in the image is also attenuated. To compromise benefits of TV and higher-order TV, the weighted sum of the non-convex TV and non-convex higher order TV is used as a regularizer in the proposed variational model. The proposed model is non-convex and non-smooth, and so it is very challenging to solve the model. We propose an iterative reweighted algorithm with the proximal linearized alternating direction method of multipliers to solve the proposed model and study convergence properties of the algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1373-1386
• /
• 2017

In this paper, we introduce and explore suggested notions of 'above', 'below' and 'between' in general groupoids, Bin(X), as well as in more detail in several well-known classes of groupoids, including groups, semigroups, selective groupoids (digraphs), d/BCK-algebras, linear groupoids over fields and special cases, in order to illustrate the usefulness of these ideas. Additionally, for groupoid-classes (e.g., BCK-algebras) where these notions have already been accepted in a standard form, we look at connections between the several definitions which result from our introduction of these ideas as presented in this paper.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.434-436
• /
• 1992

In this paper, we propose a new multilevel nonlinear filter for simultaneous edge detection and noise suppression, which we call a order statistic-median hybrid(OMH) filler. The median-related filters cause an edge shift in the presence of an impulse near the edge. The proposed filter reduces such edge shifting while suppressing impulsive as well as nonimpulsive noise. We show that at the noisy edge point the OMH filter is substantially superior to the median filter, the $\alpha$-TM filter and the STM filter[I] in two respects: (a) the output bias error and (b) the output mean square error. Test results confirm that the OMH filter is robust in preserving sharp edges, inhibiting edge shifting, and suppressing a wide variety of noise. The structure for the OMH filter integrated circuit is also described.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.23-30
• /
• 2005

Causal order of message delivery algorithm ensures that every transmitted message is delivered in causal order. It should be noted that control information should be transmitted with each message in order to enforce causal order. Hence, it is important to reduce this communication overhead because the impact of the overhead increases proportionally with the number of related processes. In this paper we propose and evaluate effective a ${\Delta}-causal$ order algorithm for multimedia data which have real-time property. To reduce transmission overhead, proposed algorithm eliminates redundant information as early as possible which is not explicitly required for preserving causal order. Average communication overhead of our algorithm is much smaller than other existing algorithms.