• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.21-27
• /
• 2006

We present and analyze a class of limited sensing random access algorithms with powerful properties. The algorithms are implementable in wireless mobile environments and their operational properties are simple. Their throughput in the worst case of the limit Poisson user model is 0.4297, while this throughput degrades gracefully in the presence of channel feedback errors.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.1
• /
• pp.85-90
• /
• 2022

In this paper, an asynchronous nonvolatile memory module using a self-diagnosis function was designed. For the system to work, a lot of data must be input/output, and memory that can be stored is required. The volatile memory is fast, but data is erased without power, and the nonvolatile memory is slow, but data can be stored semi-permanently without power. The non-volatile static random-access memory is designed to solve these memory problems. However, the non-volatile static random-access memory is weak external noise or electrical shock, data can be some error. To solve these data errors, self-diagnosis algorithms were applied to non-volatile static random-access memory using error correction code, cyclic redundancy check 32 and data check sum to increase the reliability and accuracy of data retention. In addition, the possibility of application to an asynchronous non-volatile storage system requiring reliability was suggested.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.415-420
• /
• 2010

Cryptographic keys for security should be generated by true random number generators that apply irreversible hashing algorithms to initial values taken from a random source. As DRAM shows randomness in its access latency, it can be used as a random source. However, systems with synchronous DRAM (SDRAM) do not easily expose such randomness resulting in highly clustered random numbers. We resolved this problem by using the xor instruction. Statistical testing shows that the generated random bits have the quality comparable to true random bit sequences. The performance of bit generation is at the order of 100 Kbits/sec. Since the proposed random number generation requires neither external devices nor any special circuits, this method may be used in any computing device that employs DRAM.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.379-389
• /
• 2015

With the advent of non-volatile memories such as Phase Change Memory (PCM or PRAM) and Magneto Resistive RAM (MRAM), active studies have been carried out on how to replace Dynamic Random-Access Memory (DRAM) with PRAM. In this paper, we study both endurance and performance issues of existing join algorithms that are based on PRAM-based computer systems and have been widely used until now: Block Nested Loop Join, Sort-Merge Join, Grace Hash Join, and Hybrid Hash Join. Our experimental results show that the existing join algorithms need to be redesigned to improve both the endurance and performance of PRAMs. To the best of our knowledge, this is the first research to scientifically study the results of the four join algorithms running on PRAM-based systems. In this work, our main contribution is the modeling and implementation of a PRAM-based simulator for a comparative study of the existing join algorithms.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.49-52
• /
• 2003

IEEE 802.11 MAC uses a distributed coordination function (DCF) known as carrier sense multiple access with collision avoidance (CSMA/CA) for medium access. Random back-off algorithm helps to avoid the collision. This paper proposes virtual back-off and modified back-off algorithm for reduce a waiting time by back-off and reduce the collision. The modified DCF is consisted of these two algorithms. We expect to reduce the average waiting time of each transmission by using the modified DCF algorithm.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.439-445
• /
• 2016

In this paper, we consider subcarrier-index modulation (SIM) for precoded orthogonal frequency division multiplexing (OFDM) with a few activated subcarriers per user and its generalization to multi-carrier multiple access systems. The resulting multiple access is called sparse index multiple access (SIMA). SIMA can be considered as a combination of multi-carrier code division multiple access (MC-CDMA) and SIM. Thus, SIMA is able to exploit a path diversity gain by (random) spreading over multiple carriers as MC-CDMA. To detect multiple users' signals, a low-complexity detection method is proposed by exploiting the notion of compressive sensing (CS). The derived low-complexity detection method is based on the orthogonal matching pursuit (OMP) algorithm, which is one of greedy algorithms used to estimate sparse signals in CS. From simulation results, we can observe that SIMA can perform better than MC-CDMA when the ratio of the number of users to the number of multi-carrier is low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.803-819
• /
• 1999

We introduces a wireless multimedia CDMA system configuring multiple transmission links between a user and radio ports. We propose a centralized reservation access control scheme with transmission scheduling and dynamic allocation (CRMA/TSDA) to support the diverse multimedia traffic in the introduced CDMA system. We propose two types of transmission allocation algorithms: slot and link allocation algorithms with local information and global information. The transmission allocation algorithm proposed in this paper allocates a set of ports configuring multiple radio links and transmission slot/power to each of scheduled transmission requests. We perform simulations for the proposed system and algorithms. Through the simulation, we show that the performance of the algorithm with local information stands comparison with that of the quasi-optimum algorithm with global information. Also, the two algorithms in the system has shown to have better performance than the conventional CDMA system with a distributed random transmission method.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.21 no.1
• /
• pp.15-22
• /
• 2013

In oceanic flight routes, HF radio and satellite data links have weather restrictions, long propagation delay and low data throughput. In this paper, we propose oceanic aeronautical communications scheme in the VHF band based on ad-hoc communication. The proposed scheme organizes autonomously a multi-hop network that is divided into multiple local network using aircraft to fly long-distance communication and supports a hybrid type of multiple access, which consists of random access and TDMA (Time Division Multiple Access) scheme. In addition, several algorithms to apply spatial reuse of transmission to multi-hop long range communication environments have been proposed. The proposed system proves performance improvement on delay time as an effective solution to communicate end-to-end on the oceanic flight routes and strengthens the reliability of oceanic aeronautical communication.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.348-357
• /
• 2019

Fog radio access network (F-RAN) architectures provide markedly improved performance compared to conventional approaches. In this paper, an efficient genetic algorithm-based content distribution scheme is proposed that improves the throughput and reduces the transmission delay of a F-RAN. First, an F-RAN system model is presented that includes a certain number of randomly distributed fog access points (F-APs) that cache popular content from cloud and other sources. Second, the problem of efficient content distribution in F-RANs is described. Third, the details of the proposed optimal genetic algorithm-based content distribution scheme are presented. Finally, simulation results are presented that show the performance of the proposed algorithm rapidly approaches the optimal throughput. When compared with the performance of existing random and exhaustive algorithms, that of the proposed method is demonstrably superior.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.