Hao Wang, Yu Bai, Jie Liu et al. · 2021
Aiming at the high cost of embedding annotation watermark in a narrow small area and the information distortion caused by the change of annotation watermark image resolution, this paper proposes a color block code technology, which uses location information and color code to form recognizable graphics, which can not only simplify the annotation graphics, but also ensure the recognition efficiency. First, the constituent elements of color block code are designed, and then the coding and decoding method of color block code is proposed. Experiments show that color block code has high anti-scaling and anti-interference, and can be widely used in the labeling of small object surface and low resolution image.
Cited by 0
Xiao Li-ping, XU Cheng-qian, Weifeng Zhang · 2006
A full rate space-time block code (STBC) for four transmit antennas based on quasi-orthogonal design is proposed in this paper. The 4times4 transmission matrix of the presented quasi-orthogonal space-time block code (QOSTBC) is constructed based on Alamouti's scheme. The original maximum-likelihood (ML) decoding scheme and the low-complexity ML (LC-ML) decoding scheme for the new code are introduced. Then the decoding speed of them is compared. The simulation results show: the performance of the new code is better than that of orthogonal space-time block codes (OSTBC) at low SNR; it also exceeds the bit error rate (BER) of OSTBC at high SNR if the new code uses constellation rotation; the LC-ML decoding scheme is faster than the original ML decoding scheme.
Cited by 2
Iosr Journals, Prof.Prafulla D. Gawande Mr.Vishal G. Jadhao · Figshare · 2014
Cited by 0Open access
Shahrouz Sharifi, Mehdi Dabirnia, A. Korhan Tanc et al. · 2016
We focus on short block length code design for Gaussian interference channels (GICs) using trellis-based codes. We employ two different decoding techniques at the receiver side, namely, joint maximum likelihood (JML) decoding and single user (SU) minimum distance decoding. For different interference levels (strong and weak) and decoding strategies, we derive error-rate bounds to evaluate the code performance. We utilize the derived bounds in code design and provide several numerical examples for both strong and weak interference cases. We show that under the JML decoding, the newly designed codes offer significant improvements over the alternatives of optimal point-to-point (P2P) trellis-based codes and off-the-shelf low density parity check (LDPC) codes with the same block lengths.
Cited by 1
Day-Fann Shen, Jin Li, Han-Chih Chang et al. · 2005
Current trademark classification procedure adopts the Vienna approach developed by World Intellectual Property Organization (WIPO). It has the following drawbacks. 1) Tremendous amount of human efforts are required to classify and annotate each trademark submitted for registration; the time required to complete the registration would increasing as the number of registered trademarks increases. 2) Same trademark may be classified into different classes by two human classifiers. 3) It is difficult to classify trademarks with abstractive contents by human classifier. For the above reasons, it is important to improve the existing trademark classification system by replacing human classifier with effective and precise computer algorithms. As we review previous researches on trademark indexing and retrieval, we find that shape information together with profile and contents of trademark plays an important role in determining the trademark similarity. In this paper, we develop an effective feature for trademark image using block feature index (BFI), the concept is borrowed from vector quantization. For performance evaluation purpose, 3000 trademark images in MEPG-7 were classified into 10 categories for experiments. We compare the recall rate and precision for the proposed BFIC algorithm and two well-known methods: Hu's 7 moments (H7M) and Zernike moments (ZKM), the proposed BFIC method outperforms the other two methods. The performance can be even better by cascading the proposed BFIC and ZKM.
Cited by 6
Merve Turan, Mengüç Öner, Hakan Ali Çırpan · Akademik Açık Erişim (Işık Üniversitesi) · 2014
Signal identification techniques developed for the purpose of blind and noncooperative identification of the transmission parameters of unknown communication signals have been employed both in military and civilian applications. Blind identification of the Space-Time Block Codes (STBC) used in a multiantenna transmisson can be regarded as one of the new and most significant challenges presented to the signal identification systems by the Multiple-Input-Multiple-Output (MIMO) transmission systems. In this work, we present novel STBC classification algorithms that exploit the cyclostationary characteristics of the coded transmit signals as discriminating features.
Cited by 0Open access
Satashu Goel, Rohit Negi · 2007
A 'queued-code' is a novel code which allows for instantaneous rate adaptation, to match the current channel state information (CSI), assumed known to the transmitter. Previously, information theoretic codes were analyzed in the regime of large delay bounds. Numerical results had demonstrated the performance gain of these codes over fixed rate codes, in a range of situations. This paper presents queued-codes which are designed using low density parity check (LDPC) block codes. Simulation results demonstrate performance gain of these codes over fixed rate LDPC block codes. The simulation results are consistent with the numerical results obtained for the information theoretic codes, which is a satisfying result. Further, this paper argues for the use of rate adaptation within a codeword, as opposed to rate adaptation across codewords, when CSI is available at the transmitter.
Cited by 2
Yang Zhong-li · 2004
This paper presents a project about infraframe convolutional interleaving encoding of block code based on convolutional interleaving encoding of block code. The error-correcting performance of this coding scheme is disscussed by an example.
Cited by 0
Anand Kumar · Institutional Repository @ NAL (University of Southampton) · 1987
Multi-block schemes which enhance the scope of application of Computational Fluid Dynamics to complex configurations are discussed. Basic steps in the coding of a multi-block scheme are described.Euler solutions for the vortex dominated flow over a cropped delta wing are piesented
Cited by 0
2008
Abstract — A ‘queued-code ’ is a novel code which allows for instantaneous rate adaptation, to match the current channel state information (CSI), assumed known to the transmitter. Previously, information theoretic codes were analyzed in the regime of large delay bounds. Numerical results had demonstrated the performance gain of these codes over fixed rate codes, in a range of situations. This paper presents queued-codes which are designed using low density parity check (LDPC) block codes. Simulation results demonstrate performance gain of these codes over fixed rate LDPC block codes. The simulation results are consistent with the numerical results obtained for the information theoretic codes, which is a satisfying result. Further, this paper argues for the use of rate adaptation within a codeword, as opposed to rate adaptation across codewords, when CSI is available at the transmitter.
Cited by 0
Karlo G. Lenzi, Jose A. B. Filho, Felipe A. P. de Figueiredo · 2013
A very efficient algorithm and hardware architecture for code block segmentation used on LTE-Advanced channel coding physical layer (PHY) is presented in this paper. Code block segmentation is a generic procedure which is commonly applied before turbo encoding. Its main function is to fragment a large transport block into smaller code blocks. This approach reduces memory requirements of the turbo code interleaver, without compromising its coding gain, since turbo encoder improves its performance as the size of the code block increases. The current work presents not only an optimized procedure with reduced computational complexity, but also an architecture with very low resource count, regarding ASIC or FPGA implementations, performing at a maximum frequency of 351 MHz on a FPGA architecture.
Cited by 5
Xuan Nam Tran, Xuan-Nghia Nguyen, Minh-Tuan Le et al. · IEEE Communications Letters · 2018
A high-rate spatially modulated space-time block code (HRSM-STBC) based on golden code is presented in which the spatial constellation (SC) codewords and the core STBC code matrix are designed for two active antennas. In addition to the high rate of the core STBC, the number of SC codewords offered by the HRSM-STBC scheme is the largest as compared to existing schemes that have the same antenna configuration. Consequently, the proposed scheme can provide the highest spectral efficiency to date. To maximize the achievable coding gain and diversity, the optimization of the HRSM-STBC is carried out. Performance advantages of our proposed scheme over its existing counterparts such as STBC-SM, H-STBC-SM, STBC-CSM, and DT-SM are demonstrated.
Cited by 7
Ranelyn I. Ral, Ann Leslie V. Flores · Asian Research Journal of Mathematics · 2023
Studies on the binary block codes generated by some ordered algebraic structures have been the interest of many researchers. In this paper, we study the binary block code generated by an arbitrary JU-algebra and investigate some of its properties. For this intent, we introduce the notion of a JU function \(\phi\) on a nonempty set P into a JU-algebra X, and by using that concept, j-functions and j-subsets of P for an arbitrary element j on a JU-algebra X are investigated. Furthermore, we define a new order on the generated code C based on the JU-algebra X, and show that every finite JU-algebra with its order and the corresponding generated code C with the defined order have the same structures. Finally, we generate a JU-algebra from a particular set of binary block code.
Cited by 2Open access
Turan, Merve, Oner, Menguc, Cirpan, Hakan Ali · Akademik Açık Erişim (Işık Üniversitesi) · 2019
22nd IEEE Signal Processing and Communications Applications Conference (SIU) -- APR 23-25, 2014 -- Karadeniz Teknik Univ, Trabzon, TURKEY
Cited by 0Open access
Patricia Armando, Karine Amis, Dominique Roux · HAL (Le Centre pour la Communication Scientifique Directe) · 2007
This paper deals with multiple-input multiple-output communication system with single-carrier modulation and frequency domain equalization. Space-time coding schemes adapted to frequency-selective channels namely space-time block codes per block are used. An efficient generalized receiver based on space-time frequency domain detector is investigated. We propose the frequency domain derivation of a generalized minimum mean square error turbo equalizer for orthogonal space-time block code per block. The main advantage of our proposed scheme is that it can be applied to any orthogonal space-time block code per block. Simulation results show that the scheme performs efficiently over frequency-selective block fading channels.
Cited by 3Open access
Oudomsack Pierre Pasquero, Matthieu Crussière, Youssef Nasser et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2009
International audience
Cited by 0
Almas Uddin Ahmed, Hafizal Mohamad · 2007
We construct a simple scheme which is a combination of Orthogonal Space-Time Block Codes (OSTBCs) with liner block code for two transmitting antennas to achieve high diversity order with a simple decoding algorithm on Rayleigh fading channel of Multiple Input/Multiple Output (MIMO) systems. The scheme is designed by using the cyclic code with rate 1/2 and 1/3, leading to a flexible and exploit of OSTBC for multiple antenna systems. Our proposed scheme minimizes the average Bit Error Ratio (BER) and improves the system diversity even if only a Maximum Likilihood (ML) receiver is used. The simulation models have been developed using Matlab V 7.0 software and send them through a Raleigh channel to analyze the performance in terms of BER vs. Signal to Noise Ratio (SNR). It has been shown that the Alamouti scheme using cyclic code is extremely robust against MIMO Rayleigh fading channel and thus outperforms other transmission schemes.
Cited by 2
Safa Najjar, Fatma Rouissi, Héla Gassara et al. · 2019
This contribution proposes a coding procedure for the binary frequency shift keying (FSK) modulation, to combat the severe narrowband power line communication (NB-PLC) channel constraints, in particular, the impulse noise (IN). The coding procedure is composed of a short 2-error correcting Bose-Chaudhuri-Hocquenghem (BCH) block code concatenated with a permutation code (PC) with a minimum distance of d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">min</sub> = 2. The parameters of the BCH codes are optimized to delete the error floor (EF) effect caused by the IN. Three different decision techniques are compared, which are FSK select largest (FSK/SL), FSK soft decision (FSK/SD), and spread FSK (SFSK). The proposed concatenated codes scheme using FSK/SL gives the same performance results achieved by FSK/SD while keeping low computational complexity. The system removes the EF and gives a Bit Error Rate (BER) = 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-5</sup> at Signal-to-Noise Ratio (SNR) = 15.6 dB under realistic PLC channel transfer function and IN conditions, gaining more than 10 dB over the PC only system.
Cited by 0
Oudomsack Pierre Pasquero, Matthieu Crussière, Youssef Nasser et al. · 2009
In this paper, we propose a novel and simple MIMO channel estimation technique based on 2D spread pilots. Taking advantage of the simplicity and flexibility of 2D spread pilot channel estimation, we easily combine the Alamouti code with the Walsh-Hadamard codes to obtain a space code block code (SCBC) MIMO scheme. We demonstrate that our proposed system is much more efficient in high mobility scenario than the classical STBC scheme. The performance evaluated over a realistic channel model shows the efficiency of this technique which turns out to be a promising MIMO channel estimation technique for the future mobile video broadcasting systems.
Cited by 1
WANG An-guo, SHEN Qiong, NIE Zhong-er · SHILAP Revista de lepidopterología · 2011
In order to meet the needs of high-speed and large-capacity in communication system,the novel non-orthogonal space-time block code with code rates 2 and 1.5 were proposed,respectively.The simplified conditional maximum-likelihood algorithm is adopted to reduce the decoding complexity.The simulation results show that the channel capacities of proposed code are very close to the actual value,and the BER performance is better than that of the orthogonal and quasi-orthogonal codes.
Cited by 0Open access