• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.3 no.2
• /
• pp.61-71
• /
• 2004

Transorthogonal 코드를 블록 단위로 확장해서 얻은 코드 집합을 적절하게 부집합으로 나누고 부호화기의 코드집합으로 할당한다. 이러한 부초화기를 병렬로 구성하고 정보 비트에 의해 선택된 부호화기의 각 출력 코드들을 합산하여 전송하는 다중코드 transorthogonal 변조 방식이 제안되어 있다. 본 논문에서는 다중코드 transorthogonal 변조 시스템의 부호화기로부터의 각 출력 코드를 또 다른 정보 비트로 이진 위상 변조한 후 합산하여 전송하는 시스템을 제안한다. 다중코드 transorthogonal 변조 시스템에서 적용된 정 진폭 부호화 알고리즘과정 전폭 부호화에 사용된 잉여비트를 이용한 수신 에러 정정 알고리즘을 제안된 시스템에 수정 없이 적용할 수 있으며 다중코드 transorthogonal 변조 방식에 비해 대역폭 효율이 개선됨을 보인다.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.72-75
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

• Journal of Advanced Navigation Technology
• /
• v.10 no.3
• /
• pp.213-218
• /
• 2006

In this paper, we analyzed the performance of orthogonal frequency division multiplexing/ frequency hopping multiple access(OFDM/FHMA) hybrid system that in impulsive interference and broadband wireless communication channel then we applied the turbo code scheme to make satisfied in data and voice transmission service. Also, we compared the bit error rate(BER) performance of turbo coded diversity scheme in the OFDM/FHMA hybrid system. As a result of simulation, proposed OFDM/FHMA hybrid system shows the enhancement of 10 times compared to the general OFDM/FHMA system.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.39-47
• /
• 2021

Lempel-Ziv coding is one of the most famous source coding schemes. The output of this source coding is usually a non-uniform code, which requires additional source coding, such as arithmetic coding, to reduce a redundancy. However, this additional source code increases complexity and decoding latency. Thus, this paper proposes the optimal maximum a-posteriori (MAP) receiver for non-uniform source non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC). First, we derive an analytical expression of the bit-error rate (BER) for non-uniform source NOMA with SSC. Then, Monte Carlo simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform source. Moreover, we also show that the BER of an approximate analytical expression is in a good agreement with the BER of Monte Carlo simulation. As a result, the proposed optimal MAP receiver for non-uniform source could be a promising scheme for NOMA with SSC, to reduce complexity and decoding latency due to additional source coding.

• Journal of Intelligence and Information Systems
• /
• v.17 no.2
• /
• pp.97-107
• /
• 2011

Nowadays there are a lot of issues about copyright infringement in the Internet world because the digital content on the network can be copied and delivered easily. Indeed the copied version has same quality with the original one. So, copyright owners and content provider want a powerful solution to protect their content. The popular one of the solutions was DRM (digital rights management) that is based on encryption technology and rights control. However, DRM-free service was launched after Steve Jobs who is CEO of Apple proposed a new music service paradigm without DRM, and the DRM is disappeared at the online music market. Even though the online music service decided to not equip the DRM solution, copyright owners and content providers are still searching a solution to protect their content. A solution to replace the DRM technology is digital audio watermarking technology which can embed copyright information into the music. In this paper, the author proposed a new audio watermarking algorithm with two approaches. First, the watermark information is generated by two dimensional barcode which has error correction code. So, the information can be recovered by itself if the errors fall into the range of the error tolerance. The other one is to use chirp sequence of CDMA (code division multiple access). These make the algorithm robust to the several malicious attacks. There are many 2D barcodes. Especially, QR code which is one of the matrix barcodes can express the information and the expression is freer than that of the other matrix barcodes. QR code has the square patterns with double at the three corners and these indicate the boundary of the symbol. This feature of the QR code is proper to express the watermark information. That is, because the QR code is 2D barcodes, nonlinear code and matrix code, it can be modulated to the spread spectrum and can be used for the watermarking algorithm. The proposed algorithm assigns the different spread spectrum sequences to the individual users respectively. In the case that the assigned code sequences are orthogonal, we can identify the watermark information of the individual user from an audio content. The algorithm used the Walsh code as an orthogonal code. The watermark information is rearranged to the 1D sequence from 2D barcode and modulated by the Walsh code. The modulated watermark information is embedded into the DCT (discrete cosine transform) domain of the original audio content. For the performance evaluation, I used 3 audio samples, "Amazing Grace", "Oh! Carol" and "Take me home country roads", The attacks for the robustness test were MP3 compression, echo attack, and sub woofer boost. The MP3 compression was performed by a tool of Cool Edit Pro 2.0. The specification of MP3 was CBR(Constant Bit Rate) 128kbps, 44,100Hz, and stereo. The echo attack had the echo with initial volume 70%, decay 75%, and delay 100msec. The sub woofer boost attack was a modification attack of low frequency part in the Fourier coefficients. The test results showed the proposed algorithm is robust to the attacks. In the MP3 attack, the strength of the watermark information is not affected, and then the watermark can be detected from all of the sample audios. In the sub woofer boost attack, the watermark was detected when the strength is 0.3. Also, in the case of echo attack, the watermark can be identified if the strength is greater and equal than 0.5.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.1-8
• /
• 2006

In the asynchrous OFCDM(Orthogonal Frequency and Code Division Multiplexing) system, a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC (Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yeilded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification code(PCSSCG:Patial Cell Specific Scrambling Code Group) of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions with the nearly same performance. The proposed method is to be compared and verified through the computer simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.7
• /
• pp.2623-2631
• /
• 2010

In this paper, we propose a new interference cancellation(IC) receiver for multirate Multicarrier DS/CDMA(MC DS/CDMA) system based on orthogonal variable spreading factor(OVSF) code. The users are assigned different lengths of OVSF codes as a spreading code according to their data rates and the active users having same representative code split into a group for effective cancellation. The code grouping interference cancellation(IC) receiver performs cancellation between the groups first and cancellation within group. This proposed IC receiver can cancel the interferences using desired user's code information and then desired signals are detected. The results show that the large improvement in performance can be attained by group-wise IC scheme and we can make the effective systems compare to conventional ones. The bit error rate of the system is analytically derived in frequency selective Rayleigh fading channel and we also compare the system performance with that of multirate DS/CDMA system. We also analyze the performance of the proposed system with same bandwidth and processing gain. The results show the large improvement in performance that can be attained by cancellation scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.139-149
• /
• 2007

Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC(Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.5
• /
• pp.25-36
• /
• 2022

This paper proposes a random sign reversal technique in space frequency block code for single carrier modulation. The traditional space time and frequency block coding technique may be confronted with radio environments openly, severe radio hijacking problems are to be overcome. In order to avoid such an open radio issue, random coded data protection technique for space-time block code was proposed, but this algorithm can change channel combination per an Orthogonal Frequency Division Multiplexing block. This kind of slow switching increases the probability that nearby receivers will detect the transmitted data. This paper proposes a fast switching algorithm per data symbols' basis which is a random sign reversal technique in space frequency block code for Single Carrier Modulation. It is shown in simulation that the proposed one has a superior performance in comparison with the performance of the receiver which do not know the random timing sequence of sign reversal.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.175-185
• /
• 2009

In this paper, performance of OFDM systems with turbo code is analyzed and simulated in a satellite broadcasting channel. The performance is evaluated in terms of bit error probability. The satellite channel is modeled as a combination of Rayleigh fading with shadowing and Rician fading channels. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision Viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is substantially improved by increasing the number of iterations and interleaver length of a turbo encoder. The results in this paper can be applied to OFDM-based satellite broadcasting systems.