• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.257-266
• /
• 2006

The powerful benefits of multi-antenna systems can be obtained by cooperative communications among users in multiple access environments without the need for physical arrays. This paper studies a novel cooperative signaling strategy that achieves high performance and low implementation complexity for synchronous code division multiple access (CDMA) wireless mobile networks. The validity of the proposed strategy under slow flat Rayleigh fading channel plus additive white Gaussian noise (AWGN) is verified through closed-form error probability expressions and MonteCarlo simulations. A variety of analytical results reveal that the new cooperative strategy significantly outperforms direct transmission subject to the same spectral efficiency and transmit power constraint.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.313-322
• /
• 2006

We consider a power controlled code division multiple access (CDMA) system with multiple flow types. At each of the N nodes, there are F flow types with different signal-to-interference-and-noise-ratio (SINR) requirements. To keep the complexity of the transmitter low, we assume that each node uses the same power level for all its flows. The single flow case has been fully solved and is well-understood. We concentrate on the multiple flow case, and use a novel and different approach. For the uplink problem with N = 2 and F arbitrary, the necessary and sufficient conditions to have a solution are found and proved. For the general N > 1 uplink problem, we provide a necessary condition for the problem to have a solution and an iterative algorithm to find the optimum solution. For the downlink case with F > 1 some properties of the optimal sequences are obtained.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.157-161
• /
• 2015

A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1062-1067
• /
• 2008

ABBA codes, a class of quasi-orthognal space-time block codes (QoSTBC) proposed by Tirkkonen and others, allow full rate and a fast maximum likelihood (ML) decoding, but do not have full diversity. In this paper, a linear complex precoder is proposed for ABBA codes to achieve full rate and full diversity. Moreover, the same diversity produce as that of orthogonal space-time block code with linear complex precoder (OSTBC-LCP) is achieved. Meanwhile, the size of the linear complex precoder can be reduced by half without affecting performance, which means the same complexity of decoding as that of the conventional ABBA code is guaranteed.

• Journal of Information Technology Services
• /
• v.11 no.4
• /
• pp.263-275
• /
• 2012

It is becoming hard to maintain web applications because of high complexity and duplication of web pages. However, most of research about code clone is focusing on code hunks, and their target is limited to a specific language. Thus, we propose GSIM, a language-independent statistical approach to detect similar pages based on scarcity and frequency of customized tokens. The tokens, which can be obtained from pages splitted by a set of given separators, are defined as atomic elements for calculating similarity between two pages. In this paper, the domain definition for web applications and algorithms for collecting tokens, making matrics, calculating similarity are given. We also conducted experiments on open source codes for evaluation, with our GSIM tool. The results show the applicability of the proposed method and the effects of parameters such as threshold, toughness, length of tokens, on their quality and performance.

• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.114-127
• /
• 2017

This paper proposes a color image coding algorithm based on shape-adaptive all phase biorthogonal transform (SA-APBT). This algorithm is implemented through four procedures: color space conversion, image segmentation, shape coding, and texture coding. Region-of-interest (ROI) and background area are obtained by image segmentation. Shape coding uses chain code. The texture coding of the ROI is prior to the background area. SA-APBT and uniform quantization are adopted in texture coding. Compared with the color image coding algorithm based on shape-adaptive discrete cosine transform (SA-DCT) at the same bit rates, experimental results on test color images reveal that the objective quality and subjective effects of the reconstructed images using the proposed algorithm are better, especially at low bit rates. Moreover, the complexity of the proposed algorithm is reduced because of uniform quantization.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.1
• /
• pp.59-65
• /
• 2023

A GNSS receiver must perform signal acquisition to estimate the code phase and Doppler frequency of the incoming satellite signals, which are essential information for baseband signal processing. Modernized GNSS signals have different modulation schemes and long PRN code lengths from legacy signals, which makes it difficult to acquire the signals and increases the computational complexity and time. This paper proposes a novel FFT/Inverse-FFT with baseband resampling to resolve the aforementioned challenges. The suggested algorithm uses a single block only for the FFT and thereby requires less hardware resources than conventional structures such as Double Block Zero Padding (DBZP). Experimental results based on a MATLAB simulation show this algorithm can successfully acquire GPS L1C/A, GPS L2C, Galileo E1OS, and GPS L5.

• Journal of the Korean Society of Systems Engineering
• /
• v.17 no.2
• /
• pp.37-48
• /
• 2021

Improving the plant protection system against unforeseen changes/transients during operation is essential to maintain plant safety. Under this condition, it requires rapid and accurate signal processing. The use of an Intellectual Property (IP) core for floating point calculations for Safety Critical MMIS can make numerical computations easier and more precise, improving system accuracy. It can represent and manipulate rational numbers as well as a much broader range of values with dynamic range in nuclear power plant. Systems engineering approach (SE) is used through the development process, it helps to reduce complexity and avoid omissions and invalid assumptions as delivers a better understanding of the stakeholders needs. For the implementation on the FPGA target board, the 32-bit floating-point arithmetic with IEEE-754 standards has designed using Simulink model in Matlab for all operations of addition, subtraction, multiplication and division and VHDL code generated.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.101-108
• /
• 2023

Optimizing the performance of deep neural networks on embedded systems is a challenging task that requires efficient compilers and runtime systems. We propose a TVM-based approach that consists of three steps: quantization, auto-scheduling, and ahead-of-time compilation. Our approach reduces the computational complexity of models without significant loss of accuracy, and generates optimized code for various hardware platforms. We evaluate our approach on three representative CNNs using ImageNet Dataset on the NVIDIA Jetson AGX Xavier board and show that it outperforms baseline methods in terms of processing speed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1296-1309
• /
• 2023

In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.