• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.108-114
• /
• 1989

Introducing and optimizing bit-significance to the Hopfield model, ten highly correlated binary images, i.e., numbers "0" to "9", are successfully stored and retrieved in a $6{}8$ node system. Unlike many other neural network models, this model has stronger error correction capability for correlated images such as "6","8","3", and "9". The bit significance optimization is regarded as an adaptive learning process based on least-mean-square error algorithm, and may be implemented with Widrow-Hoff neural nets optimizer. A design for electro-optic implementation including the adaptive optimization networks is also introduced.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.132-138
• /
• 2012

VANET(Vehicular Ad-hoc Network), standardization of IEEE 802.11p specification is in process. 802.11 MAC protocol grants all nodes equal opportunity to acquire channel without regard to their bit-rates, making it possible for lower bit-rate nodes to occupy communication channel for a fair amount of time thus keeping the higher bit-rate nodes from acquiring connection channel which downward-equalize the overall network performance. Also with the 802.11p MAC protocol, the probability of collision occurring increases as the number of nodes grow. The proposed algorithm is a new MAC protocol that guarantees nodes with acquired channel a firm priority over other nodes for a fixed amount of time with TXOP concept added to 'packet burst' according to the current transmitting speed. This newly designed algorithm allows the construction of wireless network with enhanced network throughput, decreased probability of collisions as well as providing the means to grant each node a fair chance of acquiring connection according to their channel conditions. The algorithm sets the CW's (Contention Window) width wider than the standard's and modulates the continuous transmitting threshold value depending on channel acquired time, thus improving the overall performance of the network.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.3
• /
• pp.16-21
• /
• 2010

In this paper, the linear source and relay precoders are designed for AF MIMO relay systems. In order to minimize mean squared error (MSE) of received symbol vector, the source and relay precoders are proposed, and MMSE receiver which is suitable to those precoders is utilized at the destination node. As the optimal precoders for source and relay nodes are not represented in closed form and induced by iterative method, we suggest a simple precoder design scheme. Simulation results show that the performance of the proposed precoding scheme is comparable with that of optimal scheme and outperforms other relay precoding schemes. Moreover, in high SNR region, it is revealed that SNR between source and relay node is more influential than SNR between relay and destination node in terms of bit error rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1777-1784
• /
• 1998

The packet error rates of an optical packet switching node with an optical address processor using an EDFA in order to detect M-ary correlation pulses at a fiber-optical delay line matched filter output have been evaluated. Effects of A PIN diode NEP, the gain and noise figure of the EDFA, and the bandwidth of an optical filter on the packet error rate of the switching node have been compared. There is negligible error rate change depending upon the variation of the PIN diode NEP and the EDFA gain. If the bandwidth of the optical filter is below 10 times of the data rate, there is no appreciable effect on the error rate. If the noise figure of the EDFA increases, however, the power penalty increases as much as the noise figure increment at all the bit rates and for address code sets considered in this work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7A
• /
• pp.562-567
• /
• 2009

In this paper, two-hop beamforming relay system, with source, relay, and destination nodes, is considered and the transmit- and receive-beamforming vectors and the relay processing matrix are designed for minimizing a mean square error (MMSE) between the transmit and receive signals. Here, to reduce the transmit power of the source or the relay, two local inequality constraints are involved with MMSE problem. By adopting the Lagrange method, closed formed Karush-Kuhn-Tucker (KKT) conditions (equalities) are derived and an iterative algorithm is developed to solve the entangled KKT equalities. Due to the inequality power constraints, the source or the relay can reduce its transmit power when the received signal-to-noise ratios (SNRs) of the first- and the second-hop are different. Meanwhile, the destination can achieve almost identical bit-error-rate performance compared to an optimal beamforming system maximizing the received SNR. This claim is supported by a computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.817-825
• /
• 2013

The UHDTV system, which provides realistic service with ultra-high definite video and multi-channel audio, has been studied as a next generation broadcasting service. Since the conventional digital terrestrial transmission system is not capable to cover the increased transmission data rate of the UHDTV service, there are great necessity of researches about increase of data rate. Accordingly, the researches has been studied to increase the transmission data rate of the DVB-T2 system using dual-polarized MIMO technique and high order modulation. In order to optimize the MIMO DVB-T2 system where irregular LDPC codes are used, it is necessary to study the design of the bit mapper that matches the LDPC code and QAM symbols in MIMO channel. However, the research related to the design of the bit mapper has been limited to the SISO system. Therefore, this paper defines a new parameter that indicates the VND distribution of MIMO DVB-T2 system and performs the performance analysis according to the parameter which will be helpful for designing a MIMO bit mapper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1919-1927
• /
• 1993

A new MAC protocol has been proposed and analysed to relieve the unfairness problems exhibited by the basic version of the DQDB standard. DQDB MAC protocol has the unfairness problems in throughputs. message delay and so or. And when the slots are reused or the file transmissions takes long, the unfairness problems in the system become worse. The new access protocol proposed here, which of called the Balanced DQDB, guarantees a fair bandwidth distribution by using one bit of the dual bus network protocol and keeps up all characteristics of DQDB. the DQDB analysis model introduced by Wen Jing, et al, was considered to analyse a sequential balance distribution of solts. And the probabilities of the empty in operation mode were represented to determine the probabilities for busy bits to generate on each node of the bus using the Markov chain. Through the simulations. the performances of the proposed Balanced DQDB and that of the standard DQDB of the BWB mechanism were compared at the state that the values of the RQ or CD counter on each node varied dynamically. As the results, it is shown that the Balanced DQDB has the decrement of throughputs in upstream, but the numbers of the used empty slots at each node of the Balanced DQDB had more than that of the others because the Balanced DQDB has over 0.9 throughputs in the 70~80% nodes of total node and it has constant throughputs at each node. And there results were analogous to that of the analytical model.

• ETRI Journal
• /
• v.27 no.5
• /
• pp.639-642
• /
• 2005

This paper proposes two kinds of complexity-reduced algorithms for a low density parity check (LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.