• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1215-1218
• /
• 1998

본 논문은 Digital Audio Compression(AC-3) Standard 인 A-52를 기반으로 하였으며 Borland C++3.1 Compiler를 사용하여 AC-3 Decoding Algorithm 구현하였다. Input Stream은 DVD VOB File에서 AC-3 Stream만을 분리하여 사용하며 최종 출력은 16 Bit PCM File이다. AC-3의 Frame구조는 Synchronization Information, Bit Stream Information, Audio Block, Auxiliary Data, Error Check로 구성된다. Aduio Block 은 모두 6개의 Block으로 나뉘어져 있다. BSI와 Side Information을 참조하여 Exponent를 추출하여 Exponent Strategy에 따라 Exponent를 복원한다. 복원된 Exponent 정보를 이용하여 Bit Allocation을 수행하여 각각의 Mantissa에 할당된 Bit수를 계산하고 Stream으로부터 Mantissa를 추출한다. Coupling Parameter를 참조하ㅕ Coupling Channel을 Original Channel로 복원시킨다. Stereo Mode에 대해서는 Rematrixing을 수행한다. Dynamic Range는 Mantissa와 Exponent의 Magnitude를 바꾸는 것으로 선택적으로 사용할 수 있다. Mantissa와 Exponent를 결합하여 Floating Point coefficient로 만든 후 Inverse Transform을 수행하면 PCM Data를 얻을 수 있다. PC에서 듣기 위해서는 Multi Channel을 Stereo나 Mono로 Downmix를 수행한다. 이렇게 만들어진 PCM data는 PCM Data를 재생하는 프로그램으로 재생할 수 있다.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.421-427
• /
• 2011

Problems encountered in IEEE 802.11 medium access control (MAC) design are interferences from neighboring or hidden nodes and collision from simultaneous transmissions within the same contention floors. This paper presents the selective decoding schemes in MAC protocol for multiple input multiple output ad-hoc networks. It is able to mitigate interferences by using a developed minimum mean-squared error technique. This interference mitigation combined with the maximum likelihood decoding schemes for the Alamouti coding enables the receiver to decode and differentiate the desired data streams from co-channel data streams. As a result, it allows a pair of simultaneous transmissions to the same or different nodes which yields the network utilization increase. Moreover, the presented three decoding schemes and time line operations are optimally selected corresponding to the transmission demand of neighboring nodes to avoid collision. The selection is determined by the number of request to send (RTS) packets and the type of clear to send packets. Both theoretical channel capacity and simulation results show that the proposed selective decoding scheme MAC protocol outperforms the mitigation interference using multiple antennas and the parallel RTS processing protocols for the cases of (1) single data stream and (2) two independent data streams which are simultaneously transmitted by two independent transmitters.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.57-70
• /
• 2008

This paper introduces a new paradigm of physical layer security through channel coding for wireless networks. The well known spread spectrum based physical layer security in wireless network is applicable when code division multiple access (CDMA) is used as wireless air link interface. In our proposal, we incorporate the proposed security protocol within channel coding as channel coding is an essential part of all kind of wireless communications. Channel coding has a built-in security in the sense of encoding and decoding algorithm. Decoding of a particular codeword is possible only when the encoding procedure is exactly known. This point is the key of our proposed security protocol. The common parameter that required for both encoder and decoder is generally a generator matrix. We proposed a random selection of generators according to a security key to ensure the secrecy of the networks against unauthorized access. Therefore, the conventional channel coding technique is used as a security controller of the network along with its error correcting purpose.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.195-202
• /
• 2007

A differential space-frequency block code - orthogonal frequency division multiplexing (SFBC-OFDM) scheme as a multiple-input multiple-output (MIMO) transmission technique for next-generation digital multimedia broadcasting (DMB) is proposed in this paper. A linear decoding method for differential SFBC, which performs comparably to the ML decoding method, is derived for the cases of two or four transmit antennas. A simple table lookup method is proposed to improve the efficiency of the encoding/decoding process of DSFBC for the case of non-constant modulus constellations. A DMB MIMO channel model, developed by extending the 3GPP MIMO model to fit DMB environments, is used to compare BER performances of differential space block code schemes for various channel environments. Simulation results show that the differential SFBC-16QAM scheme using either four transmit antennas with one receive antenna or two transmit antennas with two receive antennas achieves a performance gain of 12dB than that of the conventional DQPSK scheme, even with a data rate twice faster.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.18-25
• /
• 1994

Previously. TCM decoder has been using the Viterbi algorithm that was complex. In order to reduce the complexity of decoder. we proposed the “modified decoding algorithm using the path back method” and the modified decoding algorithm which extends the previous decoding algorithm to be able to applied to TCM decoder in this paper. On the gaussian and impulsive noise channel. Monte-Carlo simulation is used for analyzing the TCM performance and proving the efficiency of proposed decoding algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.424-442
• /
• 2014

Most recent research on iterative solutions for interference alignment (IA) presents solutions assuming channel reciprocity based on the suppression of interference from undesired sources by using an appropriate decoding matrix also known as a receiver combining matrix for multiple input multiple output (MIMO) interference channel networks and reciprocal networks. In this paper, we present an alternative solution for IA by designing precoding and decoding matrices based on the concept of signal leakage (the measure of signal power that leaks to unintended users) on each transmit side. We propose an iterative algorithm for an IA solution based on maximization of the signal-to-leakage-and-noise ratio (SLNR) of the transmitted signal from each transmitter. In order to make an algorithm removing the requirement of channel reciprocity, we deploy maximization of the signal-to-interference-and-noise ratio (SINR) in the design of the decoding matrices. We show through simulation that minimizing the leakage in each transmission can help achieve enhanced performance in terms of aggregate sum capacity in the system.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.478-481
• /
• 2000

In this paper, we propose a joint coding system for still images using source coding and powerful error correcting code schemes. Our system comprises an LVQ (lattice vector quantization) source coding for wavelet transformed images and turbo coding for channel coding. The parameters of the image encoder and channel encoder have been optimized for an n-D (dimension) cubic lattice (D$_{n}$, Z$_{n}$), parallel concatenation fur two simple RSC (recursive systematic convolutional code) and an interleaver. For decoding the received image in the case of the AWGN (additive white gaussian noise) channel, we used an iterative joint source-channel decoding algorithm for a SISO (soft-input soft-output) MAP (maximum a posteriori) module. The performance of transmission system has been evaluated in the PSNR, BER and iteration times. A very small degradation of the PSNR and an improvement in BER were compared to a system without joint source-channel decoding at the input of the receiver.ver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.18-25
• /
• 2020

In the fifth generation (5G) and beyond 5G (B5G) mobile communication, non-orthogonal multiple access (NOMA) has attracted great attention due to higher spectral efficiency and massive connectivity. We investigate the impacts of the channel estimation errors on the bit-error rate (BER) of NOMA, especially with the single-user decoding (SUD) receiver, which does not perform successive interference cancellation (SIC), in contrast to the conventional SIC NOMA scheme. First, an analytical expression of the BER for SUD NOMA with channel estimation errors is derived. Then, it is demonstrated that the BER performance degrades severely up to the power allocation less than about 20%. Additionally, we show that for the fixed power allocation of 10% in such power allocation range, the signal-to-noise (SNR) loss owing to channel estimation errors is about 5 dB. As a consequence, the channel estimation error should be considered for the design of the SUD NOMA scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3156-3167
• /
• 2020

One drawback of polar codes is that they are not universal, that is, to achieve optimal performance, different polar codes are required for different kinds of channel. This paper proposes a polar code construction scheme for Nakagami-m fading channel. The scheme fully considers the characteristics of Nakagami-m fading channel, and uses the optimized Bhattacharyya parameter bounds. The constructed code is applied to an orthogonal frequency division multiplexing (OFDM) system over Nakagami-m fading channel to prove the performance of polar code. Simulation result shows the proposed codes can get excellent bit error rate (BER) performance with successive cancellation list (SCL) decoding. For example, the designed polar code with cyclic redundancy check (CRC) aided SCL (L = 8) decoding achieves 1.1dB of gain over LDPC at average BER about 10^-5 under 4-quadrature amplitude modulation (4QAM) while the code length is 1024, rate is 0.5.