How do developers shape data protection regulations when they are passed from the policy arena to technical teams for compliance? This study explores data protection compliance work (DPCW) as a sociotechnical process mediated by developers’ attitudes and experiences. We draw on 14 semi-structured interviews with individuals responsible for GDPR and/or CCPA compliance to examine how developers approach DPCW and the resulting implications for user privacy. We highlight three key ways in which developers can shape compliance: by creatively interpreting ambiguous regulatory requirements; by exploiting expectations of technical expertise and low accountability; and by reducing DPCW to a one-time project. We conclude by discussing the implications for both researchers and practitioners and by recommending how to conceptualize and conduct DPCW otherwise. This article adds specificity to understanding why and how developers’ attitudes and experiences affect data protection regulations in the field.

There is a "Digital Divide" between rural and non-rural residents. A major initiative in bridging this gap is the approval of rules for the use of television white spaces (TVWSs) by the Federal Communications Commission (FCC). The IEEE 802.22 standard provides guidelines for utilizing these TVWS channels while protecting the incumbent user's rights. However, due to the high peak-to-average-power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM)-based IEEE 802.22 signals, the power amplifier (PA) in the transmitter RF chain is operated in its saturation region, causing signal clipping and hence, spectral leakage in the adjacent channels. To combat this issue, we propose a novel, computationally fast approach for digital predistortion (DPD) of the PA in spectrally agile wireless transmitters such that the RF mask is complied with.

We develop a new 4 × 4 Hadamard-precoded quasi-orthogonal space-time block code (QO-STBC) that enables highly effective near-maximum-likelihood (near-ML) reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate minimization is being used to optimize the code rotation angle. Detailed computational complexity evaluation of the decoder in terms of real multiplications and additions shows significant complexity reduction for symbol alphabet sizes of interest. Numerical and simulation studies demonstrate negligible bit-error-rate degradation compared to the state-of-the-art in bit-error-rate by ML decoded 4 × 4 codewords.

We present a new 4×4 Hadamard-precoded Quasi-Orthogonal Space-Time Block Code (QO-STBC) that enables reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate analysis is carried out and used to optimize the code rotation angles. For benchmarking purposes, the maximum-likelihood (ML) code detector is also derived with complexity of the order of joint two-real-symbol decoding. Numerical and simulation studies compare linear filter decoding against ML decoding.

In this paper, we propose an optimal strategy for the transmission of scalable video over packet-based multiple-input multiple-output (MIMO) systems. The scalable extension of H.264/AVC that provides a combined temporal, quality and spatial scalability is used. For given channel conditions, we develop a method for the estimation of the distortion of the received video and propose different error concealment schemes. We show the accuracy of our distortion estimation algorithm in comparison with simulated wireless video transmission with packet errors. In the proposed MIMO system, we employ orthogonal space-time block codes (O-STBC) that guarantee independent transmission of different symbols within the block code. In the proposed constrained bandwidth allocation framework, we use the estimated end-to-end decoder distortion to optimally select the application layer parameters, i.e., quantization parameter (QP) and group of pictures (GOP) size, and physical layer parameters, i.e., rate-compatible turbo (RCPT) code rate and symbol constellation. Results show the substantial performance gain by using different symbol constellations across the scalable layers as compared to a fixed constellation.

An 8times8 two-symbol decodable quasi-orthogonal space-time block code (QO-STBC) is presented which can be transmitted across either 8 or 4 antennas with full rate and the same full diversity order. For the 8-transmit-antenna system, a new expression is developed to identify rotation angles that maximize the diversity (eigenvalue) product. In addition, it is shown that the previously proposed sum-eigenvalue maximization criterion for the design of rotation angles is not relevant/applicable and an alternative minimum eigenvalue maximization criterion is suggested. Finally, new optimal rotation angles are obtained by working directly with a pairwise-error-probability (PEP) upperbound expression. For 4-transmit-antenna systems and correlated channel fading conditions, the PEP-upper-bound is modified accordingly to take into account the channel correlation. Using the new PEP-upper-bound we obtain rotation angles that maximize the diversity product and find, contrary to previous results, that the optimized angles are independent of the correlation coefficient. Simulation studies initiated herein demonstrate the advantage of using the proposed codeword across 4 transmit antennas when compared with other 4times4 QO-STBC transmission schemes. For 8 transmit antennas, the studies compare the three selected rotation angle optimization criteria (diversity product, minimum eigenvalue, PEP-upper-bound).

We derive a new expression for the rotation angles that maximize the diversity (eigenvalue) product of the 8×8 two-symbol decodable quasi-orthogonal space-time block code (QO-STBC). We show that the previously proposed sum-eigenvalue maximization criterion for the design of rotation angles is not relevant/applicable to the 8-transmit-antenna QO-STBCs and we suggest, instead, minimum eigenvalue maximization. Finally, working directly with the pairwise-error-probability (PEP) upper bound expression, we obtain new true PEP-upper-bound optimal rotation angles. Simulation studies demonstrate and compare the error rate of the three design criteria (diversity product, minimum eigenvalue, PEP upper bound).

Recent advances in the area of binary sequences for code-division multiplexing provide us with minimum total-squared-correlation (TSC) optimal signature sets for (almost) all signature lengths L and set sizes K. The sets are scalable as long as K les L (underloaded systems) and non- scalable -in general require signature re-design/re-assignment as users enter or exit- when K > L (overloaded systems). In this paper, we derive new lower bounds on the conditional TSC of overloaded binary signature sets built on fixed full- load TSC-optimal sets. Overloading is allowed to be as high as 100%. Scalable designs that achieve the new bounds are then developed. To evaluate the performance of the proposed designs, we compare the TSC of our constructions to the unconditionally minimum achievable TSC values.