Watermarking methods require robustness against various attacks. Conventional watermarking methods use error-correcting codes or spread spectrum to correct watermarking errors. Errors can also be reduced by embedding the watermark into the frequency domain and by using SIFT feature points. If the type and strength of the attack can be estimated, the errors can be further reduced. There are several types of attacks, such as scaling, rotation, and cropping, and it is necessary to aim for robustness against all of them. Focusing on the scaling tolerance of watermarks, we propose a watermarking method using SIFT feature points and DFT, and introduce a pilot signal. The proposed method estimates the scaling rate using the pilot signal in the form of a grid. When a stego-image is scaled, the grid interval of the pilot signal also changes, and the scaling rate can be estimated from the amount of change. The accuracy of estimating the scaling rate by the proposed method was evaluated in terms of the relative error of the scaling rate. The results show that the proposed method could reduce errors in the watermark by using the estimated scaling rate.

This paper proposes a novel differential active self-interference canceller (DASIC) algorithm for asynchronous in-band full-duplex (IBFD) Gaussian filtered frequency shift keying (GFSK), which is designed for wireless Internet of Things (IoT). In IBFD communications, where two terminals simultaneously transmit and receive signals in the same frequency band, there is an extremely strong self-interference (SI). The SI can be mitigated by an active SI canceller (ASIC), which subtracts an interference replica based on channel state information (CSI) from the received signal. The challenging problem is the realization of asynchronous IBFD for wireless IoT in indoor environments. In the asynchronous mode, pilot contamination is induced by the non-orthogonality between asynchronous pilot sequences. In addition, the transceiver suffers from analog front-end (AFE) impairments, such as phase noise. Due to these impairments, the SI cannot be canceled entirely at the receiver, resulting in residual interference. To address the above issue, the DASIC incorporates the principle of the differential codec, which enables to suppress SI without the CSI estimation of SI owing to the differential structure. Also, on the premise of using an error correction technique, iterative detection and decoding (IDD) is applied to improve the detection capability while exchanging the extrinsic log-likelihood ratio (LLR) between the maximum a-posteriori probability (MAP) detector and the channel decoder. Finally, the validity of using the DASIC algorithm is evaluated by computer simulations in terms of the packet error rate (PER). The results clearly demonstrate the possibility of realizing asynchronous IBFD.

This study presents a novel waveguide slot array with a code-division multiplexing function for single RF chain digital beamforming. The proposed antenna is comprised of a rectangular metallic waveguide’s bottom part and a multilayer printed circuit board (PCB) with the rectangular waveguide’s top wall and slot apertures. Multiple pairs of two symmetric longitudinal slots are etched on the metal surface of the PCB, and a PIN diode is mounted across each slot. The received signals of each slot pair are multiplexed in a code-division multiplexing fashion by switching the diodes’ bias according to the Walsh Hadamard code, and the original signals are then recovered through a despreading process in the digital domain for digital beamforming. A prototype antenna with eight slot pairs has been fabricated and tested for proof of concept. The measured results show the feasibility of the proposed antenna.

This paper proposes a scheme for reducing pilot interference in cell-free massive multiple-input multiple-output (MIMO) systems through scalable access point (AP) selection and efficient pilot allocation using the Grey Wolf Optimizer (GWO). Specifically, we introduce a bidirectional large-scale fading-based (B-LSFB) AP selection method that builds high-quality connections benefiting both APs and UEs. Then, we limit the number of UEs that each AP can serve and encourage competition among UEs to improve the scalability of this approach. Additionally, we propose a grey wolf optimization based pilot allocation (GWOPA) scheme to minimize pilot contamination. Specifically, we first define a fitness function to quantify the level of pilot interference between UEs, and then construct dynamic interference relationships between any UE and its serving AP sets using a weighted fitness function to minimize pilot interference. The simulation results shows that the B-LSFB strategy achieves scalability with performance similar to large-scale fading-based (LSFB) AP selection. Furthermore, the grey wolf optimization-based pilot allocation scheme significantly improves per-user net throughput with low complexity compared to four existing schemes.

In Natural Language Understanding, intent detection and slot filling have been widely used to understand user queries. However, current methods tend to rely on single words and sentences to understand complex semantic concepts, and can only consider local information within the sentence. Therefore, they usually cannot capture long-distance dependencies well and are prone to problems where complex intentions in sentences are difficult to recognize. In order to solve the problem of long-distance dependency of the model, this paper uses ConceptNet as an external knowledge source and introduces its extensive semantic information into the multi-intent detection and slot filling model. Specifically, for a certain sentence, based on confidence scores and semantic relationships, the most relevant conceptual knowledge is selected to equip the sentence, and a concept context map with rich information is constructed. Then, the multi-head graph attention mechanism is used to strengthen context correlation and improve the semantic understanding ability of the model. The experimental results indicate that the model has significantly improved performance compared to other models on the MixATIS and MixSNIPS multi-intent datasets.

Zero-shot slot filling is a domain adaptation approach to handle unseen slots in new domains without training instances. Previous studies implemented zero-shot slot filling by predicting both slot entities and slot types. Because of the lack of knowledge about new domains, the existing methods often fail to predict slot entities for new domains as well as cannot effectively predict unseen slot types even when slot entities are correctly identified. Moreover, for some seen slot types, those methods may suffer from the domain shift problem, because the unseen context in new domains may change the explanations of the slots. In this study, we propose intrinsic representations to alleviate the domain shift problems above. Specifically, we propose a multi-relation-based representation to capture both the general and specific characteristics of slot entities, and an ontology-based representation to provide complementary knowledge on the relationships between slots and values across domains, for handling both unseen slot types and unseen contexts. We constructed a two-step pipeline model using the proposed representations to solve the domain shift problem. Experimental results in terms of the F1 score on three large datasets—Snips, SGD, and MultiWOZ 2.3—showed that our model outperformed state-of-the-art baselines by 29.62, 10.38, and 3.89, respectively. The detailed analysis with the average slot F1 score showed that our model improved the prediction by 25.82 for unseen slot types and by 10.51 for seen slot types. The results demonstrated that the proposed intrinsic representations can effectively alleviate the domain shift problem for both unseen slot types and seen slot types with unseen contexts.

Person re-identification (Re-ID) aims to match the same pedestrain identity images across different camera views. Because pedestrians will change clothes frequently for a relatively long time, while many current methods rely heavily on color appearance information or only focus on the person biometric features, these methods make the performance dropped apparently when it is applied to Clohting-Changing. To relieve this dilemma, we proposed a novel Multi Feature Fusion Attention Network (MFFAN), which learns the fine-grained local features. Then we introduced a Clothing Adaptive Attention (CAA) module, which can integrate multiple granularity features to guide model to learn pedestrain's biometric feature. Meanwhile, in order to fully verify the performance of our method on clothing-changing Re-ID problem, we designed a Clothing Generation Network (CGN), which can generate multiple pictures of the same identity wearing different clothes. Finally, experimental results show that our method exceeds the current best method by over 5% and 6% on the VCcloth and PRCC datasets respectively.

Deployment of machine-type communications (MTCs) over the current cellular network could lead to severe overloading of the radio access network of Long Term Evolution (LTE)-based systems. This paper proposes a slotted access-based solution, called the Slotted Access For Group Paging (SAFGP), to cope with the paging-induced MTC traffic. The proposed SAFGP splits paged devices into multiple access groups, and each group is then allocated separate radio resources on the LTE's Physical Random Access Channel (PRACH) in a periodic manner during the paging interval. To support the proposed scheme, a new adaptive barring algorithm is proposed to stabilize the number of successful devices in each dedicated access slot. The objective is to let as few devices transmitting preambles in an access slot as possible while ensuring that the number of preambles selected by exactly one device approximates the maximum number of uplink grants that can be allocated by the eNB for an access slot. Analysis and simulation results demonstrate that, given the same amount of time-frequency resources, the proposed method significantly improves the access success and resource utilization rates at the cost of slightly increasing the access delay compared to state-of-the-art methods.

This paper proposes a novel multi-layer substrate integrated waveguide (SIW) resonator loaded with asymmetric E-shaped slot-lines and shows a tri-band band-pass filter (BPF) using the proposed structure. In the previous literature, various SIW resonators have been proposed to simultaneously solve the problems of large area and high insertion loss. Although these SIWs have a lower insertion loss than planar-type resonators using a printed circuit board, the size of these structures tends to be larger. A multi-layer SIW resonator loaded with asymmetric E-shaped slot-lines can solve the above problems and realize a tri-band BPF without increasing the size to realize further miniaturization. The theoretical design method and the structural design are shown. Moreover, the configured structure is fabricated and measured for showing the validity of the design method in this paper.

This paper studies the performance of quantized massive multiple-input multiple-output (MIMO) systems with superimposed pilots (SP), using linear minimum mean-square-error (LMMSE) channel estimation and maximum ratio combining (MRC) detection. In contrast to previous works, arbitrary-bit analog-to-digital converters (ADCs) are considered. We derive an accurate approximation of the uplink achievable rate considering the removal of estimated pilots. Based on the analytical expression, the optimal pilot power factor that maximizes the achievable rate is deduced and an expression for energy efficiency (EE) is given. In addition, the achievable rate and the optimal power allocation policy under some asymptotic limits are analyzed. Analysis shows that the systems with higher-resolution ADCs or larger number of base station (BS) antennas need to allocate more power to pilots. In contrast, more power needs to be allocated to data when the channel is slowly varying. Numerical results show that in the low signal-to-noise ratio (SNR) region, for 1-bit quantizers, SP outperforms time-multiplexed pilots (TP) in most cases, while for systems with higher-resolution ADCs, the SP scheme is suitable for the scenarios with comparatively small number of BS antennas and relatively long channel coherence time.

In this letter, the almost binary sequence (sequence with a single zero element) is considered as a special class of binary sequence. Four new bounds on the cross-correlation of balanced (almost) binary sequences with period Q ≡ 1(mod 4) under the precondition of out-of-phase autocorrelation values {-1} or {1, -3} are firstly presented. Then, seven new pairs of balanced (almost) binary sequences of period Q with ideal or optimal autocorrelation values and meeting the lower cross-correlation bounds are proposed by using cyclotomic classes of order 4. These new bounds of (almost) binary sequences with period Q achieve smaller maximum out-of-phase autocorrelation values and cross-correlation values.

In this paper, a linear array of 4 leaf-shaped bowtie slot antennas is proposed for use in quasi-millimeter wave band. The slot antennas array is designed to operate at 28GHz frequency band. The leaf-shaped bowtie slot antenna is a type of self-complementary antenna with low profile and low cost of fabrication. The proposed antenna structure offers improvement in radiation pattern, gain, and -10dB impedance bandwidth. Through out of this paper radiation pattern, actual gain, and -10dB impedance bandwidth are evaluated by Finite Different Time Domain (FDTD) simulation. Antenna characteristics are analyzed in the frequency range of 27GHz to 29GHz. To improve antenna characteristics such as actual gain and -10dB impedance bandwidth, a dielectric superstrate layer with relative permittivity of 10.2 is placed on top of ground plane of the slot antennas array. Three antenna structures are introduced and compared. With two layers of dielectric superstrate on top of the antennas ground plane, analysis results show that -10dB impedance bandwidth occupies the frequency range of 27.17GHz to 28.39GHz. Therefore, the operational impedance bandwidth is 1.22GHz. Maximum actual gain of the slot antennas array with two dielectric superstrate layers is 20.49dBi and -3dB gain bandwidth occupies the frequency range of 27.02GHz to 28.57GHz. To validate the analysis results, prototype of the designed slot antennas array is fabricated. Characteristics of the slot antennas array are measured and compared with the analysis results.

Binary sequences with high linear complexity and high 2-adic complexity have important applications in communication and cryptography. In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences which have high linear complexity is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, the result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).

Binary sequence pairs with optimal periodic correlation have important applications in many fields of communication systems. In this letter, four new families of binary sequence pairs are presented based on the generalized cyclotomy over Z5q, where q ≠ 5 is an odd prime. All these binary sequence pairs have optimal three-level correlation values {-1, 3}.

This letter expands the previously proposed High Time Resolution Carrier Interferometry (HTRCI) to estimate a larger amount of channel status information (CSI). HTRCI is based on a comb-type pilot symbol on OFDM and CSI for null subcarriers are interpolated by time-domain signal processing. In order to utilize such null pilot subcarriers for increasing estimable CSI, they should generally be separated in frequency-domain prior to estimation and interpolation processes. The main proposal is its separation scheme in conjunction with the HTRCI treatment of the temporal domain. Its effectiveness is verified by a pilot de-contamination on downlink two-cell MIMO transmission scenario. Binary error rate (BER) performance can be improved in comparison to conventional HTRCI and zero padding (ZP) which replaces the impulse response alias with zeros.

This paper presents the bit error rate (BER) performance of frequency domain equalization (FDE) using cyclic-shifted code division multiplexing (CDM) pilot signals for single-carrier line-of-sight (LOS) - multiple-input multiple-output (MIMO) multiplexing. We propose applying different cyclic-shift resources of the same Zadoff-Chu sequence to transmission-stream-specific pilot signals that are essential for estimating the channel response for FDE and phase noise in LOS-MIMO. To validate the effectiveness of the cyclic-shifted pilot multiplexing, we use partial low-density parity-check (LDPC) coding with double Gray mapping and collaborative decoding. Simulations show that pilot signal multiplexing using a cyclic-shifted Zadoff-Chu sequence, and frequency domain averaging of the estimated channel response are effective in achieving accurate channel estimation for single-carrier LOS-MIMO. We also show that the required received signal-to-noise power ratio at the BER of 10-7 using partial LDPC coding is decreased by more than 6.6dB compared to that without LDPC coding even for the deep notch depth of -20dB regardless of the relationship between the notch frequencies in the direct and cross links for 2×2 LOS-MIMO in a Rummler fading channel. Therefore, we conclude that the CDM-based pilot signal multiplexing with different cyclic shifts is effective in accurately estimating the channel response specific to the combination sets of transmitter and receiver antennas and in achieving a low pilot-overhead loss for single-carrier LOS-MIMO.

We propose a video magnification method for magnifying subtle color and motion changes under the presence of non-meaningful background motions. We use frequency variability to design a filter that passes only meaningful subtle changes and removes non-meaningful ones; our method obtains more impressive magnification results without artifacts than compared methods.

This paper addresses pilot contamination in massive multiple-input multiple-output (MIMO) uplink. Pilot contamination is caused by reuse of identical pilot sequences in adjacent cells. To solve pilot contamination, the base station utilizes differences between the transmission frames of different users, which are detected via joint channel and data estimation. The joint estimation is regarded as a bilinear inference problem in compressed sensing. Expectation propagation (EP) is used to propose an iterative channel and data estimation algorithm. Initial channel estimates are attained via time-shifted pilots without exploiting information about large scale fading. The proposed EP modifies two points in conventional bilinear adaptive vector approximate message-passing (BAd-VAMP). One is that EP utilizes data estimates after soft decision in the channel estimation while BAd-VAMP uses them before soft decision. The other point is that EP can utilize the prior distribution of the channel matrix while BAd-VAMP cannot in principle. Numerical simulations show that EP converges much faster than BAd-VAMP in spatially correlated MIMO, in which approximate message-passing fails to converge toward the same fixed-point as EP and BAd-VAMP.

Ising machines have attracted attention, which is expected to obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot-placement problem is one of the combinatorial optimization problems, regarded as a quadratic assignment problem, which relates to the optimal logic-block placement in a digital circuit as well as optimal delivery planning. Here, we propose a mapping to the Ising model for solving a slot-placement problem with additional constraints, called a constrained slot-placement problem, where several item pairs must be placed within a given distance. Since the behavior of Ising machines is stochastic and we map the problem to the Ising model which uses the penalty method, the obtained solution does not always satisfy the slot-placement constraint, which is different from the conventional methods such as the conventional simulated annealing. To resolve the problem, we propose an interpretation method in which a feasible solution is generated by post-processing procedures. We measured the execution time of an Ising machine and compared the execution time of the simulated annealing in which solutions with almost the same accuracy are obtained. As a result, we found that the Ising machine is faster than the simulated annealing that we implemented.

This paper expands our previously proposed semi-blind uplink interference suppression scheme for multicell multiuser massive MIMO systems to support multi modulus signals. The original proposal applies the channel state information (CSI) aided blind adaptive array (BAA) interference suppression after the beamspace preprocessing and the decision feedback channel estimation (DFCE). BAA is based on the constant modulus algorithm (CMA) which can fully exploit the degree of freedom (DoF) of massive antenna arrays to suppress both inter-user interference (IUI) and inter-cell interference (ICI). Its effectiveness has been verified under the extensive pilot contamination constraint. Unfortunately, CMA basically works well only for constant envelope signals such as QPSK and thus the proposed scheme should be expanded to cover QAM signals for more general use. This paper proposes to apply the multi modulus algorithm (MMA) and the minimum mean square error weight derivation based on data-aided sample matrix inversion (MMSE-SMI). It can successfully realize interference suppression even with the use of multi-level envelope signals such as 16QAM with satisfactorily outage probability performance below the fifth percentile.